Volume 22,
Number 1,
2002
- Alon Amit, Nathan Linial:
Random Graph Coverings I: General Theory and Graph Connectivity.
1-18
Electronic Edition (Springer LINK) BibTeX
- Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets.
19-33
Electronic Edition (Springer LINK) BibTeX
- Christian Delhommé, Norbert Sauer:
Homomorphisms of Products of Graphs into Graphs Without Four Cycles.
35-46
Electronic Edition (Springer LINK) BibTeX
- András Frank, Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints.
47-70
Electronic Edition (Springer LINK) BibTeX
- Mekkia Kouider, Maryvonne Mahéo:
Connected [a, b]-factors in Graphs.
71-82
Electronic Edition (Springer LINK) BibTeX
- Erez Petrank, Gábor Tardos:
On the Knowledge Complexity of NP.
83-121
Electronic Edition (Springer LINK) BibTeX
- Amnon Ta-Shma:
Almost Optimal Dispersers.
123-145
Electronic Edition (Springer LINK) BibTeX
- Ya-Chen Chen, Zoltán Füredi:
Hamiltonian Kneser Graphs.
147-149
Electronic Edition (Springer LINK) BibTeX
Volume 22,
Number 2,
2002
Volume 22,
Number 3,
2002
- Ron Aharoni, Eli Berger, Ran Ziv:
A Tree Version of Konig's Theorem.
335-343
Electronic Edition (Springer LINK) BibTeX
- Michael R. Capalbo:
Small Universal Graphs for Bounded-Degree Planar Graphs.
345-359
Electronic Edition (Springer LINK) BibTeX
- Uriel Feige, Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling.
361-399
Electronic Edition (Springer LINK) BibTeX
- Martin Henk, Robert Weismantel:
Diophantine Approximations and Integer Points of Cones.
401-408
Electronic Edition (Springer LINK) BibTeX
- Andreas Huck, Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.
409-416
Electronic Edition (Springer LINK) BibTeX
- Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles.
417-434
Electronic Edition (Springer LINK) BibTeX
- Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic:
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z.
435-443
Electronic Edition (Springer LINK) BibTeX
- Juan José Montellano-Ballesteros, Victor Neumann-Lara:
An Anti-Ramsey Theorem.
445-449
Electronic Edition (Springer LINK) BibTeX
- Frantisek Franek:
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.
451-454
Electronic Edition (Springer LINK) BibTeX
- Anna Galluccio, Luis A. Goddyn:
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.
455-459
Electronic Edition (Springer LINK) BibTeX
Volume 22,
Number 4,
October 2002
- Uriel Feige, Oleg Verbitsky:
Error Reduction by Parallel Repetition - A Negative Result.
461-478
Electronic Edition (link) BibTeX
- András Gyárfás:
Transitive Edge Coloring of Graphs and Dimension of Lattices.
479-496
Electronic Edition (link) BibTeX
- Nathan Linial, Alex Samorodnitsky:
Linear Codes and Character Sums.
497-522
Electronic Edition (link) BibTeX
- J. H. Boutet de Monvel, O. C. Martin:
Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space.
523-530
Electronic Edition (link) BibTeX
- Jean François Maurras:
From Membership to Separation, a Simple Construction.
531-536
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1.
537-554
Electronic Edition (link) BibTeX
- Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.
555-574
Electronic Edition (link) BibTeX
- Zoltán Szigeti:
Perfect Matchings Versus Odd Cuts.
575-589
Electronic Edition (link) BibTeX
- Carsten Thomassen:
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree.
591-596
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:53:12 2009
by Michael Ley (ley@uni-trier.de)
