Group divisible designs with block-size four. - Andries E. Brouwer; Alexander Schrijver; Haim Hanani (Discret. Math., 1977)

A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order". - Alexander Schrijver (J. Comb. Theory A, 1977)

The Blocking Number of an Affine Space. - Andries E. Brouwer; Alexander Schrijver (J. Comb. Theory A, 1978)

A Short Proof of Minc's Conjecture. - Alexander Schrijver (J. Comb. Theory A, 1978)

Median graphs and Helly hypergraphs. - Henry Martyn Mulder; Alexander Schrijver (Discret. Math., 1979)

Matroids and linking systems. - Alexander Schrijver (J. Comb. Theory B, 1979)

A comparison of the Delsarte and Lovász bounds. - Alexander Schrijver (IEEE Trans. Inf. Theory, 1979)

A counterexample to a conjecture of Edmonds and Giles. - Alexander Schrijver (Discret. Math., 1980)

The ellipsoid method and its consequences in combinatorial optimization. - Martin Grötschel; László Lovász 001; Alexander Schrijver (Comb., 1981)

Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. - Jacobus H. van Lint; Alexander Schrijver (Comb., 1981)

Min-Max Results in Combinatorial Optimization. - Alexander Schrijver (ISMP, 1982)

On the number of edge-colourings of regular bipartite graphs. - Alexander Schrijver (Discret. Math., 1982)

Bounds on the number of Eulerian orientations. - Alexander Schrijver (Comb., 1983)

Graphs whose neighborhoods have no special cycles. - Andries E. Brouwer; Pierre Duchet; Alexander Schrijver (Discret. Math., 1983)

Packing and covering of crossing families of cuts. - Alexander Schrijver (J. Comb. Theory B, 1983)

Short proofs on the matching polyhedron. - Alexander Schrijver (J. Comb. Theory B, 1983)

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". - Martin Grötschel; László Lovász 001; Alexander Schrijver (Comb., 1984)

Proving total dual integrality with cross-free families - A general framework. - Alexander Schrijver (Math. Program., 1984)

Book reviews. - J. George Shanthikumar; Alfred Luhmer; H. Kremar; Ulrich Faigle; Martin Shubik; Hansjörg Wacker; Alexander Schrijver; Michael M. Richter (Z. Oper. Research, 1985)

Matrices with the Edmonds - Johnson property. - A. M. H. Gerards; Alexander Schrijver (Comb., 1986)

Polyhedral proof methods in combinatorial optimization. - Alexander Schrijver (Discret. Appl. Math., 1986)

An integer analogue of Carathéodory's theorem. - William J. Cook; Jean Fonlupt; Alexander Schrijver (J. Comb. Theory B, 1986)

Relaxations of vertex packing. - Martin Grötschel; László Lovász 001; Alexander Schrijver (J. Comb. Theory B, 1986)

Sensitivity theorems in integer linear programming. - William J. Cook; A. M. H. Gerards; Alexander Schrijver; Éva Tardos (Math. Program., 1986)

Geometric Algorithms and Combinatorial Optimization - Martin Grötschel; László Lovász 001; Alexander Schrijver (Springer, 1988)

The Klein bottle and multicommodity flows. - Alexander Schrijver (Comb., 1989)

On fractional multicommodity flows and distance functions. - Cor A. J. Hurkens; Alexander Schrijver; Éva Tardos (Discret. Math., 1989)

