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
Edward A. Bender, E. Rodney Canfield: The Number of Degree-Restricted Rooted Maps on the Sphere. 9-15
Sunil Chopra: The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs. 16-31
Stefan Felsner, Michel Habib, Rolf H. Möhring: On the Interplay Between Interval Dimension and Dimension. 32-40
Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. 41-47
D. Frank Hsu, Xing-De Jia: Extremal Problems in the Construction of Distributed Loop Networks. 57-71
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter: On-Line Coloring and Recursive Graph Theory. 72-89
Chris J. Mitchell, Michael Walker, Peter R. Wild: The Combinatorics of Perfect Authentication Schemes. 102-107
Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Sorting on a Mesh-Connected Computer with Delaying Links. 119-132
Denise Sakai: Labeling Chordal Graphs: Distance Two Condition. 133-140
C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. 141-151
Lily Yen: A Note on Multiset Permutations. 152-155
Volume 7, Number 2, 1994
Malay K. Sen, Barun K. Sanyal: Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders. 157-165
Guo-Hui Zhang: Some New Bounds on Single-Change Covering Designs. 166-171

G. M. Constantine, T. H. Savits: A Stochastic Process Interpretation of Partition Identities. 194-202
Alan P. Sprague: An 0(n log n) Algorithm for Bandwidth of Interval Graphs. 213-220
Frank Thomson Leighton: A 2d-1 Lower Bound for Two-Layer Knock-Knee Channel Routing. 230-237
Claude Carlet: The Divisors of x2m+x of Constant Derivatives and Degree 2m-2. 238-244
Sunil Chopra: The k-Edge-Connected Spanning Subgraph Polyhedron. 245-259
Daphne Koller, Nimrod Megiddo: Constructing Small Sample Spaces Satisfying Given Constraints. 260-274
Kai-Yeung Siu, Vwani P. Roychowdhury: On Optimal Depth Threshold Circuits for Multiplication and Related Problems. 284-292
Alexander A. Ageev: On Finding Critical Independent and Vertex Sets. 293-295

Jun Gao, J. Michael Steele: Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem. 314-324

Volume 7, Number 3, 1994
Christophe Mouaha: On Systematic Codes Obtained from Linear Codes Over GF(q2). 337-343
Francisco Barahona, Ali Ridha Mahjoub: Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. 344-358
Francisco Barahona, Ali Ridha Mahjoub: Compositions of Graphs and Polyhedra II: Stable Sets. 359-371
Francisco Barahona, Ali Ridha Mahjoub: Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. 372-389
Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub: Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. 390-402
David Hartvigsen, Russell Mardon: The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. 403-418

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
James F. Lynch: Random Resource Allocation Graphs and the Probability of Deadlock. 458-473
Johan Håstad: On the Size of Weights for Threshold Gates. 484-492
David C. Fisher: Domination, Fractional Domination, 2-Packing, and Graph Products. 493-498
Ian F. Blake, Shuhong Gao, Ronald C. Mullin: Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. 499-512
Volume 7, Number 4, 1994
Endre Boros, Peter L. Hammer, John N. Hooker: Predicting Cause-Effect Relationships from Incomplete Discrete Observations. 531-543
Gerard van der Geer, Marcel van der Vlugt: Generalized Hamming Weights of Melas Codes and Dual Melas Codes. 554-559
Moshe Morgenstern: Ramanujan Diagrams. 560-570
Jack A. A. van der Veen: A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems. 585-592
Arjana Zitnik: Drawing Graphs on Surfaces. 593-597
Glenn Hurlbert: On Universal Cycles for k-Subsets of an n-Set. 598-604
Arundhati Raychaudhuri: Further Results on T-Coloring and Frequency Assignment Problems. 605-613
Jianer Chen: A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. 614-631
Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari: Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. 632-646
Michel X. Goemans, David P. Williamson: New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem. 656-666
Yvo Desmedt, Yair Frankel: Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group. 667-679



