default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM 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 - André Bouchet, William H. Cunningham:
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. 17-32 - Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian:
Dual Eulerian Properties of Plane Multigraphs. 33-50 - Michael Hofmeister:
Enumeration of Concrete Regular Covering Projections. 51-61 - Xing-De Jia:
Extremal Cayley Digraphs of Finite Cyclic Groups. 62-75 - Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. 76-92 - Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin:
On Lotteries with Unique Winners. 93-98 - Yaw-Ling Lin, Steven Skiena
:
Algorithms for Square Roots of Graphs. 99-118 - László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model. 119-132 - Hanif D. Sherali, Youngho Lee:
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes. 133-153
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 - Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman:
Competition Graphs of Strongly Connected and Hamiltonian Digraphs. 179-185 - Jaime Gonzalez, Osvaldo Landaeta:
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem. 186-195 - 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 - Pavol Hell, Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles. 208-222 - Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. 223-250 - Jeremy P. Spinrad:
Nonredundant 1's in Gamma-Free Matrices. 251-257 - Gary K. H. Yeap, Majid Sarrafzadeh:
Sliceable Floorplanning by Graph Dualization. 258-280 - Donald E. Knuth:
Two-Way Rounding. 281-290 - Arthur L. Liestman, Thomas C. Shermer:
Degree-Constrained Network Spanners with Nonconstant Delay. 291-321 - Nicholas Pippenger:
Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. 322-345
Volume 8, Number 3, 1995
- Earl R. Barnes:
An Inequality for Probability Moments with Applications. 347-358 - Leizhen Cai, Derek G. Corneil:
Tree Spanners. 359-387 - Deborah S. Franzblau:
Combinatorial Algorithm for a Lower Bound on Frame Rigidity. 388-400 - Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum-Time Broadcast. 401-427 - Laurent Alonso, Edward M. Reingold, René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences. 428-447 - Beverly Jamison, Stephan Olariu:
P-Components and the Homogeneous Decomposition of Graphs. 448-463 - Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajos Calculus. 464-483
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 P5. 485-498 - Marshall A. Whittlesey, John P. Georges, David W. Mauro:
On the lambda-Number of Qn and Related Graphs. 499-506 - Fred R. McMorris, Robert C. Powers:
The Median Procedure in a Formal Theory of Consensus. 507-516 - Hans-Jürgen Bandelt, Michael Anthony Steel:
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid. 517-525 - Ingo Althöfer, Imre Leader:
Correlation of Boolean Functions and Pathology in Recursion Trees. 526-535 - Ilan Newman, Avi Wigderson:
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy. 536-542 - Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset and Optimal Offset for General Single-Layer Channel Routing. 543-554 - Jonathan J. Ashley, Brian H. Marcus:
Canonical Encoders for Sliding Block Decoders. 555-605 - Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. 606-616 - Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Salvage-Embeddings of Complete Trees. 617-637 - Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. 638-651 - Dusan B. Jevtic:
On Families of Sets of Integral Vectors Whose Representatives form Sum-Distinct Sets. 652-660 - Ramesh Krishnamurti, Bhagirath Narahari:
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. 661-669 - Jürgen Bokowski, Peter Schuchert:
Altshuler's Sphere m9963 Revisited. 670-677 - Timothy Law Snyder, J. Michael Steele:
Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem. 678-683
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-01 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
