 | 2009 |
|---|
| 80 |       | Alexander Schrijver:
Graph invariants in the spin model.
J. Comb. Theory, Ser. B 99(2): 502-511 (2009) |
| 2008 |
|---|
| 79 | | Éric Colin de Verdière,
Alexander Schrijver:
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs.
STACS 2008: 181-192 |
| 78 | | Éric Colin de Verdière,
Alexander Schrijver:
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
CoRR abs/0802.2845: (2008) |
| 77 | | László Lovász,
Alexander Schrijver:
Graph parameters and semigroup functions.
Eur. J. Comb. 29(4): 987-1002 (2008) |
| 76 | | Leo G. Kroon,
Ramon M. Lentink,
Alexander Schrijver:
Shunting of Passenger Train Units: An Integrated Approach.
Transportation Science 42(4): 436-449 (2008) |
| 2007 |
|---|
| 75 | | Etienne de Klerk,
Dmitrii V. Pasechnik,
Alexander Schrijver:
Reduction of symmetric semidefinite programs using the regular *-representation.
Math. Program. 109(2-3): 613-624 (2007) |
| 2006 |
|---|
| 74 |  | Alexander Schrijver:
New Code Bounds with Algebra and Semidefinite Programming.
ACiD 2006: 5 |
| 73 | | Harry Buhrman,
Richard Cleve,
Monique Laurent,
Noah Linden,
Alexander Schrijver,
Falk Unger:
New Limits on Fault-Tolerant Quantum Computation.
FOCS 2006: 411-419 |
| 72 | | Andries E. Brouwer,
Alexander Schrijver,
Haim Hanani:
Group divisible designs with block-size four.
Discrete Mathematics 306(10-11): 939-947 (2006) |
| 71 | | Alexander Schrijver,
Paul D. Seymour:
Solution of two fractional packing problems of Lovász.
Discrete Mathematics 306(10-11): 973-978 (2006) |
| 70 | | Pieter-Jan Fioole,
Leo G. Kroon,
Gábor Maróti,
Alexander Schrijver:
A rolling stock circulation model for combining and splitting of passenger trains.
European Journal of Operational Research 174(2): 1281-1297 (2006) |
| 69 | | Dion Gijswijt,
Alexander Schrijver,
Hajime Tanaka:
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.
J. Comb. Theory, Ser. A 113(8): 1719-1731 (2006) |
| 68 | | Arianna Alfieri,
Rutger Groot,
Leo G. Kroon,
Alexander Schrijver:
Efficient Circulation of Railway Rolling Stock.
Transportation Science 40(3): 378-391 (2006) |
| 2005 |
|---|
| 67 | | Alexander Schrijver:
New code upper bounds from the Terwilliger algebra and semidefinite programming.
IEEE Transactions on Information Theory 51(8): 2859-2866 (2005) |
| 66 | | Carlos J. Luz,
Alexander Schrijver:
A Convex Quadratic Characterization of the Lovász Theta Number.
SIAM J. Discrete Math. 19(2): 382-387 (2005) |
| 2003 |
|---|
| 65 | | Alexander Schrijver:
Matching, Edge-Colouring, and Dimers.
WG 2003: 13-22 |
| 64 | | Bojan Mohar,
Alexander Schrijver:
Blocking nonorientability of a surface.
J. Comb. Theory, Ser. B 87(1): 2-16 (2003) |
| 63 | | A. M. H. Gerards,
Gábor Maróti,
Alexander Schrijver:
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index".
Math. Oper. Res. 28(4): 884-885 (2003) |
| 62 | | Dion Gijswijt,
Alexander Schrijver:
On the b-Stable Set Polytope of Graphs without Bad K4.
SIAM J. Discrete Math. 16(3): 511-516 (2003) |
| 2002 |
|---|
| 61 | | Alexander Schrijver:
A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs.
J. Comb. Theory, Ser. B 85(2): 255-260 (2002) |
| 60 | | Alexander Schrijver:
Strong T-Perfection of Bad-K4-Free Graphs.
SIAM J. Discrete Math. 15(3): 403-415 (2002) |
| 2001 |
|---|
| 59 | | Alexander Schrijver:
A Short Proof of Mader's sigma-Paths Theorem.
J. Comb. Theory, Ser. B 82(2): 319-321 (2001) |
| 2000 |
|---|
| 58 | | Alexander Schrijver:
Total Dual Integrality of Matching Forest Constraints.
Combinatorica 20(4): 575-588 (2000) |
| 57 | | Jack H. Koolen,
Monique Laurent,
Alexander Schrijver:
Equilateral Dimension of the Rectilinear Space.
Des. Codes Cryptography 21(1/3): 149-164 (2000) |
| 56 | | Judith Keijsper,
Rudi Pendavingh,
Alexander Schrijver:
Adjacency, Inseparability, and Base Orderability in Matroids.
Eur. J. Comb. 21(4): 487-502 (2000) |
| 55 | | Alexander Schrijver:
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time.
J. Comb. Theory, Ser. B 80(2): 346-355 (2000) |
| 1999 |
|---|
| 54 | | Sebastiaan van Vlijmen,
Steven Klusener,
Alexander Schrijver:
The Compact Dynamic Bus Station.
Electr. Notes Theor. Comput. Sci. 21: (1999) |
| 1998 |
|---|
| 53 | | Alexander Schrijver:
Counting 1-Factors in Regular Bipartite Graphs.
J. Comb. Theory, Ser. B 72(1): 122-135 (1998) |
| 52 | | Judith Keijsper,
Alexander Schrijver:
On Packing Connectors.
J. Comb. Theory, Ser. B 73(2): 184-188 (1998) |
| 51 | | Alexander Schrijver:
Bipartite Edge Coloring in O(Delta m) Time.
SIAM J. Comput. 28(3): 841-846 (1998) |
| 50 | | Alexander Schrijver,
Paul D. Seymour,
Peter Winkler:
The Ring Loading Problem.
SIAM J. Discrete Math. 11(1): 1-14 (1998) |
| 1997 |
|---|
| 49 | | Jack Edmonds,
Monique Laurent,
Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids.
Discrete Mathematics 165-166: 219-226 (1997) |
| 48 | | Maurits de Graaf,
Alexander Schrijver:
Making Curves Minimally Crossing by Reidemeister Moves.
J. Comb. Theory, Ser. B 70(1): 134-156 (1997) |
| 47 | | Maurits de Graaf,
Alexander Schrijver:
Decomposition of Graphs on Surfaces.
J. Comb. Theory, Ser. B 70(1): 157-165 (1997) |
| 1995 |
|---|
| 46 | | Hein Vanderholst,
Monique Laurent,
Alexander Schrijver:
On a Minor-Monotone Graph Invariant.
J. Comb. Theory, Ser. B 65(2): 291-304 (1995) |
| 1994 |
|---|
| 45 | | Colin J. H. McDiarmid,
Bruce A. Reed,
Alexander Schrijver,
F. Bruce Shepherd:
Induced Circuits in Planar Graphs.
J. Comb. Theory, Ser. B 60(2): 169-176 (1994) |
| 44 | | Maurits de Graaf,
Alexander Schrijver:
Grid Minors of Graphs on the Torus.
J. Comb. Theory, Ser. B 61(1): 57-62 (1994) |
| 43 | | Alexander Schrijver:
Classification of Minimal Graphs of Given Face-Width on the Torus.
J. Comb. Theory, Ser. B 61(2): 217-236 (1994) |
| 42 | | Alexander Schrijver,
Paul D. Seymour:
Packing Odd Paths.
J. Comb. Theory, Ser. B 62(2): 280-288 (1994) |
| 41 | | Alexander Schrijver:
Finding k Disjoint Paths in a Directed Planar Graph.
SIAM J. Comput. 23(4): 780-788 (1994) |
| 1993 |
|---|
| 40 | | Alexander Schrijver:
Complexity of Disjoint Paths Problems in Planar Graphs.
ESA 1993: 357-359 |
| 39 | | Alexander Schrijver:
Graphs on the Torus and Geometry of Numbers.
J. Comb. Theory, Ser. B 58(1): 147-158 (1993) |
| 38 | | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory, Ser. B 58(1): 40-45 (1993) |
| 37 | | Alexander Schrijver:
Tait's Flyping Conjecture for Well-Connected Links.
J. Comb. Theory, Ser. B 58(1): 65-146 (1993) |
| 1992 |
|---|
| 36 | | Colin McDiarmid,
Bruce A. Reed,
Alexander Schrijver,
B. Shepherd:
Non-Interfering Network Flows.
SWAT 1992: 245-257 |
| 35 | | Alexander Schrijver:
Circuits in graphs embedded on the torus.
Discrete Mathematics 106-107: 415-433 (1992) |
| 34 | | Maurits de Graaf,
Alexander Schrijver,
Paul D. Seymour:
Directed triangles in directed graphs.
Discrete Mathematics 110(1-3): 279-282 (1992) |
| 33 | | Alexander Schrijver:
On the uniqueness of kernels.
J. Comb. Theory, Ser. B 55(1): 146-160 (1992) |
| 32 | | Amdrás Frank,
Alexander Schrijver:
Edge-disjoint circuits in graphs on the torus.
J. Comb. Theory, Ser. B 55(1): 9-17 (1992) |
| 31 | | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discrete Math. 5(1): 112-116 (1992) |
| 1991 |
|---|
| 30 | | Alexander Schrijver:
Induced circuits in graphs on surfaces.
Graph Structure Theory 1991: 183-194 |
| 29 | | Bruce A. Reed,
Neil Robertson,
Alexander Schrijver,
Paul D. Seymour:
Finding dsjoint trees in planar graphs in linear time.
Graph Structure Theory 1991: 295-302 |
| 28 | | Alexander Schrijver:
Disjoint Homotopic Paths and Trees in a Planar Graph.
Discrete & Computational Geometry 6: 527-574 (1991) |
| 27 | | Alexander Schrijver,
Paul D. Seymour:
A simpler proof and a generalization of the zero-trees theorem.
J. Comb. Theory, Ser. A 58(2): 301-305 (1991) |
| 26 | | Alexander Schrijver:
Disjoint circuits of prescribed homotopies in a graph on a compact surface.
J. Comb. Theory, Ser. B 51(1): 127-159 (1991) |
| 25 | | Alexander Schrijver:
Decomposition of graphs on surfaces and a homotopic circulation theorem.
J. Comb. Theory, Ser. B 51(2): 161-210 (1991) |
| 24 | | Alexander Schrijver:
Short proofs on multicommodity flows and cuts.
J. Comb. Theory, Ser. B 53(1): 32-39 (1991) |
| 23 | | Alexander Schrijver:
Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs.
SIAM J. Discrete Math. 4(1): 130-138 (1991) |
| 1990 |
|---|
| 22 | | C. P. M. van Hoesel,
Alexander Schrijver:
Edge-disjoint homotopic paths in a planar graph with one hole.
J. Comb. Theory, Ser. B 48(1): 77-91 (1990) |
| 21 | | William J. Cook,
Ravi Kannan,
Alexander Schrijver:
Chvátal Closures for mixed Integer Programming Problems.
Math. Program. 47: 155-174 (1990) |
| 1989 |
|---|
| 20 | | Alexander Schrijver:
The Klein bottle and multicommodity flows.
Combinatorica 9(4): 375-384 (1989) |
| 19 | | Cor A. J. Hurkens,
Alexander Schrijver,
Éva Tardos:
On fractional multicommodity flows and distance functions.
Discrete Mathematics 73(1-2): 99-109 (1989) |
| 18 | | Alexander Schrijver:
Distances and cuts in planar graphs.
J. Comb. Theory, Ser. B 46(1): 46-57 (1989) |
| 17 | | Cor A. J. Hurkens,
Alexander Schrijver:
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.
SIAM J. Discrete Math. 2(1): 68-72 (1989) |
| 1986 |
|---|
| 16 | | A. M. H. Gerards,
Alexander Schrijver:
Matrices with the Edmonds - Johnson property.
Combinatorica 6(4): 365-379 (1986) |
| 15 | | William J. Cook,
Jean Fonlupt,
Alexander Schrijver:
An integer analogue of Carathéodory's theorem.
J. Comb. Theory, Ser. B 40(1): 63-70 (1986) |
| 14 | | Martin Grötschel,
László Lovász,
Alexander Schrijver:
Relaxations of vertex packing.
J. Comb. Theory, Ser. B 40(3): 330-343 (1986) |
| 1984 |
|---|
| 13 | | Martin Grötschel,
László Lovász,
Alexander Schrijver:
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Combinatorica 4(4): 291-295 (1984) |
| 1983 |
|---|
| 12 | | Alexander Schrijver:
Bounds on the number of Eulerian orientations.
Combinatorica 3(3): 375-380 (1983) |
| 11 | | Andries E. Brouwer,
Pierre Duchet,
Alexander Schrijver:
Graphs whose neighborhoods have no special cycles.
Discrete Mathematics 47: 177-182 (1983) |
| 10 | | Alexander Schrijver:
Short proofs on the matching polyhedron.
J. Comb. Theory, Ser. B 34(1): 104-108 (1983) |
| 9 | | Alexander Schrijver:
Packing and covering of crossing families of cuts.
J. Comb. Theory, Ser. B 35(2): 104-128 (1983) |
| 1982 |
|---|
| 8 | | Alexander Schrijver:
On the number of edge-colourings of regular bipartite graphs.
Discrete Mathematics 38(2-3): 297-301 (1982) |
| 1981 |
|---|
| 7 | | Jacobus H. van Lint,
Alexander Schrijver:
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields.
Combinatorica 1(1): 63-73 (1981) |
| 6 | | Martin Grötschel,
László Lovász,
Alexander Schrijver:
The ellipsoid method and its consequences in combinatorial optimization.
Combinatorica 1(2): 169-197 (1981) |
| 1980 |
|---|
| 5 | | Alexander Schrijver:
A counterexample to a conjecture of Edmonds and Giles.
Discrete Mathematics 32(2): 213-214 (1980) |
| 1979 |
|---|
| 4 | | Alexander Schrijver:
Matroids and linking systems.
J. Comb. Theory, Ser. B 26(3): 349-369 (1979) |
| 1978 |
|---|
| 3 | | Andries E. Brouwer,
Alexander Schrijver:
The Blocking Number of an Affine Space.
J. Comb. Theory, Ser. A 24(2): 251-253 (1978) |
| 2 | | Alexander Schrijver:
A Short Proof of Minc's Conjecture.
J. Comb. Theory, Ser. A 25(1): 80-83 (1978) |
| 1977 |
|---|
| 1 | | Alexander Schrijver:
A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order".
J. Comb. Theory, Ser. A 23(3): 359-362 (1977) |
