Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 19
Volume 19, Number 1, 1999
- Rudolf Ahlswede, Levon H. Khachatrian:
A Pushing-Pulling Method: New Proofs of Intersection Theorems. 1-15 - Yefim Dinitz, Naveen Garg
, Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem. 17-41 - György Elekes:
On Linear Combinatorics III. Few Directions and Distorted Lattices. 43-53 - Peter Frankl, Norihide Tokushige:
The Erdos-Ko-Rado Theorem for Integer Sequences. 55-63 - Stasys Jukna:
Combinatorics of Monotone Computations. 65-85 - Kazuo Murota:
Submodular Flow Problem with a Nonseparable Cost Function. 87-109 - János Pach, Joel Spencer:
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. 111-124 - Avi Wigderson, David Zuckerman:
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. 125-138 - Xuding Zhu:
Graphs Whose Circular Chromatic Number Equals the Chromatic Number. 139-149
Volume 19, Number 2, 1999
- Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
Ear Decompositions of Matching Covered Graphs. 151-174 - Alan M. Frieze, Ravi Kannan:
Quick Approximation to Matrices and Applications. 175-220 - David A. Grable:
More-Than-Nearly-Perfect Packings and Partial Designs. 221-239 - Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity Is False. 241-254 - Svante Linusson:
The Number of M-Sequences and f-Vectors. 255-266 - Bruce A. Reed:
Mangoes and Blueberries. 267-296
- Friedrich Eisenbrand:
On the Membership Problem for the Elementary Closure of a Polyhedron. 297-300
Volume 19, Number 3, 1999
- László Babai, Anna Gál, Avi Wigderson:
Superpolynomial Lower Bounds for Monotone Span Programs. 301-319 - Sergei Evdokimov, Ilia N. Ponomarenko:
Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks. 321-333 - Oded Goldreich, Dana Ron:
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. 335-373 - Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa:
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. 375-401 - Ran Raz, Pierre McKenzie:
Separation of the Monotone NC Hierarchy. 403-435 - Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. 437-452
Volume 19, Number 4, 1999
- Noga Alon, Michael Krivelevich, Benny Sudakov:
List Coloring of Random and Pseudo-Random Graphs. 453-472 - Béla Bollobás, Alex D. Scott:
Exact Bounds for Judicious Partitions of Graphs. 473-486 - Tomás Feder, Pavol Hell, Jing Huang:
List Homomorphisms and Circular Arc Graphs. 487-505 - Martin Grohe:
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. 507-532 - Dmitry N. Kozlov:
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex. 533-548 - László Pyber:
A Bound for the Diameter of Distance-Regular Graphs. 549-553 - Jirí Sgall:
Bounds on Pairs of Families with Restricted Intersections. 555-566 - Van H. Vu:
Extremal Set Systems with Weakly Restricted Intersections. 567-587 - Soojin Cho:
On the Support Size of Null Designs of Finite Ranked Posets. 589-595
a service of 
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-04-25 05:28 CEST 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:
