SIAM Journal on Discrete Mathematics, Volume 19

Volume 19, Number 1, 2005

• Harold N. Gabow:
  An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. 1-18
  Electronic Edition (link) BibTeX
• Michael Drmota, Hsien-Kuei Hwang:
  Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. 19-45
  Electronic Edition (link) BibTeX
• Gunnar Forst, Anders Thorup:
  What Costs Are Minimized by Huffman Trees? 46-68
  Electronic Edition (link) BibTeX
• Yael Ben-Haim, Simon Litsyn:
  Exact Minimum Density of Codes Identifying Vertices in the Square Grid. 69-82
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju:
  On Equitable Coloring of d-Degenerate Graphs. 83-95
  Electronic Edition (link) BibTeX
• Eyal Kushilevitz, Yishay Mansour:
  Computation in Noisy Radio Networks. 96-108
  Electronic Edition (link) BibTeX
• Marc Chardon, Aziz Moukrim:
  The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders. 109-121
  Electronic Edition (link) BibTeX
• Gabriel Robins, Alexander Zelikovsky:
  Tighter Bounds for Graph Steiner Tree Approximation. 122-134
  Electronic Edition (link) BibTeX
• Tomás Dvorák:
  Hamiltonian Cycles with Prescribed Edges in Hypercubes. 135-144
  Electronic Edition (link) BibTeX
• Sylvia B. Encheva:
  On Projective Codes Satisfying the Chain Condition. 145-148
  Electronic Edition (link) BibTeX
• Robert W. Chen, Alan Zame, Chien-Tai Lin, Hsiu-fen Wu:
  A Random Version of Shepp's Urn Scheme. 149-164
  Electronic Edition (link) BibTeX
• James A. Muir, Douglas R. Stinson:
  Alternative Digit Sets for Nonadjacent Representations. 165-191
  Electronic Edition (link) BibTeX
• Peter Braß:
  An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. 192-195
  Electronic Edition (link) BibTeX
• Rongquan Feng, Jin Ho Kwak, Young Soo Kwon:
  Enumerating Typical Circulant Covering Projections Onto a Circulant Graph. 196-207
  Electronic Edition (link) BibTeX
• John P. Georges, David W. Mauro:
  On the Structure of Graphs with Non-Surjective L(2, 1)-Labelings. 208-223
  Electronic Edition (link) BibTeX

Volume 19, Number 2, 2005

• Daphne Der-Fen Liu, Xuding Zhu:
  Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs. 281-293
  Electronic Edition (link) BibTeX
• Roel Apfelbaum, Micha Sharir:
  Repeated Angles in Three and Four Dimensions. 294-300
  Electronic Edition (link) BibTeX
• Don Coppersmith, Moshe Lewenstein:
  Constructive Bounds on Ordered Factorizations. 301-303
  Electronic Edition (link) BibTeX
• Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
  A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. 304-320
  Electronic Edition (link) BibTeX
• Panu Chaichanavong, Brian H. Marcus:
  Stabilization of Block-Type-Decodability Properties for Constrained Systems. 321-344
  Electronic Edition (link) BibTeX
• Tsan-sheng Hsu, Ming-Yang Kao:
  Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. 345-362
  Electronic Edition (link) BibTeX
• Iliya Bouyukliev, Patric R. J. Östergård:
  Classification of Self-Orthogonal Codes over F₃ and F₄. 363-370
  Electronic Edition (link) BibTeX
• Alexander Burstein, Sergey Kitaev:
  On Unavoidable Sets of Word Patterns. 371-381
  Electronic Edition (link) BibTeX
• Carlos J. Luz, Alexander Schrijver:
  A Convex Quadratic Characterization of the Lovász Theta Number. 382-387
  Electronic Edition (link) BibTeX
• Jin Ho Kwak, Alexander Mednykh, Valery A. Liskovets:
  Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points. 388-398
  Electronic Edition (link) BibTeX
• Sean Curran, Orlando Lee, Xingxing Yu:
  Nonseparating Planar Chains in 4-Connected Graphs. 399-419
  Electronic Edition (link) BibTeX
• Lijun Ji, Lie Zhu:
  Resolvable Steiner Quadruple Systems for the Last 23 Orders. 420-430
  Electronic Edition (link) BibTeX
• Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig:
  Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. 431-447
  Electronic Edition (link) BibTeX
• Stephen Alstrup, Philip Bille, Theis Rauhe:
  Labeling Schemes for Small Distances in Trees. 448-462
  Electronic Edition (link) BibTeX
• Philip Daniel, Charles Semple:
  A Class of General Supertree Methods for Nested Taxa. 463-480
  Electronic Edition (link) BibTeX
• Mart de Graaf, Paul Valiant:
  Polynomial Representations of Symmetric Partial Boolean Functions. 481-488
  Electronic Edition (link) BibTeX
• Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona:
  Two-Part and k-Sperner Families: New Proofs Using Permutations. 489-500
  Electronic Edition (link) BibTeX
