SIAM Journal on Discrete Mathematics, Volume 12

Volume 12, Number 1, 1999

• Andrew V. Goldberg, Satish Rao:
  Flows in Undirected Unit Capacity Networks. 1-5
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. 6-26
  Electronic Edition (link) BibTeX
• Kevin T. Phelps, Mike LeVan:
  Nonsystematic Perfect codes. 27-34
  Electronic Edition (link) BibTeX
• Josep Rifà:
  Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube. 35-47
  Electronic Edition (link) BibTeX
• Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl:
  Constructive Quasi-Ramsey Numbers and Tournament Ranking. 48-63
  Electronic Edition (link) BibTeX
• Louxin Zhang:
  Optimal Bounds for Matching Routing on Trees. 64-77
  Electronic Edition (link) BibTeX
• Ming-Yang Kao, Stephen R. Tate:
  On-Line Difference Maximization. 78-90
  Electronic Edition (link) BibTeX
• Alberto Caprara:
  Sorting Permutations by Reversals and Eulerian Cycle Decompositions. 91-110
  Electronic Edition (link) BibTeX
• Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder:
  Median Graphs and Triangle-Free Graphs. 111-118
  Electronic Edition (link) BibTeX
• Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
  Convexity and HHD-Free Graphs. 119-135
  Electronic Edition (link) BibTeX
• Brigitte Servatius, Walter Whiteley:
  Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths. 136-153
  Electronic Edition (link) BibTeX

Volume 12, Number 2, 1999

• Philippe Flajolet, Helmut Prodinger:
  On Stirling Numbers for Complex Arguments and Hankel Contours. 155-159
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti:
  Edge-Connectivity Augmentation with Partition Constraints. 160-207
  Electronic Edition (link) BibTeX
• Alan M. Frieze, Michal Karonski, Lubos Thoma:
  On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. 208-216
  Electronic Edition (link) BibTeX
• Zhicheng Gao, Nicholas C. Wormald:
  The Size of the Largest Components in Random Planar Maps. 217-228
  Electronic Edition (link) BibTeX
• Jianer Chen, Saroja P. Kanchi:
  Graph Ear Decompositions and Graph Embeddings. 229-242
  Electronic Edition (link) BibTeX
• Tero Laihonen, Simon Litsyn:
  New Bounds On Covering Radius as a Function of Dual Distance. 243-251
  Electronic Edition (link) BibTeX
• Ding-Zhu Du, Frank K. Hwang, Guoliang Xue:
  Interconnecting Highways. 252-261
  Electronic Edition (link) BibTeX
• Jeannette Janssen, Kyriakos Kilakos:
  Bounded Stable Sets: Polytopes and Colorings. 262-275
  Electronic Edition (link) BibTeX
• Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
  Independent Sets in Asteroidal Triple-Free Graphs. 276-287
  Electronic Edition (link) BibTeX

Volume 12, Number 3, 1999

• Vineet Bafna, Piotr Berman, Toshihiro Fujito:
  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. 289-297
  Electronic Edition (link) BibTeX
• Todd G. Will:
  Switching Distance Between Graphs with the Same Degrees. 298-306
  Electronic Edition (link) BibTeX
• Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
  Edge-Bandwidth of Graphs. 307-316
  Electronic Edition (link) BibTeX
• Xin He, Ming-Yang Kao, Hsueh-I Lu:
  Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. 317-325
  Electronic Edition (link) BibTeX
• G. Bolotashvili, M. Kovalev, E. Girlich:
  New Facets of the Linear Ordering Polytope. 326-336
  Electronic Edition (link) BibTeX
• Hikoe Enomoto, Miki Shimabara Miyauchi:
  Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine. 337-341
  Electronic Edition (link) BibTeX
• Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
  Finding Subsets Maximizing Minimum Structures. 342-359
  Electronic Edition (link) BibTeX
• Stefan Felsner, Klaus Reuter:
  The Linear Extension Diameter of a Poset. 360-373
  Electronic Edition (link) BibTeX
• Jan Kratochvíl, Zsolt Tuza:
  Rankings of Directed Graphs. 374-384
  Electronic Edition (link) BibTeX
• András Gyárfás, Zoltán Király, Jenö Lehel:
  On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. 385-411
  Electronic Edition (link) BibTeX
• Russell Merris:
  Note: An Upper Bound for the Diameter of a Graph. 412-412
  Electronic Edition (link) BibTeX

Volume 12, Number 4, 1999

• Anders Björner, Volkmar Welker:
  Complexes of Directed Graphs. 413-424
  Electronic Edition (link) BibTeX
• Balaji Raghavachari, Jeyakesavan Veerasamy:
  A 3/2-Approximation Algorithm for the Mixed Postman Problem. 425-433
  Electronic Edition (link) BibTeX
• Bernhard Gittenberger:
  On the Contour of Random Trees. 434-458
  Electronic Edition (link) BibTeX
• Cyril Gavoille, David Peleg:
  The Compactness of Interval Routing. 459-473
  Electronic Edition (link) BibTeX
• Meena Mahajan, V. Vinay:
  Determinant: Old Algorithms, New Insights. 474-490
  Electronic Edition (link) BibTeX
• Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu:
  Star Extremal Circulant Graphs. 491-499
  Electronic Edition (link) BibTeX
• William W. Hager, Yaroslav Krylyuk:
  Graph Partitioning and Continuous Quadratic Programming. 500-523
  Electronic Edition (link) BibTeX
• Samit Dasgupta:
  On the Size of Minimum Super Arrovian Domains. 524-534
  Electronic Edition (link) BibTeX