default search action
SIAM Journal on Discrete Mathematics, Volume 5
Volume 5, Number 1, February 1992
- Amotz Bar-Noy, Rajeev Motwani, Joseph Naor:
A Linear Time Approach to the Set Maxima Problem. 1-9 - Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Broadcasting in Bounded Degree Graphs. 10-24 - András Frank
:
Augmenting Graphs to Meet Edge-Connectivity Requirements. 25-53 - Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. 54-66 - D. Dale Olesky, T. A. Slater:
A Forward Lower Restricted Ordering Algorithm for Digraphs. 67-73 - Edward R. Scheinerman:
Generalized Chromatic Numbers of Random Graphs. 74-80 - David Zuckerman:
A Technique for Lower Bounding the Cover Time. 81-87 - László Babai:
Bounded Round Interactive Proofs in Finite Groups. 88-111 - Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. 112-116 - Michael R. Fellows, Michael A. Langston:
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. 117-126 - Robin Pemantle, James Gary Propp, Daniel Ullman:
On Tensor Powers of Integer Programs. 127-143 - David R. Guichard, John W. Krussel:
Pair Labelings of Graphs. 144-149
Volume 5, Number 2, May 1992
- Baruch Awerbuch, David Peleg:
Routing with Polynomial Communication-Space Trade-Off. 151-162 - Endre Boros
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. 163-177 - Luisa Gargano, Ugo Vaccaro:
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. 178-198 - Grzegorz Stachowiak
Hamilton Paths in Graphs of Linear Extensions for Unions of Posets. 199-206 - Huishan Zhou:
On the Nonmultiplicativity of Oriented Cycles. 207-218 - Danièle Gardy:
Normal Limiting Distributions for Projection and Semijoin Sizes. 219-248 - Sampath Kannan, Tandy J. Warnow:
Triangulating 3-Colored Graphs. 249-258 - Richard M. Karp:
Three-Stage Generalized Connectors. 259-272 - Eyal Kushilevitz:
Privacy and Communication Complexity. 273-284 - Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem. 285-304
Volume 5, Number 3, August 1992
- Peter Borm, Guillermo Owen, Stef Tijs:
On the Position Value for Communication Situations. 305-320 - Sunil Chopra:
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems. 321-337 - Krzysztof Diks, Andrzej Pelc:
Almost Safe Gossiping in Bounded Degree Networks. 338-344 - Lajos Rónyai:
Galois Groups and Factoring Polynomials Over Finite Fields. 345-365 - Jørgen Bang-Jensen, Carsten Thomassen:
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. 366-376 - Arthur T. Benjamin, Fritz Juhnke:
Another Way of Counting NN. 377-379 - Donald I. Cartwright, Wolfgang Woess:
Infinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions. 380-385 - Refael Hassin, Moshe Haviv:
Mean Passage Times and Nearly Uncoupled Markov Chains. 386-397 - Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg:
Comparing Queues and Stacks as Mechanisms for Laying out Graphs. 398-412 - Dongsu Kim:
A Combinatorial Approach to Biorthogonal Polynomials. 413-421 - Donald E. Knuth, Arvind Raghunathan:
The Problem of Compatible Representatives. 422-427 - Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston:
Short Encodings of Evolving Structures. 428-450
Volume 5, Number 4, November 1992
- Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone:
Pair-Splitting Sets in AG(m, q). 451-459 - Phillip Botti, Russell Merris, Cheryl Vega:
Laplacian Permanents of Trees. 460-466 - Graham R. Brightwell, Colin Wright:
The 1/3-2/3 Conjecture for 5-Thin Posets. 467-474 - Sunil Chopra:
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs. 475-490 - Genghua Fan:
Covering Graphs by Cycles. 491-496 - Seyoum Getu, Louis W. Shapiro, Wen-Jin Woan, Leon C. Woodson:
How to Guess a Generating Function. 497-499 - Kwang Soo Hong, Joseph Y.-T. Leung:
Some Results on Liu's Conjecture. 500-523 - Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
2-Competition Graphs. 524-538 - Michael S. Jacobson:
On the p-Edge Clique Cover Number of Complete Bipartite Graphs. 539-544 - Bala Kalyanasundaram, Georg Schnitger:
The Probabilistic Communication Complexity of Set Intersection. 545-557 - Maria M. Klawe, Frank Thomson Leighton:
A Tight Lower Bound on the Size of Planar Permutation Networks. 558-563 - Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian Properties of Grid Graphs. 564-570 - Jason I. Brown, Charles J. Colbourn:
Roots of the Reliability Polynomial. 571-585 - Jerrold R. Griggs, Roger K. Yeh:
Labelling Graphs with a Condition at Distance 2. 586-595 - Sampath Kannan, Moni Naor, Steven Rudich:
Implicit Representation of Graphs. 596-603
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 2024-12-26 00:36 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: