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

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

Romeo Rizzi:
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. 283-288
Kalle Ranto:
Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8. 289-304
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
Yaagoub Ashir, Iain A. Stewart:
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. 317-328
Gérard Cornuéjols, Bertrand Guenin:
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. 329-352
Jitender S. Deogun, Dieter Kratsch:
Dominating Pair Graphs. 353-366
Bruce Kitchens:
Multidimensional Convolutional Codes. 367-381
Peter C. Fishburn, Paul E. Wright:
Interference Patterns in Regular Graphs with Bijective Colorings. 382-402
Alexander Schrijver:
Strong T-Perfection of Bad-K₄-Free Graphs. 403-415
David Peleg, Avishai Wool:
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. 416-433

Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. 435-449
Andreas S. Schulz, Martin Skutella:
Scheduling Unrelated Machines by Randomized Rounding. 450-469
Eddie Cheng, Sven de Vries:
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. 470-487
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
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks. 519-529
Refael Hassin, Shlomi Rubinstein:
Robust Matchings. 530-537
Wei-Fan Wang, Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. 538-545
Joe Sawada:
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. 546-561
Michael Anthony Steel, László A. Székely:
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. 562-575