Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 16
Volume 16, Number 1, 1996
- Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. 1-18 - James D. Currie:
Non-Repetitive Words: Ages and Essences. 19-40 - Dorit Dor, Uri Zwick:
Finding The alpha n-Th Largest Element. 41-58 - Nancy Eaton, Vojtech Rödl:
Graphs of Small Dimensions. 59-85 - Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel:
Difference Sets and Inverting the Difference Operator. 87-106 - Penny E. Haxell, Yoshiharu Kohayakawa
, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. 107-122 - Chris Jagger, Pavel Stovícek, Andrew Thomason:
Multiplicities of Subgraphs. 123-141
- Jorge L. Ramírez Alfonsín:
Complexity of the Frobenius Problem. 143-147
Volume 16, Number 2, 1996
- Ron Aharoni, Ron Holzman, Michael Krivelevich:
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. 149-174 - Louis J. Billera, Aravamuthan Sarangarajan:
All 0-1 Polytopes are Traveling Salesman Polytopes. 175-188 - Collette R. Coullard, Lisa Hellerstein:
Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. 189-208 - G. S. Gasparian:
Minimal Imperfect Graphs: A Simple Approach. 209-212 - Gyula Károlyi, Gábor Tardos:
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles. 213-222 - Paul D. Seymour:
Packing Circuits in Eulerian Digraphs. 223-231 - Zoltán Szigeti:
On a Matroid Defined by Ear-Decompositions of Graphs. 233-241 - Michel Talagrand:
How Much Are Increasing Sets Positively Correlated? 243-258 - Eberhard Triesch:
On the Recognition Complexity of Some Graph Properties. 259-268 - Pavel Valtr:
Lines, Line-Point Incidences and Crossing Families in Dense Sets. 269-294 - Van H. Vu:
A Strongly Regular N-Full Graph of Small Order. 295-299
Volume 16, Number 3, 1996
- Noga Alon:
Bipartite Subgraphs. 301-311 - Béla Bollobás, Andrew Thomason:
Highly Linked Graphs. 313-320 - Mihai Ciucu:
A Remark on Sets Having the Steinhaus Property. 321-324 - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs. 325-329 - Guoli Ding:
Bounding the Number of Circuits of a Graph. 331-341 - Mark N. Ellingham, Luis A. Goddyn:
List Edge Colourings of Some 1-Factorable Multigraphs. 343-352 - Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. 353-382 - Nabil Kahalé, Leonard J. Schulman:
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. 383-397 - János Kollár, Lajos Rónyai, Tibor Szabó:
Norm-Graphs and Bipartite Turán Numbers. 399-406 - Mekkia Kouider, Zbigniew Lonc:
Covering Cycles and k-Term Degree Sums. 407-412 - Vsevolod F. Lev:
Representing Powers of 2 by a Sum of Four Integers. 413-416 - René Peeters:
Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs. 417-431 - Akira Saito:
Fan-Type Theorem for Path-Connectivity. 433-437 - Eckhard Steffen, Xuding Zhu:
Star Chromatic Numbers of Graphs. 439-448 - Satoru Iwata:
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows. 449
Volume 16, Number 4, 1996
- Xiaotie Deng:
Distributed Near-Optimal Matching. 453-464 - Jeff Kahn, Nathan Linial, Alex Samorodnitsky:
Inclusion-Exclusion: Exact and Approximate. 465-477 - Hal A. Kierstead, Katalin Kolossa:
On-Line Coloring of Perfect Graphs. 479-491 - Maurice Pouzet, Norbert Sauer:
Edge Partitions of the Rado Graph. 505-520 - László Pyber:
Dense Graphs and Edge Reconstruction. 521-525 - László Pyber, Aner Shalev:
Groups with Super-Exponential Subgroup Growth. 527-533 - Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas:
Packing Directed Circuits. 535-554 - Bruce A. Reed, F. Bruce Shepherd:
The Gallai-Younger Conjecture for Planar Graphs. 555-566 - Pavel Valtr:
The Probability that n Random Points in a Triangle Are in Convex Position. 567-573 - Joseph E. Yukich:
Worst Case Asymptotics for Some Classical Optimization Problems. 575-586
- Vsevolod F. Lev:
Representation of Elements of a Sequence by Sumsets. 587-590 - Kazuo Murota:
On Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids. 591-596
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-22 20:58 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:
