SIAM Journal on Discrete Mathematics, Volume 9

Volume 9, Number 1, 1996

• Greg Barnes, Uriel Feige:
  Short Random Walks on Graphs. 19-28
  Electronic Edition (link) BibTeX
• Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau:
  Spanners of Hypercube-Derived Networks. 37-54
  Electronic Edition (link) BibTeX
• Shi-Chun Tsai:
  Lower Bounds on Representing Boolean Functions as Polynomials in z_m. 55-62
  Electronic Edition (link) BibTeX
• David J. Haglin, Marty J. Wolf:
  On Convex Subsets in Tournaments. 63-70
  Electronic Edition (link) BibTeX
• Satoru Iwata, Kazuo Murota:
  Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections. 71-86
  Electronic Edition (link) BibTeX
• Ming-Yang Kao:
  Data Security Equals Graph Connectivity. 87-100
  Electronic Edition (link) BibTeX
• Daniel P. Sanders:
  On Linear Recognition of Tree-Width at Most Four. 101-117
  Electronic Edition (link) BibTeX
• Kimmo Eriksson:
  Chip-Firing Games on Mutating Graphs. 118-128
  Electronic Edition (link) BibTeX
• Lyudmil Aleksandrov, Hristo Djidjev:
  Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus. 129-150
  Electronic Edition (link) BibTeX
• Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang:
  Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups. 151-154
  Electronic Edition (link) BibTeX
• Michael Luby, Joseph Naor, Ariel Orda:
  Tight Bounds for Dynamic Storage Allocation. 155-166
  Electronic Edition (link) BibTeX

Volume 9, Number 2, 1996

• Don Coppersmith, Steven Phillips:
  On a Question of Erdös on Subsequence Sums. 173-177
  Electronic Edition (link) BibTeX
• R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
  Spanning Trees - Short or Small. 178-200
  Electronic Edition (link) BibTeX
• Tuvi Etzion:
  On the Nonexistence of Perfect Codes in the JohnsonScheme. 201-209
  Electronic Edition (link) BibTeX
• Frank Hoffmann, Klaus Kriegel:
  A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. 210-224
  Electronic Edition (link) BibTeX
• Oswin Aichholzer, Franz Aurenhammer:
  Classifying Hyperplanes in Hypercubes. 225-232
  Electronic Edition (link) BibTeX
• Martin Grötschel, Alexander Martin, Robert Weismantel:
  Packing Steiner Trees: Separation Algorithms. 233-257
  Electronic Edition (link) BibTeX
• Eddy Mayoraz:
  On the Power of Democratic Networks. 258-268
  Electronic Edition (link) BibTeX
• Binay K. Bhattacharya, Pavol Hell, Jing Huang:
  A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs. 274-289
  Electronic Edition (link) BibTeX
• Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall:
  The Ultimate Categorical Independence Ratio of a Graph. 290-300
  Electronic Edition (link) BibTeX
• Don Coppersmith, Uriel Feige, James B. Shearer:
  Random Walks on Regular and Irregular Graphs. 301-308
  Electronic Edition (link) BibTeX
• Gerard J. Chang, David Kuo:
  The L(2, 1)-Labeling Problem on Graphs. 309-316
  Electronic Edition (link) BibTeX
• Srinivasa Rao Arikati, Anil Maheshwari:
  Realizing Degree Sequences in Parallel. 317-338
  Electronic Edition (link) BibTeX
• Thomas M. Kratzke, Douglas B. West:
  The Total Interval Number of a Graph II: Trees and Complexity. 339-348
  Electronic Edition (link) BibTeX

Volume 9, Number 3, 1996

• Giuseppe Di Battista, Luca Vismara:
  Angles of Planar Triangular Graphs. 349-359
  Electronic Edition (link) BibTeX
• Jovan Dj. Golic:
  Constrained Embedding Probability for Two Binary Strings. 360-364
  Electronic Edition (link) BibTeX
• E. Andrew Boyd:
  On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. 365-376
  Electronic Edition (link) BibTeX
• Jason I. Brown, Charles J. Colbourn, David G. Wagner:
  Cohen-Macaulay Rings in Network Reliability. 377-392
  Electronic Edition (link) BibTeX
• Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor:
  Tilings of Binary Spaces. 393-412
  Electronic Edition (link) BibTeX
• Tuvi Etzion:
  Nonequivalent q-ary Perfect Codes. 413-423
  Electronic Edition (link) BibTeX
• Jürgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson:
  Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds. 424-452
  Electronic Edition (link) BibTeX
• Robert Connelly, Walter Whiteley:
  Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks. 453-491
  Electronic Edition (link) BibTeX
• Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
  Approximation Algorithms for the k-Clique Covering Problem. 492-509
  Electronic Edition (link) BibTeX

Volume 9, Number 4, 1996

• Yinan N. Shen, Fabrizio Lombardi:
  Graph Algorithms for Conformance Testing Using the Rural ChinesePostman Tour. 511-529
  Electronic Edition (link) BibTeX
• David G. Wagner:
  Multipartition Series. 529-544
  Electronic Edition (link) BibTeX
• Kazuo Murota:
  Valuated Matroid Intersection I: Optimality Criteria. 545-561
  Electronic Edition (link) BibTeX
• Kazuo Murota:
  Valuated Matroid Intersection II: Algorithms. 562-576
  Electronic Edition (link) BibTeX
• Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter:
  Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. 577-596
  Electronic Edition (link) BibTeX
• Ian F. Blake, Vahid Tarokh:
  On the Trellis Complexity of the Densest Lattice Packings in Rⁿ. 597-601
  Electronic Edition (link) BibTeX
• Sunil Chopra, Giovanni Rinaldi:
  The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. 602-624
  Electronic Edition (link) BibTeX
• Lynne L. Doty, R. J. Goldstone, Charles L. Suffel:
  Cayley Graphs with Neighbor Connectivity One. 625-642
  Electronic Edition (link) BibTeX
• Jennifer Ryan:
  IIS-Hypergraphs. 643-653
  Electronic Edition (link) BibTeX
• Terry Min Yih Wang, Carla D. Savage:
  A Gray Code for Necklaces of Fixed Density. 654-673
  Electronic Edition (link) BibTeX
• Kathryn Fraughnaugh, Stephen C. Locke:
  Finding Independent Sets in Triangle-free Graphs. 674-681
  Electronic Edition (link) BibTeX