SIAM Journal on Discrete Mathematics, Volume 8

Volume 8, Number 1, 1995

Thomas Andreae, Hans-Jürgen Bandelt:
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities. 1-16
Electronic Edition (link) BibTeX
André Bouchet, William H. Cunningham:
Delta-Matroids, Jump Systems, Bisubmodular Polyhedra. 17-32
Electronic Edition (link) BibTeX
Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian:
Dual Eulerian Properties of Plane Multigraphs. 33-50
Electronic Edition (link) BibTeX
Michael Hofmeister:
Enumeration of Concrete Regular Covering Projections. 51-61
Electronic Edition (link) BibTeX
Xing-De Jia:
Extremal Cayley Digraphs of Finite Cyclic Groups. 62-75
Electronic Edition (link) BibTeX
Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. 76-92
Electronic Edition (link) BibTeX
Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin:
On Lotteries with Unique Winners. 93-98
Electronic Edition (link) BibTeX
Yaw-Ling Lin, Steven Skiena:
Algorithms for Square Roots of Graphs. 99-118
Electronic Edition (link) BibTeX
László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model. 119-132
Electronic Edition (link) BibTeX
Hanif D. Sherali, Youngho Lee:
Sequential and Simultaneous Liftings of Minimal Cover Inequalitiesfor Generalized Upper Bound Constrained Knapsack Polytopes. 133-153
Electronic Edition (link) BibTeX

Volume 8, Number 2, 1995

Jørgen Bang-Jensen, András Frank, Bill Jackson:
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. 155-178
Electronic Edition (link) BibTeX
Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman:
Competition Graphs of Strongly Connected and Hamiltonian Digraphs. 179-185
Electronic Edition (link) BibTeX
Jaime Gonzalez, Osvaldo Landaeta:
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem. 186-195
Electronic Edition (link) BibTeX
Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård:
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. 196-207
Electronic Edition (link) BibTeX
Pavol Hell, Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles. 208-222
Electronic Edition (link) BibTeX
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. 223-250
Electronic Edition (link) BibTeX
Jeremy Spinrad:
Nonredundant 1's in Gamma-Free Matrices. 251-257
Electronic Edition (link) BibTeX
Gary K. H. Yeap, Majid Sarrafzadeh:
Sliceable Floorplanning by Graph Dualization. 258-280
Electronic Edition (link) BibTeX
Donald E. Knuth:
Two-Way Rounding. 281-290
Electronic Edition (link) BibTeX
Arthur L. Liestman, Thomas C. Shermer:
Degree-Constrained Network Spanners with Nonconstant Delay. 291-321
Electronic Edition (link) BibTeX
Nicholas Pippenger:
Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. 322-345
Electronic Edition (link) BibTeX

Volume 8, Number 3, 1995

Earl R. Barnes:
An Inequality for Probability Moments with Applications. 347-358
Electronic Edition (link) BibTeX
Leizhen Cai, Derek G. Corneil:
Tree Spanners. 359-387
Electronic Edition (link) BibTeX
Deborah S. Franzblau:
Combinatorial Algorithm for a Lower Bound on Frame Rigidity. 388-400
Electronic Edition (link) BibTeX
Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum-Time Broadcast. 401-427
Electronic Edition (link) BibTeX
Laurent Alonso, Edward M. Reingold, René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences. 428-447
Electronic Edition (link) BibTeX
Beverly Jamison, Stephan Olariu:
P-Components and the Homogeneous Decomposition of Graphs. 448-463
Electronic Edition (link) BibTeX
Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajos Calculus. 464-483
Electronic Edition (link) BibTeX

Volume 8, Number 4, 1995

Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line and First-Fit Coloring of Graphs That Do Not Induce P₅. 485-498
Electronic Edition (link) BibTeX
Marshall A. Whittlesey, John P. Georges, David W. Mauro:
On the lambda-Number of Q_n and Related Graphs. 499-506
Electronic Edition (link) BibTeX
Fred R. McMorris, Robert C. Powers:
The Median Procedure in a Formal Theory of Consensus. 507-516
Electronic Edition (link) BibTeX
Hans-Jürgen Bandelt, Michael Anthony Steel:
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid. 517-525
Electronic Edition (link) BibTeX
Ingo Althöfer, Imre Leader:
Correlation of Boolean Functions and Pathology in Recursion Trees. 526-535
Electronic Edition (link) BibTeX
Ilan Newman, Avi Wigderson:
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy. 536-542
Electronic Edition (link) BibTeX
Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset and Optimal Offset for General Single-LayerChannel Routing. 543-554
Electronic Edition (link) BibTeX
Jonathan Ashley, Brian Marcus:
Canonical Encoders for Sliding Block Decoders. 555-605
Electronic Edition (link) BibTeX
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. 606-616
Electronic Edition (link) BibTeX
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Salvage-Embeddings of Complete Trees. 617-637
Electronic Edition (link) BibTeX
Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. 638-651
Electronic Edition (link) BibTeX
Dusan B. Jevtic:
On Families of Sets of Integral Vectors Whose Representatives Form Sum-Distinct Sets. 652-660
Electronic Edition (link) BibTeX
Ramesh Krishnamurti, Bhagirath Narahari:
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. 661-669
Electronic Edition (link) BibTeX
Jürgen Bokowski, Peter Schuchert:
Altshuler's Sphere m⁹₉₆₃ Revisited. 670-677
Electronic Edition (link) BibTeX
Timothy Law Snyder, J. Michael Steele:
Equidistribution in All Dimensions of Worst-Case Point Sets forthe Traveling Salesman Problem. 678-683
Electronic Edition (link) BibTeX