SIAM Journal on Discrete Mathematics, Volume 15

Volume 15, Number 1, 2001

• Miguel Angel Fiol, Ernest Garriga:
  An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs. 1-13
  Electronic Edition (link) BibTeX
• Tim Blackmore, Graham H. Norton:
  Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. 14-40
  Electronic Edition (link) BibTeX
• Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
  On the Distributed Complexity of Computing Maximal Matchings. 41-57
  Electronic Edition (link) BibTeX
• Noga Alon, Benny Sudakov, Uri Zwick:
  Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. 58-72
  Electronic Edition (link) BibTeX
• Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas:
  Neighborhood Preserving Hashing and Approximate Queries. 73-85
  Electronic Edition (link) BibTeX
• Hong Wang:
  On Covering a Bipartite Graph with Cycles. 86-96
  Electronic Edition (link) BibTeX
• Alexander Zelikovsky, Ion I. Mandoiu:
  Practical Approximation Algorithms for Zero- and Bounded-Skew Trees. 97-111
  Electronic Edition (link) BibTeX
• Jean-Paul Doignon, Samuel Fiorini:
  Facets of the Weak Order Polytope Derived from the Induced Partition Projection. 112-121
  Electronic Edition (link) BibTeX
• Josselin Garnier, Leila Kallel:
  Efficiency of Local Search with Multiple Local Optima. 122-141
  Electronic Edition (link) BibTeX

Volume 15, Number 2, 2002

• Oleg V. Borodin, Douglas R. Woodall:
  Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. 143-154
  Electronic Edition (link) BibTeX
• Alexander Barg:
  On Some Polynomials Related to Weight Enumerators of Linear Codes. 155-164
  Electronic Edition (link) BibTeX
• Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang:
  Single Machine Scheduling with Release Dates. 165-192
  Electronic Edition (link) BibTeX
• Biing-Feng Wang:
  Finding a 2-Core of a Tree in Linear Time. 193-210
  Electronic Edition (link) BibTeX
• Noga Alon, Michael Krivelevich:
  Testing k-colorability. 211-227
  Electronic Edition (link) BibTeX
• Iiro S. Honkala, Andrew Klapper:
  Multicovering Bounds from Relative Covering Radii. 228-234
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Henry Martyn Mulder:
  Partial Cubes and Crossing Graphs. 235-251
  Electronic Edition (link) BibTeX
• Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
  Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. 252-267
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Victor Chepoi:
  Graphs with Connected Medians. 268-282
  Electronic Edition (link) BibTeX

Volume 15, Number 3, 2002

• Romeo Rizzi:
  Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. 283-288
  Electronic Edition (link) BibTeX
• Kalle Ranto:
  Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8. 289-304
  Electronic Edition (link) BibTeX
• Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo:
  Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. 305-316
  Electronic Edition (link) BibTeX
• Yaagoub Ashir, Iain A. Stewart:
  Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. 317-328
  Electronic Edition (link) BibTeX
• Gérard Cornuéjols, Bertrand Guenin:
  Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. 329-352
  Electronic Edition (link) BibTeX
• Jitender S. Deogun, Dieter Kratsch:
  Dominating Pair Graphs. 353-366
  Electronic Edition (link) BibTeX
• Bruce Kitchens:
  Multidimensional Convolutional Codes. 367-381
  Electronic Edition (link) BibTeX
• Peter C. Fishburn, Paul E. Wright:
  Interference Patterns in Regular Graphs with Bijective Colorings. 382-402
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  Strong T-Perfection of Bad-K₄-Free Graphs. 403-415
  Electronic Edition (link) BibTeX
• David Peleg, Avishai Wool:
  How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. 416-433
  Electronic Edition (link) BibTeX

Volume 15, Number 4, 2002

• Dieter Kratsch, Lorna Stewart:
  Approximating Bandwidth by Mixing Layouts of Interval Graphs. 435-449
  Electronic Edition (link) BibTeX
• Andreas S. Schulz, Martin Skutella:
  Scheduling Unrelated Machines by Randomized Rounding. 450-469
  Electronic Edition (link) BibTeX
• Eddie Cheng, Sven de Vries:
  On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. 470-487
  Electronic Edition (link) BibTeX
• Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
  Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. 488-518
  Electronic Edition (link) BibTeX
• Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
  Domination in Graphs Applied to Electric Power Networks. 519-529
  Electronic Edition (link) BibTeX
• Refael Hassin, Shlomi Rubinstein:
  Robust Matchings. 530-537
  Electronic Edition (link) BibTeX
• Weifan Wang, Ko-Wei Lih:
  Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. 538-545
  Electronic Edition (link) BibTeX
• Joe Sawada:
  A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. 546-561
  Electronic Edition (link) BibTeX
• Michael Anthony Steel, László A. Székely:
  Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. 562-575
  Electronic Edition (link) BibTeX