Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alexander Schrijver
2010 – today
- 2012
[j79]Dion Gijswijt, Hans D. Mittelmann, Alexander Schrijver: Semidefinite Code Bounds Based on Quadruple Distances. IEEE Transactions on Information Theory 58(5): 2697-2705 (2012)- 2011
[j78]László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver: Preface. Eur. J. Comb. 32(7): 951-953 (2011)
[j77]Éric Colin de Verdière, Alexander Schrijver: Shortest vertex-disjoint two-face paths in planar graphs. ACM Transactions on Algorithms 7(2): 19 (2011)
[c9]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger: Analysis of multi-stage open shop processing systems. STACS 2011: 484-494
[i2]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger: Analysis of multi-stage open shop processing systems. CoRR abs/1102.3029 (2011)- 2010
[j76]László Lovász, Alexander Schrijver: Dual graph homomorphism functions. J. Comb. Theory, Ser. A 117(2): 216-222 (2010)
[j75]Monique Laurent, Alexander Schrijver: On Leonid Gurvits's Proof for Permanents. The American Mathematical Monthly 117(10): 903-911 (2010)
2000 – 2009
- 2009
[j74]László Lovász, Alexander Schrijver: Semidefinite Functions on Categories. Electr. J. Comb. 16(2) (2009)
[j73]Leo G. Kroon, Dennis Huisman, Erwin J. W. Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gábor Maróti, Alexander Schrijver, Adri Steenbeek, Roelof Ybema: The New Dutch Timetable: The OR Revolution. Interfaces 39(1): 6-17 (2009)
[j72]Alexander Schrijver: Graph invariants in the spin model. J. Comb. Theory, Ser. B 99(2): 502-511 (2009)- 2008
[j71]László Lovász, Alexander Schrijver: Graph parameters and semigroup functions. Eur. J. Comb. 29(4): 987-1002 (2008)
[j70]Leo G. Kroon, Ramon M. Lentink, Alexander Schrijver: Shunting of Passenger Train Units: An Integrated Approach. Transportation Science 42(4): 436-449 (2008)
[c8]Éric Colin de Verdière, Alexander Schrijver: Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. STACS 2008: 181-192
[i1]Éric Colin de Verdière, Alexander Schrijver: Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. CoRR abs/0802.2845 (2008)- 2007
[j69]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
[j68]Andries E. Brouwer, Alexander Schrijver, Haim Hanani: Group divisible designs with block-size four. Discrete Mathematics 306(10-11): 939-947 (2006)
[j67]Alexander Schrijver, Paul D. Seymour: Solution of two fractional packing problems of Lovász. Discrete Mathematics 306(10-11): 973-978 (2006)
[j66]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)
[j65]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)
[j64]Arianna Alfieri, Rutger Groot, Leo G. Kroon, Alexander Schrijver: Efficient Circulation of Railway Rolling Stock. Transportation Science 40(3): 378-391 (2006)
[c7]
[c6]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger: New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419- 2005
[j63]Carlos J. Luz, Alexander Schrijver: A Convex Quadratic Characterization of the Lovász Theta Number. SIAM J. Discrete Math. 19(2): 382-387 (2005)
[j62]Alexander Schrijver: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Transactions on Information Theory 51(8): 2859-2866 (2005)- 2003
[j61]Bojan Mohar, Alexander Schrijver: Blocking nonorientability of a surface. J. Comb. Theory, Ser. B 87(1): 2-16 (2003)
[j60]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)
[j59]Dion Gijswijt, Alexander Schrijver: On the b-Stable Set Polytope of Graphs without Bad K4. SIAM J. Discrete Math. 16(3): 511-516 (2003)
[c5]- 2002
[j58]Alexander Schrijver: A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs. J. Comb. Theory, Ser. B 85(2): 255-260 (2002)
[j57]Alexander Schrijver: Strong T-Perfection of Bad-K4-Free Graphs. SIAM J. Discrete Math. 15(3): 403-415 (2002)- 2001
[j56]Alexander Schrijver: A Short Proof of Mader's sigma-Paths Theorem. J. Comb. Theory, Ser. B 82(2): 319-321 (2001)- 2000
[j55]Alexander Schrijver: Total Dual Integrality of Matching Forest Constraints. Combinatorica 20(4): 575-588 (2000)
[j54]Jack H. Koolen, Monique Laurent, Alexander Schrijver: Equilateral Dimension of the Rectilinear Space. Des. Codes Cryptography 21(1/3): 149-164 (2000)
[j53]Judith Keijsper, Rudi Pendavingh, Alexander Schrijver: Adjacency, Inseparability, and Base Orderability in Matroids. Eur. J. Comb. 21(4): 487-502 (2000)
[j52]Alexander Schrijver: A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. J. Comb. Theory, Ser. B 80(2): 346-355 (2000)
1990 – 1999
- 1999
[b1]Alexander Schrijver: Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1999, ISBN 978-0-471-98232-6, pp. I-XI, 1-471
[j51]Sebastiaan van Vlijmen, Steven Klusener, Alexander Schrijver: The Compact Dynamic Bus Station. Electr. Notes Theor. Comput. Sci. 21: 1-20 (1999)- 1998
[j50]Alexander Schrijver: Counting 1-Factors in Regular Bipartite Graphs. J. Comb. Theory, Ser. B 72(1): 122-135 (1998)
[j49]Judith Keijsper, Alexander Schrijver: On Packing Connectors. J. Comb. Theory, Ser. B 73(2): 184-188 (1998)
[j48]Alexander Schrijver: Bipartite Edge Coloring in O(Delta m) Time. SIAM J. Comput. 28(3): 841-846 (1998)
[j47]Alexander Schrijver, Paul D. Seymour, Peter Winkler: The Ring Loading Problem. SIAM J. Discrete Math. 11(1): 1-14 (1998)- 1997
[j46]Jack Edmonds, Monique Laurent, Alexander Schrijver: A minor-monotone graph parameter based on oriented matroids. Discrete Mathematics 165-166: 219-226 (1997)
[j45]Maurits de Graaf, Alexander Schrijver: Making Curves Minimally Crossing by Reidemeister Moves. J. Comb. Theory, Ser. B 70(1): 134-156 (1997)
[j44]Maurits de Graaf, Alexander Schrijver: Decomposition of Graphs on Surfaces. J. Comb. Theory, Ser. B 70(1): 157-165 (1997)- 1995
[j43]Hein Vanderholst, Monique Laurent, Alexander Schrijver: On a Minor-Monotone Graph Invariant. J. Comb. Theory, Ser. B 65(2): 291-304 (1995)- 1994
[j42]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)
[j41]Maurits de Graaf, Alexander Schrijver: Grid Minors of Graphs on the Torus. J. Comb. Theory, Ser. B 61(1): 57-62 (1994)
[j40]Alexander Schrijver: Classification of Minimal Graphs of Given Face-Width on the Torus. J. Comb. Theory, Ser. B 61(2): 217-236 (1994)
[j39]Alexander Schrijver, Paul D. Seymour: Packing Odd Paths. J. Comb. Theory, Ser. B 62(2): 280-288 (1994)
[j38]Alexander Schrijver: Finding k Disjoint Paths in a Directed Planar Graph. SIAM J. Comput. 23(4): 780-788 (1994)- 1993
[j37]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)
[j36]Alexander Schrijver: Tait's Flyping Conjecture for Well-Connected Links. J. Comb. Theory, Ser. B 58(1): 65-146 (1993)
[j35]Alexander Schrijver: Graphs on the Torus and Geometry of Numbers. J. Comb. Theory, Ser. B 58(1): 147-158 (1993)
[j34]Alexander Schrijver: Note on hypergraphs and sphere orders. Journal of Graph Theory 17(2): 173-176 (1993)
[c4]- 1992
[j33]Alexander Schrijver: Circuits in graphs embedded on the torus. Discrete Mathematics 106-107: 415-433 (1992)
[j32]Maurits de Graaf, Alexander Schrijver, Paul D. Seymour: Directed triangles in directed graphs. Discrete Mathematics 110(1-3): 279-282 (1992)
[j31]Amdrás Frank, Alexander Schrijver: Edge-disjoint circuits in graphs on the torus. J. Comb. Theory, Ser. B 55(1): 9-17 (1992)
[j30]
[j29]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)
[c3]Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd: Non-Interfering Network Flows. SWAT 1992: 245-257- 1991
[j28]Alexander Schrijver: Disjoint Homotopic Paths and Trees in a Planar Graph. Discrete & Computational Geometry 6: 527-574 (1991)
[j27]Alexander Schrijver: Disjoint circuits of prescribed homotopies in a graph on a compact surface. J. Comb. Theory, Ser. B 51(1): 127-159 (1991)
[j26]Alexander Schrijver: Decomposition of graphs on surfaces and a homotopic circulation theorem. J. Comb. Theory, Ser. B 51(2): 161-210 (1991)
[j25]Alexander Schrijver: Short proofs on multicommodity flows and cuts. J. Comb. Theory, Ser. B 53(1): 32-39 (1991)
[j24]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)
[j23]Alexander Schrijver: Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs. SIAM J. Discrete Math. 4(1): 130-138 (1991)
[c2]
[c1]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- 1990
[j22]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)
[j21]William J. Cook, Ravi Kannan, Alexander Schrijver: Chvátal Closures for mixed Integer Programming Problems. Math. Program. 47: 155-174 (1990)
1980 – 1989
- 1989
[j20]
[j19]Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos: On fractional multicommodity flows and distance functions. Discrete Mathematics 73(1-2): 99-109 (1989)
[j18]Alexander Schrijver: Distances and cuts in planar graphs. J. Comb. Theory, Ser. B 46(1): 46-57 (1989)
[j17]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
[j16]A. M. H. Gerards, Alexander Schrijver: Matrices with the Edmonds - Johnson property. Combinatorica 6(4): 365-379 (1986)
[j15]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)
[j14]Martin Grötschel, László Lovász, Alexander Schrijver: Relaxations of vertex packing. J. Comb. Theory, Ser. B 40(3): 330-343 (1986)- 1984
[j13]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
[j12]Alexander Schrijver: Bounds on the number of Eulerian orientations. Combinatorica 3(3): 375-380 (1983)
[j11]Andries E. Brouwer, Pierre Duchet, Alexander Schrijver: Graphs whose neighborhoods have no special cycles. Discrete Mathematics 47: 177-182 (1983)
[j10]Alexander Schrijver: Short proofs on the matching polyhedron. J. Comb. Theory, Ser. B 34(1): 104-108 (1983)
[j9]Alexander Schrijver: Packing and covering of crossing families of cuts. J. Comb. Theory, Ser. B 35(2): 104-128 (1983)- 1982
[j8]Alexander Schrijver: On the number of edge-colourings of regular bipartite graphs. Discrete Mathematics 38(2-3): 297-301 (1982)- 1981
[j7]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)
[j6]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
[j5]Alexander Schrijver: A counterexample to a conjecture of Edmonds and Giles. Discrete Mathematics 32(2): 213-214 (1980)
1970 – 1979
- 1979
[j4]- 1978
[j3]Andries E. Brouwer, Alexander Schrijver: The Blocking Number of an Affine Space. J. Comb. Theory, Ser. A 24(2): 251-253 (1978)
[j2]Alexander Schrijver: A Short Proof of Minc's Conjecture. J. Comb. Theory, Ser. A 25(1): 80-83 (1978)- 1977
[j1]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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-07 17:19 CEST by the dblp team



