SIAM Journal on Discrete Mathematics, Volume 14

Volume 14, Number 1, 2001

Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. 1-27
Electronic Edition (link) BibTeX
John P. Georges, David W. Mauro, Melanie I. Stein:
Labeling Products of Complete Graphs with a Condition at Distance Two. 28-35
Electronic Edition (link) BibTeX
Mike A. Steel:
Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences. 36-48
Electronic Edition (link) BibTeX
David Hartvigsen:
Compact Representations of Cuts. 49-66
Electronic Edition (link) BibTeX
Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-Shop Scheduling. 67-92
Electronic Edition (link) BibTeX
Nicholas Pippenger:
Enumeration of Equicolorable Trees. 93-115
Electronic Edition (link) BibTeX
Michael Naatz:
A Note on a Question of C. D. Savage. 116-120
Electronic Edition (link) BibTeX
Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol:
Cyclic Chromatic Number of 3-Connected Plane Graphs. 121-137
Electronic Edition (link) BibTeX
Michel X. Goemans:
Approximate Edge Splitting. 138-141
Electronic Edition (link) BibTeX

Volume 14, Number 2, 2001

Jesús A. De Loera, Francisco Santos, Fumihiko Takeuchi:
Extremal Properties for Dissections of Convex 3-Polytopes. 143-161
Electronic Edition (link) BibTeX
John Friedlander, Igor Shparlinski:
On the Distribution of Diffie-Hellman Triples with Sparse Exponents. 162-169
Electronic Edition (link) BibTeX
Joseph Cheriyan, András Sebö, Zoltán Szigeti:
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. 170-180
Electronic Edition (link) BibTeX
János Körner, Angelo Monti:
Compact Representations of the Intersection Structure of Families of Finite Sets. 181-192
Electronic Edition (link) BibTeX
David A. Christie, Robert W. Irving:
Sorting Strings by Reversals and by Transpositions. 193-206
Electronic Edition (link) BibTeX
Leszek Gasieniec, Andrzej Pelc, David Peleg:
The Wakeup Problem in Synchronous Broadcast Systems. 207-222
Electronic Edition (link) BibTeX
Kevin D. Wayne:
A New Property and a Faster Algorithm for Baseball Elimination. 223-229
Electronic Edition (link) BibTeX
Gill Barequet:
A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. 230-236
Electronic Edition (link) BibTeX
Chi-Jen Lu, Shi-Chun Tsai:
A Note on Iterating an alpha-ary Gray Code. 237-239
Electronic Edition (link) BibTeX
Frank Ruskey, C. Robert Miers, Joe Sawada:
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. 240-245
Electronic Edition (link) BibTeX
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. 246-255
Electronic Edition (link) BibTeX
Ryoh Fuji-Hara, Ying Miao, Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes. 256-266
Electronic Edition (link) BibTeX
Michele Flammini, Stephane Perennes:
On the Optimality of General Lower Bounds for Broadcasting and Gossiping. 267-282
Electronic Edition (link) BibTeX

Volume 14, Number 3, 2001

Tim Boykett:
Construction of Ferrero Pairs of All Possible Orders. 283-285
Electronic Edition (link) BibTeX
Krzysztof Brys, Zbigniew Lonc:
Monochromatic Partitions of Complete Uniform Hypergraphs. 286-290
Electronic Edition (link) BibTeX
Young-Soo Myung:
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting. 291-298
Electronic Edition (link) BibTeX
Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick:
On Lower Bounds for Selecting the Median. 299-311
Electronic Edition (link) BibTeX
Dorit Dor, Uri Zwick:
Median Selection Requires (2+epsilon)n Comparisons. 312-325
Electronic Edition (link) BibTeX
Thomas Erlebach, Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. 326-355
Electronic Edition (link) BibTeX
Gregory L. Smith:
Partitions and (m and n) Sums of Products - Two Cell Partition. 356-369
Electronic Edition (link) BibTeX
Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
Minimum Span of No-Hole (r+1)-Distant Colorings. 370-380
Electronic Edition (link) BibTeX
Kazuhisa Makino, Tiko Kameda:
Transformations on Regular Nondominated Coteries and Their Applications. 381-407
Electronic Edition (link) BibTeX
Guy Kortsarz, Robert Krauthgamer:
On Approximating the Achromatic Number. 408-422
Electronic Edition (link) BibTeX
Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor:
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents. 423-431
Electronic Edition (link) BibTeX

Volume 14, Number 4, 2001

Amir Daneshgar:
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. 433-445
Electronic Edition (link) BibTeX
Lynn Margaret Batten, Jeremy M. Dover:
Blocking Semiovals of Type (1, m+1, n+1). 446-457
Electronic Edition (link) BibTeX
Steven S. Seiden:
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. 458-470
Electronic Edition (link) BibTeX
Tomás Feder:
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. 471-480
Electronic Edition (link) BibTeX
Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays. 481-497
Electronic Edition (link) BibTeX
Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote:
The Obnoxious Center Problem on a Tree. 498-509
Electronic Edition (link) BibTeX
Weiping Shi, Douglas B. West:
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs. 510-523
Electronic Edition (link) BibTeX
G. Brightwell, G. Oriolo, F. Bruce Shepherd:
Reserving Resilient Capacity in a Network. 524-539
Electronic Edition (link) BibTeX
S. H. Huang, Frank K. Hwang:
When is Individual Testing Optimal for Nonadaptive Group Testing? 540-548
Electronic Edition (link) BibTeX
Po-Ning Chen, Yunghsiang S. Han:
Asymptotic Minimum Covering Radius of Block Codes. 549-564
Electronic Edition (link) BibTeX