• Hande Yaman:
  Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities. 501-522
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz:
  Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. 523-542
  Electronic Edition (link) BibTeX

Volume 19, Number 3, 2005

• Tomás Feder, Carlos S. Subi:
  Disks on a Tree: Analysis of a Combinatorial Game. 543-552
  Electronic Edition (link) BibTeX
• Frédéric Maffray, Nicolas Trotignon:
  Algorithms for Perfectly Contractile Graphs. 553-574
  Electronic Edition (link) BibTeX
• Mohamed Didi Biha:
  On the 3-Terminal Cut Polyhedron. 575-587
  Electronic Edition (link) BibTeX
• Jirí Fiala, Daniel Král, Riste Skrekovski:
  A Brooks-Type Theorem for the Generalized List T-Coloring. 588-609
  Electronic Edition (link) BibTeX
• Daphne Der-Fen Liu, Xuding Zhu:
  Multilevel Distance Labelings for Paths and Cycles. 610-621
  Electronic Edition (link) BibTeX
• Grzegorz Kubicki, Michal Morayne:
  Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case. 622-632
  Electronic Edition (link) BibTeX
• Jakob Jonsson:
  Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number. 633-650
  Electronic Edition (link) BibTeX
• David A. Pike, Yubo Zou:
  Decycling Cartesian Products of Two Cycles. 651-663
  Electronic Edition (link) BibTeX
• Petteri Kaski:
  Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms. 664-690
  Electronic Edition (link) BibTeX
• Marcel Wild:
  The Asymptotic Number of Binary Codes and Binary Matroids. 691-699
  Electronic Edition (link) BibTeX
• Joel Friedman, Jean-Pierre Tillich:
  Generalized Alon--Boppana Theorems and Error-Correcting Codes. 700-718
  Electronic Edition (link) BibTeX
• Alan M. Frieze, Michael Krivelevich, Benny Sudakov:
  The Strong Chromatic Index of Random Graphs. 719-727
  Electronic Edition (link) BibTeX
• Marcus Schaefer, Daniel Stefankovic:
  Solvability of Graph Inequalities. 728-743
  Electronic Edition (link) BibTeX
• Dennis J. Brueni, Lenwood S. Heath:
  The PMU Placement Problem. 744-761
  Electronic Edition (link) BibTeX
• Reuven Bar-Yehuda, Dror Rawitz:
  On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. 762-797
  Electronic Edition (link) BibTeX
• Dion Gijswijt:
  Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices. 798-806
  Electronic Edition (link) BibTeX
• Lowell Abrams, Donniell E. Fishkind:
  A Genus Bound for Digital Image Boundaries. 807-813
  Electronic Edition (link) BibTeX

Volume 19, Number 4, 2005

• Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
  Graph Minors and Reliable Single Message Transmission. 815-847
  Electronic Edition (link) BibTeX
• Sean Curran, Orlando Lee, Xingxing Yu:
  Chain Decompositions of 4-Connected Graphs. 848-880
  Electronic Edition (link) BibTeX
• Michael Elkin, Guy Kortsarz:
  Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. 881-899
  Electronic Edition (link) BibTeX
• Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
  Computing Minimal Triangulations in Time O(n^alpha log n) = o(n ^2.376). 900-913
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, Claude Tardif:
  Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. 914-920
  Electronic Edition (link) BibTeX
• Navin Kashyap, Paul H. Siegel, Alexander Vardy:
  An Application of Ramsey Theory to Coding for the Optical Channel. 921-937
  Electronic Edition (link) BibTeX
• Susanne Albers, Helge Bals:
  Dynamic TCP Acknowledgment: Penalizing Long Delays. 938-951
  Electronic Edition (link) BibTeX
• Jason I. Brown, Richard J. Nowakowski:
  Well-Covered Vector Spaces of Graphs. 952-965
  Electronic Edition (link) BibTeX
• Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
  On the Complexity of Some Enumeration Problems for Matroids. 966-984
  Electronic Edition (link) BibTeX
• Sanming Zhou:
  Labelling Cayley Graphs on Abelian Groups. 985-1003
  Electronic Edition (link) BibTeX
• Fabio Scarabotti:
  The Discrete Sine Transform and the Spectrum of the Finite q-ary Tree. 1004-1010
  Electronic Edition (link) BibTeX
• San Ling, Ferruh Özbudak:
  Improved p-ary Codes and Sequence Families from Galois Rings of Characteristic p². 1011-1028
  Electronic Edition (link) BibTeX
• Béla Bollobás, Don Coppersmith, Michael Elkin:
  Sparse Distance Preservers and Additive Spanners. 1029-1055
  Electronic Edition (link) BibTeX
• Ioana Dumitriu, Joel H. Spencer:
  The Two-Batch Liar Game over an Arbitrary Channel. 1056-1064
  Electronic Edition (link) BibTeX
• Satoru Fujishige, Satoru Iwata:
  Bisubmodular Function Minimization. 1065-1073
  Electronic Edition (link) BibTeX