SIAM Journal on Discrete Mathematics, Volume 7

Volume 7, Number 1, 1994

• Noga Alon, Jehoshua Bruck:
  Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. 1-8
  Electronic Edition (link) BibTeX
• Edward A. Bender, E. Rodney Canfield:
  The Number of Degree-Restricted Rooted Maps on the Sphere. 9-15
  Electronic Edition (link) BibTeX
• Sunil Chopra:
  The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs. 16-31
  Electronic Edition (link) BibTeX
• Stefan Felsner, Michel Habib, Rolf H. Möhring:
  On the Interplay Between Interval Dimension and Dimension. 32-40
  Electronic Edition (link) BibTeX
• Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
  The Private Neighbor Cube. 41-47
  Electronic Edition (link) BibTeX
• Peter C. Fishburn, James A. Reeds:
  Bell Inequalities, Grothendieck's Constant, and Root Two. 48-56
  Electronic Edition (link) BibTeX
• D. Frank Hsu, Xing-De Jia:
  Extremal Problems in the Construction of Distributed Loop Networks. 57-71
  Electronic Edition (link) BibTeX
• Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
  On-Line Coloring and Recursive Graph Theory. 72-89
  Electronic Edition (link) BibTeX
• Imre Leader, A. J. Radcliffe:
  Littlewood-Offord Inequalities for Random Variables. 90-101
  Electronic Edition (link) BibTeX
• Chris J. Mitchell, Michael Walker, Peter R. Wild:
  The Combinatorics of Perfect Authentication Schemes. 102-107
  Electronic Edition (link) BibTeX
• Nicholas Pippenger, Geng Lin:
  Fault-Tolerant Circuit-Switching Networks. 108-118
  Electronic Edition (link) BibTeX
• Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
  Sorting on a Mesh-Connected Computer with Delaying Links. 119-132
  Electronic Edition (link) BibTeX
• Denise Sakai:
  Labeling Chordal Graphs: Distance Two Condition. 133-140
  Electronic Edition (link) BibTeX
• C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey:
  Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs. 141-151
  Electronic Edition (link) BibTeX
• Lily Yen:
  A Note on Multiset Permutations. 152-155
  Electronic Edition (link) BibTeX

Volume 7, Number 2, 1994

• Malay K. Sen, B. K. Sanyal:
  Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders. 157-165
  Electronic Edition (link) BibTeX
• Guo-Hui Zhang:
  Some New Bounds on Single-Change Covering Designs. 166-171
  Electronic Edition (link) BibTeX
• Seth M. Malitz, Achilleas Papakostas:
  On the Angular Resolution of Planar Graphs. 172-183
  Electronic Edition (link) BibTeX
• Noga Alon, Paul D. Seymour, Robin Thomas:
  Planar Separators. 184-193
  Electronic Edition (link) BibTeX
• G. M. Constantine, T. H. Savits:
  A Stochastic Process Interpretation of Partition Identities. 194-202
  Electronic Edition (link) BibTeX
• Genghua Fan, Roland Häggkvist:
  The Square of a Hamiltonian Cycle. 203-212
  Electronic Edition (link) BibTeX
• Alan P. Sprague:
  An 0(n log n) Algorithm for Bandwidth of Interval Graphs. 213-220
  Electronic Edition (link) BibTeX
• Robert Grone, Russell Merris:
  The Laplacian Spectrum of a Graph II. 221-229
  Electronic Edition (link) BibTeX
• Frank Thomson Leighton:
  A 2d-1 Lower Bound for Two-Layer Knock-Knee Channel Routing. 230-237
  Electronic Edition (link) BibTeX
• Claude Carlet:
  The Divisors of x²m+x of Constant Derivatives and Degree 2^m-2. 238-244
  Electronic Edition (link) BibTeX
• Sunil Chopra:
  The k-Edge-Connected Spanning Subgraph Polyhedron. 245-259
  Electronic Edition (link) BibTeX
• Daphne Koller, Nimrod Megiddo:
  Constructing Small Sample Spaces Satisfying Given Constants. 260-274
  Electronic Edition (link) BibTeX
• Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani:
  The Minimum Satisfiability Problem. 275-283
  Electronic Edition (link) BibTeX
• Kai-Yeung Siu, Vwani P. Roychowdhury:
  On Optimal Depth Threshold Circuits for Multiplication andRelated Problems. 284-292
  Electronic Edition (link) BibTeX
• Alexander A. Ageev:
  On Finding Critical Independent and Vertex Sets. 293-295
  Electronic Edition (link) BibTeX
• Fred R. McMorris, Tandy Warnow, Thomas Wimer:
  Triangulating Vertex-Colored Graphs. 296-306
  Electronic Edition (link) BibTeX
