SIAM Journal on Discrete Mathematics, Volume 20

Volume 20, Number 1, 2006

• Andrzej Czygrinow, Glenn Hurlbert:
  Girth, Pebbling, and Grid Thresholds. 1-10
  Electronic Edition (link) BibTeX
• Michael Joswig, Marc E. Pfetsch:
  Computing Optimal Morse Matchings. 11-25
  Electronic Edition (link) BibTeX
• Volkan Isler, Sampath Kannan, Sanjeev Khanna:
  Randomized Pursuit-Evasion with Local Visibility. 26-41
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli:
  Odd Hole Recognition in Graphs of Bounded Clique Size. 42-48
  Electronic Edition (link) BibTeX
• Maria Axenovich:
  Avoiding Patterns in Matrices Via a Small Number of Changes. 49-54
  Electronic Edition (link) BibTeX
• Zdenek Dvorak, Riste Skrekovski:
  A Theorem About a Contractible and Light Edge. 55-61
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Improved Bounds for Topological Cliques in Graphs of Large Girth. 62-78
  Electronic Edition (link) BibTeX
• Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson:
  Optimum Secret Sharing Scheme Secure against Cheating. 79-95
  Electronic Edition (link) BibTeX
• Yusheng Li, Wenan Zang:
  Differential Methods for Finding Independent Sets in Hypergraphs. 96-104
  Electronic Edition (link) BibTeX
• Derek G. Corneil, Ekkehard Köhler:
  Linear Orderings of Subfamilies of AT-Free Graphs. 105-118
  Electronic Edition (link) BibTeX
• Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
  Embedding k-Outerplanar Graphs into l ₁. 119-136
  Electronic Edition (link) BibTeX
• Noga Alon:
  Ranking Tournaments. 137-142
  Electronic Edition (link) BibTeX
• Nicholas Pippenger:
  The Linking Probability of Deep Spider-Web Networks. 143-159
  Electronic Edition (link) BibTeX
• Michael Dinitz:
  Full Rank Tilings of Finite Abelian Groups. 160-170
  Electronic Edition (link) BibTeX
• Paolo Dulio, Richard J. Gardner, Carla Peri:
  Discrete Point X-rays. 171-188
  Electronic Edition (link) BibTeX
• Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar:
  Improved Bounds for the Crossing Numbers of K_{m, n} and K_n. 189-202
  Electronic Edition (link) BibTeX
• János Körner, Claudia Malvenuto:
  Pairwise colliding permutations and the capacity of infinite graphs. 203-212
  Electronic Edition (link) BibTeX
• Kazuo Murota:
  M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem. 213-226
  Electronic Edition (link) BibTeX
• Andreas Alpers, Peter Gritzmann:
  On Stability, Error Correction, and Noise Compensation in Discrete Tomography. 227-239
  Electronic Edition (link) BibTeX
• Feodor F. Dragan, Chenyu Yan, Irina Lomonosov:
  Collective tree spanners of graphs. 241-260
  Electronic Edition (link) BibTeX
• Chandra Chekuri, Sudipto Guha, Joseph Naor:
  The Steiner k-Cut Problem. 261-271
  Electronic Edition (link) BibTeX