Alexander Schrijver

Inf. Process. Lett., 2019

2018

New lower bound on the Shannon capacity of C7 from circular graphs.

[BibT_eX]

[DOI]

Sven C. Polak

CoRR, 2018

2017

Semidefinite bounds for nonbinary codes based on quadruples.

[BibT_eX]

[DOI]

Bart Litjens

Sven C. Polak

Des. Codes Cryptogr., 2017

2016

On partition functions for 3-graphs.

[BibT_eX]

[DOI]

Guus Regts

Bart Sevenster

J. Comb. Theory B, 2016

Compact orbit spaces in Hilbert spaces and limits of edge-colouring models.

[BibT_eX]

[DOI]

Guus Regts

Eur. J. Comb., 2016

Preface.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2016

2015

Characterizing partition functions of the edge-coloring model by rank growth.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

2012

Semidefinite Code Bounds Based on Quadruple Distances.

[BibT_eX]

[DOI]

Dion Gijswijt

Hans D. Mittelmann

IEEE Trans. Inf. Theory, 2012

2011

Preface.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Patrice Ossona de Mendez

Eur. J. Comb., 2011

Analysis of multi-stage open shop processing systems.

[BibT_eX]

[DOI]

Christian Eggermont

Gerhard J. Woeginger

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

On Leonid Gurvits's Proof for Permanents.

[BibT_eX]

[DOI]

Am. Math. Mon., 2010

Dual graph homomorphism functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2010

2009

Graph invariants in the spin model.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

The New Dutch Timetable: The OR Revolution.

[BibT_eX]

[DOI]

Interfaces, 2009

Semidefinite Functions on Categories.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Shunting of Passenger Train Units: An Integrated Approach.

[BibT_eX]

[DOI]

Leo G. Kroon

Ramon M. Lentink

Transp. Sci., 2008

Graph parameters and semigroup functions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs.

[BibT_eX]

[DOI]

Éric Colin de Verdière

Proceedings of the STACS 2008, 2008

2007

Reduction of symmetric semidefinite programs using the regular *-representation.

[BibT_eX]

[DOI]

Etienne de Klerk

Dmitrii V. Pasechnik

Math. Program., 2007

2006

Efficient Circulation of Railway Rolling Stock.

[BibT_eX]

[DOI]

Transp. Sci., 2006

New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.

[BibT_eX]

[DOI]

Dion Gijswijt

Hajime Tanaka

J. Comb. Theory A, 2006

A rolling stock circulation model for combining and splitting of passenger trains.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Group divisible designs with block-size four.

[BibT_eX]

[DOI]

Andries E. Brouwer

Haim Hanani

Discret. Math., 2006

New Limits on Fault-Tolerant Quantum Computation.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

New Code Bounds with Algebra and Semidefinite Programming.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

New code upper bounds from the Terwilliger algebra and semidefinite programming.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

A Convex Quadratic Characterization of the Lovász Theta Number.

[BibT_eX]

[DOI]

Carlos J. Luz

SIAM J. Discret. Math., 2005

2003

On the b-Stable Set Polytope of Graphs without Bad K4.

[BibT_eX]

[DOI]

Dion Gijswijt

SIAM J. Discret. Math., 2003

Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index".

[BibT_eX]

[DOI]

A. M. H. Gerards

Gábor Maróti

Math. Oper. Res., 2003

Blocking nonorientability of a surface.

[BibT_eX]

[DOI]

Bojan Mohar

J. Comb. Theory B, 2003

Matching, Edge-Colouring, and Dimers.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

Strong T-Perfection of Bad-K4-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

On the history of the transportation and maximum flow problems.

[BibT_eX]

[DOI]

Math. Program., 2002

A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

2001

A Short Proof of Mader's sigma-Paths Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

2000

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Adjacency, Inseparability, and Base Orderability in Matroids.

[BibT_eX]

[DOI]

Judith Keijsper

Rudi Pendavingh

Eur. J. Comb., 2000

Equilateral Dimension of the Rectilinear Space.

[BibT_eX]

Jack H. Koolen

Des. Codes Cryptogr., 2000

Total Dual Integrality of Matching Forest Constraints.

[BibT_eX]

[DOI]

Comb., 2000

1999

The Compact Dynamic Bus Station.

[BibT_eX]

[DOI]

Sebastiaan van Vlijmen

Steven Klusener

Proceedings of the Algebraic Specification in Action, 1999

Theory of linear and integer programming.

[BibT_eX]

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-98232-6, 1999

1998

The Ring Loading Problem.

[BibT_eX]

[DOI]

Peter Winkler

SIAM J. Discret. Math., 1998

Bipartite Edge Coloring in O(Delta m) Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Counting 1-Factors in Regular Bipartite Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

On Packing Connectors.

[BibT_eX]

[DOI]

Judith Keijsper

J. Comb. Theory B, 1998

1997

Decomposition of Graphs on Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Making Curves Minimally Crossing by Reidemeister Moves.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

A minor-monotone graph parameter based on oriented matroids.

[BibT_eX]

[DOI]

Jack Edmonds

Discret. Math., 1997

1995