• Svatopluk Poljak, Zsolt Tuza:
  Bipartite Subgraphs of Triangle-Free Graphs. 307-313
  Electronic Edition (link) BibTeX
• Jun Gao, J. Michael Steele:
  Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem. 314-324
  Electronic Edition (link) BibTeX
• László Babai, Haluk Oral, Kevin T. Phelps:
  Eulerian Self-Dual Codes. 325-330
  Electronic Edition (link) BibTeX
• Jayme Luiz Szwarcfiter, Claudson F. Bornstein:
  Clique Graphs of Chordal and Path Graphs. 331-336
  Electronic Edition (link) BibTeX

Volume 7, Number 3, 1994

• Christophe Mouaha:
  On Systematic Codes Obtained from Linear Codes Over GF(q²). 337-343
  Electronic Edition (link) BibTeX
• Francisco Barahona, Ali Ridha Mahjoub:
  Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. 344-358
  Electronic Edition (link) BibTeX
• Francisco Barahona, Ali Ridha Mahjoub:
  Compositions of Graphs and Polyhedra II: Stable Sets. 359-371
  Electronic Edition (link) BibTeX
• Francisco Barahona, Ali Ridha Mahjoub:
  Compositions of Graphs and Polyhedra III: Graphs with No W₄ Minor. 372-389
  Electronic Edition (link) BibTeX
• Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub:
  Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. 390-402
  Electronic Edition (link) BibTeX
• David Hartvigsen, Russell Mardon:
  The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. 403-418
  Electronic Edition (link) BibTeX
• William M. Y. Goh, Eric Schmutz:
  Random Set Partitions. 419-436
  Electronic Edition (link) BibTeX
• David P. Day, Ortrud Oellermann, Henda C. Swart:
  Steiner Distance-Hereditary Graphs. 437-442
  Electronic Edition (link) BibTeX
• Fan R. K. Chung, V. Faber, Thomas A. Manteuffel:
  An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. 443-457
  Electronic Edition (link) BibTeX
• James F. Lynch:
  Random Resource Allocation Graphs and the Probability of Deadlock. 458-473
  Electronic Edition (link) BibTeX
• Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman:
  Even Cycles in Directed Graphs. 474-483
  Electronic Edition (link) BibTeX
• Johan Håstad:
  On the Size of Weights for Threshold Gates. 484-492
  Electronic Edition (link) BibTeX
• David C. Fisher:
  Domination, Fractional Domination, 2-Packing, and Graph Products. 493-498
  Electronic Edition (link) BibTeX
• Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
  Normal and Self-dual Normal Bases from Factorization of c x^q+1 + d x^q - ax - b. 499-512
  Electronic Edition (link) BibTeX
• Noga Alon, Fan R. K. Chung, Ronald L. Graham:
  Routing Permutations on Graphs Via Matchings. 513-530
  Electronic Edition (link) BibTeX

Volume 7, Number 4, 1994

• Endre Boros, Peter L. Hammer, John N. Hooker:
  Predicting Cause-Effect Relationships from Incomplete Discrete Observations. 531-543
  Electronic Edition (link) BibTeX
• Patrick Solé, Thomas Zaslavsky:
  A Coding Approach to Signed Graphs. 544-553
  Electronic Edition (link) BibTeX
• Gerard van der Geer, Marcel van der Vlugt:
  Generalized Hamming Weights of Melas Codes and Dual Melas Codes. 554-559
  Electronic Edition (link) BibTeX
• Moshe Morgenstern:
  Ramanujan Diagrams. 560-570
  Electronic Edition (link) BibTeX
• Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer:
  On Path-Tough Graphs. 571-584
  Electronic Edition (link) BibTeX
• Jack A. A. van der Veen:
  A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems. 585-592
  Electronic Edition (link) BibTeX
• Arjana Zitnik:
  Drawing Graphs on Surfaces. 593-597
  Electronic Edition (link) BibTeX
• Glenn Hurlbert:
  On Universal Cycles for k-Subsets of an n-Set. 598-604
  Electronic Edition (link) BibTeX
• Arundhati Raychaudhuri:
  Further Results on T-Coloring and Frequency Assignment Problems. 605-613
  Electronic Edition (link) BibTeX
• Jianer Chen:
  A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. 614-631
  Electronic Edition (link) BibTeX
• Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari:
  Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs. 632-646
  Electronic Edition (link) BibTeX
• Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan:
  Treewidth of Circular-Arc Graphs. 647-655
  Electronic Edition (link) BibTeX
• Michel X. Goemans, David P. Williamson:
  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem. 656-666
  Electronic Edition (link) BibTeX
• Yvo Desmedt, Yair Frankel:
  Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group. 667-679
  Electronic Edition (link) BibTeX