Distances and cuts in planar graphs. - Alexander Schrijver (J. Comb. Theory B, 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. - Cor A. J. Hurkens; Alexander Schrijver (SIAM J. Discret. Math., 1989)

Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. - András Frank; Alexander Schrijver (Polyhedral Combinatorics, 1990)

Matrix Cones, Projection Representations, and Stable Set Polyhedra. - László Lovász 001; Alexander Schrijver (Polyhedral Combinatorics, 1990)

Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces. - Alexander Schrijver (Polyhedral Combinatorics, 1990)

Spanning Trees of Different Weights. - Alexander Schrijver; Paul D. Seymour (Polyhedral Combinatorics, 1990)

Edge-disjoint homotopic paths in a planar graph with one hole. - C. P. M. van Hoesel; Alexander Schrijver (J. Comb. Theory B, 1990)

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. - Clyde L. Monma; Alexander Schrijver; Michael J. Todd; Victor K.-W. Wei (Math. Oper. Res., 1990)

Chvátal Closures for mixed Integer Programming Problems. - William J. Cook; Ravi Kannan; Alexander Schrijver (Math. Program., 1990)

Finding disjoint trees in planar graphs in linear time. - Bruce A. Reed; Neil Robertson 001; Alexander Schrijver; Paul D. Seymour (Graph Structure Theory, 1991)

Induced circuits in graphs on surfaces. - Alexander Schrijver (Graph Structure Theory, 1991)

Disjoint Homotopic Paths and Trees in a Planar Graph. - Alexander Schrijver (Discret. Comput. Geom., 1991)

Short proofs on multicommodity flows and cuts. - Alexander Schrijver (J. Comb. Theory B, 1991)

Disjoint circuits of prescribed homotopies in a graph on a compact surface. - Alexander Schrijver (J. Comb. Theory B, 1991)

Decomposition of graphs on surfaces and a homotopic circulation theorem. - Alexander Schrijver (J. Comb. Theory B, 1991)

A simpler proof and a generalization of the zero-trees theorem. - Alexander Schrijver; Paul D. Seymour (J. Comb. Theory A, 1991)

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs. - Alexander Schrijver (SIAM J. Discret. Math., 1991)

Cones of Matrices and Set-Functions and 0-1 Optimization. - László Lovász 001; Alexander Schrijver (SIAM J. Optim., 1991)

Non-Interfering Network Flows. - Colin McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (SWAT, 1992)

Directed triangles in directed graphs. - Maurits de Graaf; Alexander Schrijver; Paul D. Seymour (Discret. Math., 1992)

Circuits in graphs embedded on the torus. - Alexander Schrijver (Discret. Math., 1992)

Edge-disjoint circuits in graphs on the torus. - András Frank; Alexander Schrijver (J. Comb. Theory B, 1992)

On the uniqueness of kernels. - Alexander Schrijver (J. Comb. Theory B, 1992)

Disjoint Paths in a Planar Graph - A General Theorem. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (SIAM J. Discret. Math., 1992)

Complexity of Disjoint Paths Problems in Planar Graphs. - Alexander Schrijver (ESA, 1993)

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (J. Comb. Theory B, 1993)

Tait's Flyping Conjecture for Well-Connected Links. - Alexander Schrijver (J. Comb. Theory B, 1993)

Graphs on the Torus and Geometry of Numbers. - Alexander Schrijver (J. Comb. Theory B, 1993)

Note on hypergraphs and sphere orders. - Alexander Schrijver (J. Graph Theory, 1993)

Grid Minors of Graphs on the Torus. - Maurits de Graaf; Alexander Schrijver (J. Comb. Theory B, 1994)

Induced Circuits in Planar Graphs. - Colin J. H. McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (J. Comb. Theory B, 1994)

Classification of Minimal Graphs of Given Face-Width on the Torus. - Alexander Schrijver (J. Comb. Theory B, 1994)

Packing Odd Paths. - Alexander Schrijver; Paul D. Seymour (J. Comb. Theory B, 1994)

Finding k Disjoint Paths in a Directed Planar Graph. - Alexander Schrijver (SIAM J. Comput., 1994)

On a Minor-Monotone Graph Invariant. - Hein Vanderholst; Monique Laurent; Alexander Schrijver (J. Comb. Theory B, 1995)

A minor-monotone graph parameter based on oriented matroids. - Jack Edmonds 001; Monique Laurent; Alexander Schrijver (Discret. Math., 1997)

Making Curves Minimally Crossing by Reidemeister Moves. - Maurits de Graaf; Alexander Schrijver (J. Comb. Theory B, 1997)

Decomposition of Graphs on Surfaces. - Maurits de Graaf; Alexander Schrijver (J. Comb. Theory B, 1997)

On Packing Connectors. - Judith Keijsper; Alexander Schrijver (J. Comb. Theory B, 1998)

Counting 1-Factors in Regular Bipartite Graphs. - Alexander Schrijver (J. Comb. Theory B, 1998)

Bipartite Edge Coloring in O(Delta m) Time. - Alexander Schrijver (SIAM J. Comput., 1998)

Theory of linear and integer programming. - Alexander Schrijver (Wiley, 1999)

The Compact Dynamic Bus Station. - Sebastiaan van Vlijmen; Steven Klusener; Alexander Schrijver (Algebraic Specification in Action, 1999)

The Ring Loading Problem. - Alexander Schrijver; Paul D. Seymour; Peter Winkler 001 (SIAM Rev., 1999)

Total Dual Integrality of Matching Forest Constraints. - Alexander Schrijver (Comb., 2000)

Equilateral Dimension of the Rectilinear Space. - Jack H. Koolen; Monique Laurent; Alexander Schrijver (Des. Codes Cryptogr., 2000)

Adjacency, Inseparability, and Base Orderability in Matroids. - Judith Keijsper; Rudi Pendavingh; Alexander Schrijver (Eur. J. Comb., 2000)

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. - Alexander Schrijver (J. Comb. Theory B, 2000)

A Short Proof of Mader's sigma-Paths Theorem. - Alexander Schrijver (J. Comb. Theory B, 2001)

A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs. - Alexander Schrijver (J. Comb. Theory B, 2002)

On the history of the transportation and maximum flow problems. - Alexander Schrijver (Math. Program., 2002)

Strong T-Perfection of Bad-K4-Free Graphs. - Alexander Schrijver (SIAM J. Discret. Math., 2002)

Matching, Edge-Colouring, and Dimers. - Alexander Schrijver (WG, 2003)

Blocking nonorientability of a surface. - Bojan Mohar; Alexander Schrijver (J. Comb. Theory B, 2003)

Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index". - A. M. H. Gerards; Gábor Maróti; Alexander Schrijver (Math. Oper. Res., 2003)

On the b-Stable Set Polytope of Graphs without Bad K4. - Dion Gijswijt; Alexander Schrijver (SIAM J. Discret. Math., 2003)

A Convex Quadratic Characterization of the Lovász Theta Number. - Carlos J. Luz; Alexander Schrijver (SIAM J. Discret. Math., 2005)

New code upper bounds from the Terwilliger algebra and semidefinite programming. - Alexander Schrijver (IEEE Trans. Inf. Theory, 2005)

New Code Bounds with Algebra and Semidefinite Programming. - Alexander Schrijver (ACiD, 2006)

New Limits on Fault-Tolerant Quantum Computation. - Harry Buhrman; Richard Cleve; Monique Laurent; Noah Linden; Alexander Schrijver; Falk Unger (FOCS, 2006)

Solution of two fractional packing problems of Lovász. - Alexander Schrijver; Paul D. Seymour (Discret. Math., 2006)

A rolling stock circulation model for combining and splitting of passenger trains. - Pieter-Jan Fioole; Leo G. Kroon; Gábor Maróti; Alexander Schrijver (Eur. J. Oper. Res., 2006)

New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. - Dion Gijswijt; Alexander Schrijver; Hajime Tanaka 001 (J. Comb. Theory A, 2006)

Efficient Circulation of Railway Rolling Stock. - Arianna Alfieri; Rutger Groot; Leo G. Kroon; Alexander Schrijver (Transp. Sci., 2006)

Reduction of symmetric semidefinite programs using the regular *-representation. - Etienne de Klerk; Dmitrii V. Pasechnik; Alexander Schrijver (Math. Program., 2007)

Graph parameters and semigroup functions. - László Lovász 001; Alexander Schrijver (Eur. J. Comb., 2008)

Shunting of Passenger Train Units: An Integrated Approach. - Leo G. Kroon; Ramon M. Lentink; Alexander Schrijver (Transp. Sci., 2008)

Semidefinite Functions on Categories. - László Lovász 001; Alexander Schrijver (Electron. J. Comb., 2009)

The New Dutch Timetable: The OR Revolution. - Leo G. Kroon; Dennis Huisman; Erwin J. W. Abbink; Pieter-Jan Fioole; Matteo Fischetti; Gábor Maróti; Alexander Schrijver; Adri Steenbeek; Roelof Ybema (Interfaces, 2009)

Graph invariants in the spin model. - Alexander Schrijver (J. Comb. Theory B, 2009)

Dual graph homomorphism functions. - László Lovász 001; Alexander Schrijver (J. Comb. Theory A, 2010)

On Leonid Gurvits's Proof for Permanents. - Monique Laurent; Alexander Schrijver (Am. Math. Mon., 2010)

Preface. - László Lovász 001; Jaroslav Nesetril; Patrice Ossona de Mendez; Alexander Schrijver (Eur. J. Comb., 2011)

Shortest vertex-disjoint two-face paths in planar graphs. - Éric Colin de Verdière; Alexander Schrijver (ACM Trans. Algorithms, 2011)

Semidefinite Code Bounds Based on Quadruple Distances. - Dion Gijswijt; Hans D. Mittelmann; Alexander Schrijver (IEEE Trans. Inf. Theory, 2012)

Analysis of multi-stage open shop processing systems. - Christian Eggermont; Alexander Schrijver; Gerhard J. Woeginger (Math. Program., 2013)

Characterizing partition functions of the edge-coloring model by rank growth. - Alexander Schrijver (J. Comb. Theory A, 2015)

Preface. - László Lovász 001; Jaroslav Nesetril; Alexander Schrijver (Eur. J. Comb., 2016)

Compact orbit spaces in Hilbert spaces and limits of edge-colouring models. - Guus Regts; Alexander Schrijver (Eur. J. Comb., 2016)

On partition functions for 3-graphs. - Guus Regts; Alexander Schrijver; Bart Sevenster (J. Comb. Theory B, 2016)

Semidefinite bounds for nonbinary codes based on quadruples. - Bart Litjens; Sven C. Polak; Alexander Schrijver (Des. Codes Cryptogr., 2017)

New lower bound on the Shannon capacity of C7 from circular graphs. - Sven C. Polak; Alexander Schrijver (CoRR, 2018)

New lower bound on the Shannon capacity of C7 from circular graphs. - Sven C. Polak; Alexander Schrijver (Inf. Process. Lett., 2019)