On a Minor-Monotone Graph Invariant.

[BibT_eX]

[DOI]

Hein Vanderholst

J. Comb. Theory B, 1995

1994

Finding k Disjoint Paths in a Directed Planar Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Packing Odd Paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Classification of Minimal Graphs of Given Face-Width on the Torus.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Induced Circuits in Planar Graphs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

Bruce A. Reed

F. Bruce Shepherd

J. Comb. Theory B, 1994

Grid Minors of Graphs on the Torus.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

1993

Note on hypergraphs and sphere orders.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Graphs on the Torus and Geometry of Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Tait's Flyping Conjecture for Well-Connected Links.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.

[BibT_eX]

[DOI]

Guoli Ding

J. Comb. Theory B, 1993

Complexity of Disjoint Paths Problems in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Disjoint Paths in a Planar Graph - A General Theorem.

[BibT_eX]

[DOI]

Guoli Ding

SIAM J. Discret. Math., 1992

On the uniqueness of kernels.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Edge-disjoint circuits in graphs on the torus.

[BibT_eX]

[DOI]

András Frank

J. Comb. Theory B, 1992

Circuits in graphs embedded on the torus.

[BibT_eX]

[DOI]

Discret. Math., 1992

Directed triangles in directed graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Non-Interfering Network Flows.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

1991

Cones of Matrices and Set-Functions and 0-1 Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 1991

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

A simpler proof and a generalization of the zero-trees theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Decomposition of graphs on surfaces and a homotopic circulation theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Disjoint circuits of prescribed homotopies in a graph on a compact surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Short proofs on multicommodity flows and cuts.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Disjoint Homotopic Paths and Trees in a Planar Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1991

Induced circuits in graphs on surfaces.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Finding disjoint trees in planar graphs in linear time.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1990

Chvátal Closures for mixed Integer Programming Problems.

[BibT_eX]

[DOI]

William J. Cook

Ravi Kannan

Math. Program., 1990

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.

[BibT_eX]

[DOI]

Math. Oper. Res., 1990

Edge-disjoint homotopic paths in a planar graph with one hole.

[BibT_eX]

[DOI]

C. P. M. van Hoesel

J. Comb. Theory B, 1990

Spanning Trees of Different Weights.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

Matrix Cones, Projection Representations, and Stable Set Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph.

[BibT_eX]

[DOI]

András Frank

Proceedings of the Polyhedral Combinatorics, 1990

1989

On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems.

[BibT_eX]

[DOI]

Cor A. J. Hurkens

SIAM J. Discret. Math., 1989

Distances and cuts in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

On fractional multicommodity flows and distance functions.

[BibT_eX]

[DOI]

Cor A. J. Hurkens

Éva Tardos

Discret. Math., 1989

The Klein bottle and multicommodity flows.

[BibT_eX]

[DOI]

Comb., 1989

1988

Geometric Algorithms and Combinatorial Optimization

[BibT_eX]

[DOI]

Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988

1986

Sensitivity theorems in integer linear programming.

[BibT_eX]

[DOI]

Math. Program., 1986

Relaxations of vertex packing.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

An integer analogue of Carathéodory's theorem.

[BibT_eX]

[DOI]

William J. Cook

Jean Fonlupt

J. Comb. Theory B, 1986

Polyhedral proof methods in combinatorial optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Matrices with the Edmonds - Johnson property.

[BibT_eX]

[DOI]

A. M. H. Gerards

Comb., 1986

1985

Book reviews.

[BibT_eX]

[DOI]

J. George Shanthikumar

Z. Oper. Research, 1985

1984

Proving total dual integrality with cross-free families - A general framework.

[BibT_eX]

[DOI]

Math. Program., 1984

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".

[BibT_eX]

[DOI]

Comb., 1984

1983

Short proofs on the matching polyhedron.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Packing and covering of crossing families of cuts.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Graphs whose neighborhoods have no special cycles.

[BibT_eX]

[DOI]

Andries E. Brouwer

Pierre Duchet

Discret. Math., 1983

Bounds on the number of Eulerian orientations.

[BibT_eX]

[DOI]

Comb., 1983

1982

On the number of edge-colourings of regular bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1982

Min-Max Results in Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields.

[BibT_eX]

[DOI]

Jacobus H. van Lint

Comb., 1981

The ellipsoid method and its consequences in combinatorial optimization.

[BibT_eX]

[DOI]

Comb., 1981

1980

A counterexample to a conjecture of Edmonds and Giles.

[BibT_eX]

[DOI]

Discret. Math., 1980

1979

A comparison of the Delsarte and Lovász bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1979

Matroids and linking systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

Solution of two fractional packing problems of lovász.

[BibT_eX]

[DOI]

Discret. Math., 1979

Median graphs and Helly hypergraphs.

[BibT_eX]

[DOI]

Henry Martyn Mulder

Discret. Math., 1979

1978

A Short Proof of Minc's Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

The Blocking Number of an Affine Space.

[BibT_eX]

[DOI]

Andries E. Brouwer

J. Comb. Theory A, 1978

1977

A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order".

[BibT_eX]

[DOI]