default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Schrijver
Person information
- affiliation: University of Amsterdam, NL
- affiliation: CWI Amsterdam, NL
- award (2006): John von Neumann Theory Prize
- award (2004): Frederick W. Lanchester Prize
- award (1982): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j97]Sven C. Polak
, Alexander Schrijver:
New lower bound on the Shannon capacity of C7 from circular graphs. Inf. Process. Lett. 143: 37-40 (2019)- 2018
- [i3]Sven C. Polak, Alexander Schrijver:
New lower bound on the Shannon capacity of C7 from circular graphs. CoRR abs/1808.07438 (2018) - 2017
- [j96]Bart Litjens, Sven C. Polak, Alexander Schrijver:
Semidefinite bounds for nonbinary codes based on quadruples. Des. Codes Cryptogr. 84(1-2): 87-100 (2017) - 2016
- [j95]László Lovász, Jaroslav Nesetril, Alexander Schrijver:
Preface. Eur. J. Comb. 52: 245-247 (2016) - [j94]Guus Regts, Alexander Schrijver:
Compact orbit spaces in Hilbert spaces and limits of edge-colouring models. Eur. J. Comb. 52: 389-395 (2016) - [j93]Guus Regts, Alexander Schrijver, Bart Sevenster:
On partition functions for 3-graphs. J. Comb. Theory B 121: 421-431 (2016) - 2015
- [j92]Alexander Schrijver:
Characterizing partition functions of the edge-coloring model by rank growth. J. Comb. Theory A 136: 164-173 (2015) - 2013
- [j91]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger:
Analysis of multi-stage open shop processing systems. Math. Program. 142(1-2): 331-348 (2013) - 2012
- [j90]Dion Gijswijt, Hans D. Mittelmann, Alexander Schrijver:
Semidefinite Code Bounds Based on Quadruple Distances. IEEE Trans. Inf. Theory 58(5): 2697-2705 (2012) - 2011
- [j89]László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver:
Preface. Eur. J. Comb. 32(7): 951-953 (2011) - [j88]Éric Colin de Verdière, Alexander Schrijver:
Shortest vertex-disjoint two-face paths in planar graphs. ACM Trans. Algorithms 7(2): 19:1-19:12 (2011) - [c14]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
- [j87]László Lovász, Alexander Schrijver:
Dual graph homomorphism functions. J. Comb. Theory A 117(2): 216-222 (2010) - [j86]Monique Laurent, Alexander Schrijver:
On Leonid Gurvits's Proof for Permanents. Am. Math. Mon. 117(10): 903-911 (2010)
2000 – 2009
- 2009
- [j85]László Lovász, Alexander Schrijver:
Semidefinite Functions on Categories. Electron. J. Comb. 16(2) (2009) - [j84]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) - [j83]Alexander Schrijver:
Graph invariants in the spin model. J. Comb. Theory B 99(2): 502-511 (2009) - 2008
- [j82]László Lovász, Alexander Schrijver:
Graph parameters and semigroup functions. Eur. J. Comb. 29(4): 987-1002 (2008) - [j81]Leo G. Kroon, Ramon M. Lentink, Alexander Schrijver:
Shunting of Passenger Train Units: An Integrated Approach. Transp. Sci. 42(4): 436-449 (2008) - [c13]É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
- [j80]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
- [j79]Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
Group divisible designs with block-size four. Discret. Math. 306(10-11): 939-947 (2006) - [j78]Alexander Schrijver, Paul D. Seymour:
Solution of two fractional packing problems of Lovász. Discret. Math. 306(10-11): 973-978 (2006) - [j77]Pieter-Jan Fioole, Leo G. Kroon, Gábor Maróti, Alexander Schrijver:
A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174(2): 1281-1297 (2006) - [j76]Dion Gijswijt, Alexander Schrijver, Hajime Tanaka:
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory A 113(8): 1719-1731 (2006) - [j75]Arianna Alfieri, Rutger Groot, Leo G. Kroon, Alexander Schrijver:
Efficient Circulation of Railway Rolling Stock. Transp. Sci. 40(3): 378-391 (2006) - [c12]Alexander Schrijver:
New Code Bounds with Algebra and Semidefinite Programming. ACiD 2006: 5 - [c11]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger:
New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 - 2005
- [j74]Carlos J. Luz, Alexander Schrijver:
A Convex Quadratic Characterization of the Lovász Theta Number. SIAM J. Discret. Math. 19(2): 382-387 (2005) - [j73]Alexander Schrijver:
New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51(8): 2859-2866 (2005) - 2003
- [j72]Bojan Mohar, Alexander Schrijver:
Blocking nonorientability of a surface. J. Comb. Theory B 87(1): 2-16 (2003) - [j71]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) - [j70]Dion Gijswijt, Alexander Schrijver:
On the b-Stable Set Polytope of Graphs without Bad K4. SIAM J. Discret. Math. 16(3): 511-516 (2003) - [c10]Alexander Schrijver:
Matching, Edge-Colouring, and Dimers. WG 2003: 13-22 - 2002
- [j69]Alexander Schrijver:
A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs. J. Comb. Theory B 85(2): 255-260 (2002) - [j68]Alexander Schrijver:
On the history of the transportation and maximum flow problems. Math. Program. 91(3): 437-445 (2002) - [j67]Alexander Schrijver:
Strong T-Perfection of Bad-K4-Free Graphs. SIAM J. Discret. Math. 15(3): 403-415 (2002) - 2001
- [j66]Alexander Schrijver:
A Short Proof of Mader's sigma-Paths Theorem. J. Comb. Theory B 82(2): 319-321 (2001) - 2000
- [j65]Alexander Schrijver:
Total Dual Integrality of Matching Forest Constraints. Comb. 20(4): 575-588 (2000) - [j64]Jack H. Koolen, Monique Laurent, Alexander Schrijver:
Equilateral Dimension of the Rectilinear Space. Des. Codes Cryptogr. 21(1/3): 149-164 (2000) - [j63]Judith Keijsper, Rudi Pendavingh, Alexander Schrijver:
Adjacency, Inseparability, and Base Orderability in Matroids. Eur. J. Comb. 21(4): 487-502 (2000) - [j62]Alexander Schrijver:
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. J. Comb. Theory B 80(2): 346-355 (2000)
1990 – 1999
- 1999
- [b2]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 - [j61]Alexander Schrijver, Paul D. Seymour, Peter Winkler:
The Ring Loading Problem. SIAM Rev. 41(4): 777-791 (1999) - [p1]Sebastiaan van Vlijmen, Steven Klusener, Alexander Schrijver:
The Compact Dynamic Bus Station. Algebraic Specification in Action 1999: 1-20 - 1998
- [j60]Alexander Schrijver:
Counting 1-Factors in Regular Bipartite Graphs. J. Comb. Theory B 72(1): 122-135 (1998) - [j59]Judith Keijsper, Alexander Schrijver:
On Packing Connectors. J. Comb. Theory B 73(2): 184-188 (1998) - [j58]Alexander Schrijver:
Bipartite Edge Coloring in O(Delta m) Time. SIAM J. Comput. 28(3): 841-846 (1998) - [j57]Alexander Schrijver, Paul D. Seymour, Peter Winkler:
The Ring Loading Problem. SIAM J. Discret. Math. 11(1): 1-14 (1998) - 1997
- [j56]Jack Edmonds, Monique Laurent, Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids. Discret. Math. 165-166: 219-226 (1997) - [j55]Maurits de Graaf, Alexander Schrijver:
Making Curves Minimally Crossing by Reidemeister Moves. J. Comb. Theory B 70(1): 134-156 (1997) - [j54]Maurits de Graaf, Alexander Schrijver:
Decomposition of Graphs on Surfaces. J. Comb. Theory B 70(1): 157-165 (1997) - 1995
- [j53]Hein Vanderholst, Monique Laurent, Alexander Schrijver:
On a Minor-Monotone Graph Invariant. J. Comb. Theory B 65(2): 291-304 (1995) - 1994
- [j52]Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Induced Circuits in Planar Graphs. J. Comb. Theory B 60(2): 169-176 (1994) - [j51]Maurits de Graaf, Alexander Schrijver:
Grid Minors of Graphs on the Torus. J. Comb. Theory B 61(1): 57-62 (1994) - [j50]Alexander Schrijver:
Classification of Minimal Graphs of Given Face-Width on the Torus. J. Comb. Theory B 61(2): 217-236 (1994) - [j49]Alexander Schrijver, Paul D. Seymour:
Packing Odd Paths. J. Comb. Theory B 62(2): 280-288 (1994) - [j48]Alexander Schrijver:
Finding k Disjoint Paths in a Directed Planar Graph. SIAM J. Comput. 23(4): 780-788 (1994) - 1993
- [j47]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. J. Comb. Theory B 58(1): 40-45 (1993) - [j46]Alexander Schrijver:
Tait's Flyping Conjecture for Well-Connected Links. J. Comb. Theory B 58(1): 65-146 (1993) - [j45]Alexander Schrijver:
Graphs on the Torus and Geometry of Numbers. J. Comb. Theory B 58(1): 147-158 (1993) - [j44]Alexander Schrijver:
Note on hypergraphs and sphere orders. J. Graph Theory 17(2): 173-176 (1993) - [c9]Alexander Schrijver:
Complexity of Disjoint Paths Problems in Planar Graphs. ESA 1993: 357-359 - 1992
- [j43]Alexander Schrijver:
Circuits in graphs embedded on the torus. Discret. Math. 106-107: 415-433 (1992) - [j42]Maurits de Graaf, Alexander Schrijver, Paul D. Seymour:
Directed triangles in directed graphs. Discret. Math. 110(1-3): 279-282 (1992) - [j41]András Frank, Alexander Schrijver:
Edge-disjoint circuits in graphs on the torus. J. Comb. Theory B 55(1): 9-17 (1992) - [j40]Alexander Schrijver:
On the uniqueness of kernels. J. Comb. Theory B 55(1): 146-160 (1992) - [j39]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. SIAM J. Discret. Math. 5(1): 112-116 (1992) - [c8]Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Non-Interfering Network Flows. SWAT 1992: 245-257 - 1991
- [j38]Alexander Schrijver:
Disjoint Homotopic Paths and Trees in a Planar Graph. Discret. Comput. Geom. 6: 527-574 (1991) - [j37]Alexander Schrijver:
Disjoint circuits of prescribed homotopies in a graph on a compact surface. J. Comb. Theory B 51(1): 127-159 (1991) - [j36]Alexander Schrijver:
Decomposition of graphs on surfaces and a homotopic circulation theorem. J. Comb. Theory B 51(2): 161-210 (1991) - [j35]Alexander Schrijver:
Short proofs on multicommodity flows and cuts. J. Comb. Theory B 53(1): 32-39 (1991) - [j34]Alexander Schrijver, Paul D. Seymour:
A simpler proof and a generalization of the zero-trees theorem. J. Comb. Theory A 58(2): 301-305 (1991) - [j33]Alexander Schrijver:
Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs. SIAM J. Discret. Math. 4(1): 130-138 (1991) - [j32]László Lovász, Alexander Schrijver:
Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM J. Optim. 1(2): 166-190 (1991) - [c7]Alexander Schrijver:
Induced circuits in graphs on surfaces. Graph Structure Theory 1991: 183-193 - [c6]Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301 - 1990
- [j31]C. P. M. van Hoesel, Alexander Schrijver:
Edge-disjoint homotopic paths in a planar graph with one hole. J. Comb. Theory B 48(1): 77-91 (1990) - [j30]Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei:
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. Math. Oper. Res. 15(4): 736-748 (1990) - [j29]William J. Cook, Ravi Kannan, Alexander Schrijver:
Chvátal Closures for mixed Integer Programming Problems. Math. Program. 47: 155-174 (1990) - [c5]László Lovász, Alexander Schrijver:
Matrix Cones, Projection Representations, and Stable Set Polyhedra. Polyhedral Combinatorics 1990: 1-18 - [c4]Alexander Schrijver:
Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces. Polyhedral Combinatorics 1990: 119-138 - [c3]András Frank, Alexander Schrijver:
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. Polyhedral Combinatorics 1990: 139-162 - [c2]Alexander Schrijver, Paul D. Seymour:
Spanning Trees of Different Weights. Polyhedral Combinatorics 1990: 281-
1980 – 1989
- 1989
- [j28]Alexander Schrijver:
The Klein bottle and multicommodity flows. Comb. 9(4): 375-384 (1989) - [j27]Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos:
On fractional multicommodity flows and distance functions. Discret. Math. 73(1-2): 99-109 (1989) - [j26]Alexander Schrijver:
Distances and cuts in planar graphs. J. Comb. Theory B 46(1): 46-57 (1989) - [j25]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. Discret. Math. 2(1): 68-72 (1989) - 1988
- [b1]Martin Grötschel, László Lovász, Alexander Schrijver:
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2, Springer 1988, ISBN 978-3-642-97883-8 - 1986
- [j24]A. M. H. Gerards, Alexander Schrijver:
Matrices with the Edmonds - Johnson property. Comb. 6(4): 365-379 (1986) - [j23]Alexander Schrijver:
Polyhedral proof methods in combinatorial optimization. Discret. Appl. Math. 14(2): 111-133 (1986) - [j22]William J. Cook, Jean Fonlupt, Alexander Schrijver:
An integer analogue of Carathéodory's theorem. J. Comb. Theory B 40(1): 63-70 (1986) - [j21]Martin Grötschel, László Lovász, Alexander Schrijver:
Relaxations of vertex packing. J. Comb. Theory B 40(3): 330-343 (1986) - [j20]William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos:
Sensitivity theorems in integer linear programming. Math. Program. 34(3): 251-264 (1986) - 1985
- [j19]J. George Shanthikumar, Alfred Luhmer, H. Kremar, Ulrich Faigle, Martin Shubik, Hansjörg Wacker, Alexander Schrijver, Michael M. Richter:
Book reviews. Z. Oper. Research 29(3): 132-139 (1985) - 1984
- [j18]Martin Grötschel, László Lovász, Alexander Schrijver:
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". Comb. 4(4): 291-295 (1984) - [j17]Alexander Schrijver:
Proving total dual integrality with cross-free families - A general framework. Math. Program. 29(1): 15-27 (1984) - 1983
- [j16]Alexander Schrijver:
Bounds on the number of Eulerian orientations. Comb. 3(3): 375-380 (1983) - [j15]Andries E. Brouwer, Pierre Duchet, Alexander Schrijver:
Graphs whose neighborhoods have no special cycles. Discret. Math. 47: 177-182 (1983) - [j14]Alexander Schrijver:
Short proofs on the matching polyhedron. J. Comb. Theory B 34(1): 104-108 (1983) - [j13]Alexander Schrijver:
Packing and covering of crossing families of cuts. J. Comb. Theory B 35(2): 104-128 (1983) - 1982
- [j12]Alexander Schrijver:
On the number of edge-colourings of regular bipartite graphs. Discret. Math. 38(2-3): 297-301 (1982) - [c1]Alexander Schrijver:
Min-Max Results in Combinatorial Optimization. ISMP 1982: 439-500 - 1981
- [j11]Jacobus H. van Lint, Alexander Schrijver:
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. Comb. 1(1): 63-73 (1981) - [j10]Martin Grötschel, László Lovász, Alexander Schrijver:
The ellipsoid method and its consequences in combinatorial optimization. Comb. 1(2): 169-197 (1981) - 1980
- [j9]Alexander Schrijver:
A counterexample to a conjecture of Edmonds and Giles. Discret. Math. 32(2): 213-214 (1980)
1970 – 1979
- 1979
- [j8]Henry Martyn Mulder, Alexander Schrijver:
Median graphs and Helly hypergraphs. Discret. Math. 25(1): 41-50 (1979) - [j7]Alexander Schrijver, Paul D. Seymour:
Solution of two fractional packing problems of lovász. Discret. Math. 26(2): 177-184 (1979) - [j6]Alexander Schrijver:
Matroids and linking systems. J. Comb. Theory B 26(3): 349-369 (1979) - [j5]Alexander Schrijver:
A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inf. Theory 25(4): 425-429 (1979) - 1978
- [j4]Andries E. Brouwer, Alexander Schrijver:
The Blocking Number of an Affine Space. J. Comb. Theory A 24(2): 251-253 (1978) - [j3]Alexander Schrijver:
A Short Proof of Minc's Conjecture. J. Comb. Theory A 25(1): 80-83 (1978) - 1977
- [j2]Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
Group divisible designs with block-size four. Discret. Math. 20: 1-10 (1977) - [j1]Alexander Schrijver:
A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order". J. Comb. Theory A 23(3): 359-362 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
