External Links

    Journal: Combinatorica

    Volume 15, Issue 4

    455 -- 467H. L. Abbott, D. R. Hare, Bing Zhou. Large Faces in 4-Critical Planar Graphs with Minimum Degree 4
    469 -- 474H. L. Abbott, Bing Zhou. Some Remarks on (::::k::::-1)-Critical Subgraphs of ::::k::::-Critical Graphs
    475 -- 480Rudolf Ahlswede, Péter L. Erdös, Niall Graham. A Splitting Property of Maximal Antichains
    481 -- 487Kris Coolsaet. Local Structure of Graphs with lambda = mu=2, alpha::2:: = 4
    489 -- 497Alan M. Frieze, Bruce A. Reed. Covering the Edges of a Random Graph by Cliques
    499 -- 513Michel X. Goemans, V. S. Ramakrishnan. Minimizing Submodular Functions over Families of Sets
    515 -- 532Satoru Iwata. Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows
    533 -- 539Wolfgang Mader. Existence of Vertices of Local Connectivity ::::k:::: in Digraphs of Large Outdegree
    541 -- 556Bojan Mohar. Uniqueness and Minimality of Large Face-Width Embeddings of Graphs
    557 -- 565Noam Nisan, Avi Wigderson. On Rank vs. Communication Complexity
    567 -- 588Ran Raz, Boris Spieker. On the Log Rank -Conjecture in Communication Complexity
    589 -- 596Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu. Ramsey Families which Exclude a Graph

    Volume 15, Issue 3

    301 -- 309Noga Alon, Moshe Dubiner. A Lattice Point Problem and Additive Number Theory
    311 -- 317K. T. Arasu, James A. Davis, Jonathan Jedwab. A Nonexistence Result for Abelian Menon Difference Sets Using Perfect Binary Arrays
    319 -- 332Jason Cooper, Nathan Linial. Fast Perfect-Information Leader-Election Protocols with Linear Immunity
    333 -- 355Walter A. Deuber, Neil Hindman, Imre Leader, Hanno Lefmann. Infinite Partition Regular Matrices
    357 -- 364Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu. Non-Contractible Edges in A 3-Connected Graph
    365 -- 371Bernhard Herwig. Extending Partial Isomorphisms on Finite Structures
    373 -- 377T. R. Jensen, F. Bruce Shepherd. Note on a Conjecture of Toft
    379 -- 408Hanno Lefmann, Torsten Thiele. Point Sets with Distinct Distances
    409 -- 424Jesús A. De Loera, Bernd Sturmfels, Rekha R. Thomas. Gröner Bases and Triangulations of the Second Hypersimplex
    425 -- 434Serge A. Plotkin, Éva Tardos. Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows
    435 -- 454David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani. A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems

    Volume 15, Issue 2

    151 -- 158Timothy Y. Chow. Penny-Packings with Minimal Second Moments
    159 -- 165Guoli Ding. Bounding the Number of Bases of a Matroid
    167 -- 174György Elekes. Circle Grids and Bipartite Graphs of Distances
    175 -- 185David A. Grable, Kevin T. Phelps, Vojtech Rödl. The Minimum Independence Number for Designs
    187 -- 202Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi. An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications
    204 -- 214Dror Lapidot, Adi Shamir. A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
    215 -- 245Nathan Linial, Eran London, Yuri Rabinovich. The Geometry of Graphs and Some of its Algorithmic Applications
    247 -- 254Xiaoyun Lu. Hamiltonian Cycles in Bipartite Graphs
    255 -- 280Alessandro Panconesi, Aravind Srinivasan. The Local Natur of Delta-Coloring and its Algorithmic Applications
    281 -- 288Paul D. Seymour. Packing Directed Circuits Fractionally
    289 -- 295D. A. Youngs. Minimal Orientations of Colour Critical Graphs
    297 -- 299David Rubinstein. Sensitivity vs. Block Sensitivity of Boolean Functions

    Volume 15, Issue 1

    1 -- 10Charles J. Colbourn, J. Scott Provan, Dirk Vertigan. The Complexity of Computing the Tutte Polynomial on Transversal Matroids
    11 -- 29Persi Diaconis, Michael McGrath, Jim Pitman. Riffle Shuffles, Cycles, and Descents
    31 -- 42Joel Friedman. Some Graphs with Small Second Eigenvalue
    43 -- 65Joel Friedman, Avi Wigderson. On the Second Eigenvalue of Hypergraphs
    67 -- 83Alan M. Frieze, Mark Jerrum. An Analysis of a Monte Carlo Algorithm for Estimating the Permanent
    85 -- 104Hanno Lefmann, Vojtech Rödl. On Erdös-Rado Numbers
    105 -- 110Klaus Metsch. On the Number of Lines in Planar Spaces
    111 -- 122Moshe Morgenstern. Natural Bounded Concentrators
    123 -- 134Gábor Tardos. Transversals of 2-Intervals, a Topological Approach
    135 -- 150Dorothea Wagner, Karsten Weihe. A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs
    runs on