Alexander Schrijver (= Lex Schrijver)
CWI and University of Amsterdam
Address:
Centrum voor Wiskunde en Informatica,
Science Park 123,
1098 XG Amsterdam, The Netherlands.
email: lex@cwi.nl
Preprints:
-
A. Schrijver,
On virtual link invariants
ArXiv
-
A. Schrijver,
Weak and strong regularity, compactness, and approximation of polynomials
ArXiv
-
A. Schrijver,
Low rank approximation of polynomials
ArXiv
-
A. Schrijver,
Polynomial and tensor invariants and combinatorial parameters
PS
PDF
Railway optimization / Spoorwegoptimalisering:
Wiskunde achter het spoorboekje
PDF
Minimum circulation of railway stock
(CWI-Quarterly 6 (1993) 205--217)
PS
PDF
Planning van materieelomlopen
PS
PDF
Spoorwegdienstregelingontwikkeling (met Adri Steenbeek)
PS
PDF
Spoornetwerken (met Leo Kroon),
Nieuw Archief voor Wiskunde 5/16 (2015) 165--173.
PDF
COURSE NOTES:
A Course in Combinatorial Optimization
PDF
Worksheets:
Exercise 4.8 (i)
PS
PDF
Exercise 4.8 (ii)
PS
PDF
Exercise 4.8 (iii)
PS
PDF
Exercise 4.8 (iv)
PS
PDF
Grafen:
Kleuren
en Routeren
PDF
Werkbladen:
Opgave 3.10 (i)
PS
PDF
Opgave 3.10 (ii)
PS
PDF
Opgave 3.10 (iii)
PS
PDF
Opgave 3.10 (iv)
PS
PDF
Advanced Graph Theory and Combinatorial Optimization
PS
PDF
Advanced Graph Theory:
I. Matchings and coverings
II. Stable sets and colourings
III. Disjoint paths
IV. Stable matchings
V. Szemerédi's regularity lemma
Notes for our seminar:
Proof of Szemerédi's regularity lemma
On the graphon space
Deriving Szemerédi's regularity lemma for graphs from the
compactness of the graphon space
On weak regularity ⇔ strong regularity
Block diagonalization of matrix ∗-algebras
The Ellenberg-Gijswijt theorem
The Hales-Jewett theorem
Tutte-Berge ⇒ Gallai ⇒ Mader
On the Colin de Verdière graph parameter
Shortest disjoint paths
Observations on Woodall's conjecture
A proof of Razmyslov's theorem
Razmyslov and quivers
Congestion games (by Carla Groenland)
Borsuk's conjecture (by Carla Groenland)
Lloyd's theorem
The Erdős-Szeméredi sunflower conjecture (by Carla Groenland)
A proof of Strassen's semiring theorem
Rainbow paths in edge-coloured regular graphs
On the Shannon capacity of sums and products of graphs
Book: Combinatorial Optimization - Polyhedra and Efficiency
(Springer-Verlag, Berlin, 2003):
Table of Contents
PS
PDF
Survey of Problems, Questions, and Conjectures
PS
PDF
Comments welcome at lex@cwi.nl
Further Information from Springer-Verlag Heidelberg
Further Information from Springer-Verlag New York
The book is also available on
CD-ROM from Springer-Verlag
Recent publications:
-
A. Schrijver,
On the Shannon capacity of sums and products of graphs,
Indagationes Mathematicae 34 (2023) 37--41.
PDF
-
A. Schrijver,
Finding k partially disjoint paths in a directed planar graph,
in: Building Bridges II - Mathematics of László Lovász
(Imre Bárány, et al., eds),
Springer, Berlin, 2020, pp. 417--444.
ArXiv
-
S.C. Polak, A. Schrijver,
New lower bound on the Shannon capacity of C7 from circular graphs,
Information Processing Letters 143 (2019) 37--40.
ArXiv
-
L. Lovász, A. Schrijver,
Nullspace embeddings for outerplanar graphs,
in: A Journey Through Discrete Mathematics
(M. Loebl, et al., eds),
Springer, Heidelberg, 2017, pp. 571--591.
ArXiv
-
G. Regts, A. Schrijver, B. Sevenster,
On the existence of real R-matrices for virtual link invariants,
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 87 (2017) 435--443.
ArXiv
Journal
-
B. Litjens, S. Polak, A. Schrijver,
Semidefinite bounds for nonbinary codes based on quadruples,
Designs, Codes and Cryptography 84 (2017) 87--100.
ArXiv
Journal
-
A. Schrijver, B. Sevenster,
The Strong Arnold Property for 4-connected flat graphs,
Linear Algebra and Its Applications 522 (2017) 153--160.
ArXiv
-
G. Regts, A. Schrijver, B. Sevenster,
On partition functions of 3-graphs,
Journal of Combinatorial Theory, Series B 121 (2016) 421--431.
ArXiv
-
G. Regts, A. Schrijver,
Compact orbit spaces in Hilbert spaces and limits of edge-colouring models,
European Journal of Combinatorics 52 (2016) 389--395.
PDF
ArXiv
-
A. Schrijver,
Connection matrices and Lie algebra weight systems for multiloop chord diagrams,
Journal of Algebraic Combinatorics 42 (2015) 893--905.
PDF
-
A. Schrijver,
Characterizing partition functions of the edge-coloring model by rank growth,
Journal of Combinatorial Theory, Series A 136 (2015) 164--173.
PDF
ArXiv
-
A. Schrijver,
On Lie algebra weight systems for 3-graphs,
Journal of Pure and Applied Algebra 219 (2015) 4597--4606.
ArXiv
-
A. Schrijver,
On traces of tensor representations of diagrams,
Linear Algebra and Its Applications 476 (2015) 28--41.
ArXiv
-
C.E.J. Eggermont, A. Schrijver, G.J. Woeginger,
Analysis of multi-stage open shop processing systems,
Mathematical Programming Series A 142 (2013) 331--348.
-
A. Schrijver,
Characterizing partition functions of the spin model by rank growth,
Indagationes Mathematicae (N.S.) 24 (2013) 1018--1023.
PDF
ArXiv
-
D.C. Gijswijt, H.D. Mittelmann, A. Schrijver,
Semidefinite code bounds based on quadruple distances,
IEEE Transactions on Information Theory 58 (2012) 2697--2705.
PDF
ArXiv
-
J. Draisma, D. Gijswijt, L. Lovász, G. Regts, A. Schrijver,
Characterizing partition functions of the vertex model,
Journal of Algebra 350 (2012) 197--206.
PDF
ArXiv
-
C. Bachoc, D.C. Gijswijt, A. Schrijver, F. Vallentin,
Invariant semidefinite programs,
in: Handbook on Semidefinite, Conic and Polynomial Optimization
(M.F. Anjos, J.B. Lasserre, eds.),
Springer, New York, 2012, pp. 219--269.
ArXiv
-
C. Eggermont, A. Schrijver, G.J. Woeginger,
Analysis of multi-stage open shop processing systems,
in: 28th International Symposium on Theoretical Aspects of
Computer Science (STACS 2011), pp.484--494.
ArXiv
-
É. Colin de Verdière, A. Schrijver,
Shortest vertex-disjoint two-face paths in planar graphs,
ACM Transactions on Algorithms 7 (2011) no. 2, Art. 19.
PDF
-
L. Lovász, A. Schrijver,
Dual graph homomorphism functions,
Journal of Combinatorial Theory, Series A 117 (2010) 216--222.
PDF
-
M. Laurent, A. Schrijver,
On Leonid Gurvits' proof for permanents,
The American Mathematical Monthly 117 (2010) 903--911.
PDF
-
L. Lovász, A. Schrijver,
Semidefinite functions on categories,
The Electronic Journal of Combinatorics 16(2) (2009) R14.
PDF (preprint),
PDF
-
A. Schrijver,
Graph invariants in the spin model,
Journal of Combinatorial Theory, Series B 99 (2009) 502--511.
PDF
-
L.G. Kroon, D. Huisman, E. Abbink, P.J. Fioole, M. Fischetti,
G. Maróti, A. Schrijver, A. Steenbeek,
The new Dutch timetable: The OR revolution,
Interfaces 39 (2009) 6--17.
PDF
-
L.G. Kroon, R.M. Lentink, A. Schrijver,
Shunting of passenger train units: an integrated approach,
Transportation Science 42 (2008) 436--449.
PDF
-
A. Schrijver,
Wiskunde achter het spoorboekje,
Pythagoras 48 (2) (2008) 8--12.
PDF
-
A. Schrijver,
Graph invariants in the edge model.
in: Building Bridges --- Between Mathematics and Computer Science
(M. Grötschel, G.O.H. Katona, eds.),
Springer, Berlin, 2008, pp. 487--498.
PS
PDF
-
A. Schrijver,
Flows in railway optimization,
Nieuw Archief voor Wiskunde (3) 9 (2008) 126--131.
PDF
-
L. Lovász, A. Schrijver,
Graph parameters and semigroup functions,
European Journal of Combinatorics 29 (2008) 987--1002.
PS
PDF
-
A. Schrijver,
Szemelvények a kombinatorikus optimalizálás
történetéböl,
Alkalmazott Matematikai Lapok 25 (2008) 1--74.
-
É. Colin de Verdière, A. Schrijver,
Shortest vertex-disjoint two-face paths in planar graphs,
in: 25th International Symposium on Theoretical Aspects of
Computer Science (STACS 2008), pp. 181--192.
PDF
ArXiv
-
A. Schrijver,
Tensor subalgebras and first fundamental theorems in invariant theory,
Journal of Algebra 319 (2008) 1305--1319.
PS
PDF
-
E. de Klerk, D.V. Pasechnik, A. Schrijver,
Reduction of symmetric semidefinite programs using the
regular ∗-representation,
Mathematical Programming, Series B 109 (2007) 613--624.
PS
PDF
-
M.H. Freedman, L. Lovász, A. Schrijver,
Reflection positivity, rank connectivity,
and homomorphisms of graphs,
Journal of the American Mathematical Society 20 (2007) 37--51.
PDF
-
H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver, F. Unger,
New limits on fault-tolerant quantum computation,
in: 47th Annual IEEE Symposium on Foundations of Computer Science
(FOCS'06), pp. 411--419.
PS
ArXiv
-
P.J. Fioole, L.G. Kroon, G. Maróti, A. Schrijver,
A rolling stock circulation model for combining and splitting of
passenger trains,
European Journal of Operational Research 174 (2006) 1281--1297.
PS
PDF
-
D. Gijswijt, A. Schrijver, H. Tanaka,
New upper bounds for nonbinary codes based on the Terwilliger algebra
and semidefinite programming,
Journal of Combinatorial Theory, Series A 113 (2006) 1719--1731.
PS
-
A. Alfieri, R. Groot, L. Kroon, A. Schrijver,
Efficient circulation of railway rolling stock,
Transportation Science 40 (2006) 378--391.
PDF
-
A. Schrijver,
New code bounds with noncommutative algebra,
Oberwolfach Reports 3 (2006) 9--12.
PDF
-
A. Schrijver,
On the history of combinatorial optimization (till 1960),
in: "Handbook of Discrete Optimization''
(K. Aardal, G.L. Nemhauser, R. Weismantel, eds.),
Elsevier, Amsterdam, 2005, pp. 1--68.
PDF
-
C.J. Luz, A. Schrijver,
A convex quadratic characterization of the Lovász theta number,
SIAM Journal on Discrete Mathematics 19 (2005) 382--387.
PDF
-
A. Schrijver,
New code upper bounds from the Terwilliger algebra and semidefinite
programming,
IEEE Transactions on Information Theory 51 (2005) 2859--2866.
PS
PDF
-
A. Schrijver,
Polyhedral combinatorics and combinatorial optimization, in:
Journée Annuelle --- Recherche Opérationnelle,
Société Mathématique de France, Paris, 2004, pp. 59--74.
PS
PDF
-
M.H. Freedman, L. Lovász, A. Schrijver,
Graph parameters and reflection positivity,
Oberwolfach Reports 1 (2004) 79--81.
PS
PDF
- A. Schrijver,
Matching, edge-colouring, dimers,
in:
Graph-Theoretic Concepts in Computer Science
(H.L. Bodlaender, ed.),
Lecture Notes in Computer Science 2880, Springer-Verlag, Berlin, 2003,
pp. 13--22.
PS
PDF
-
A.M.H. Gerards, G. Maróti, A. Schrijver,
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini,
"A generalization of the perfect graph theorem under the disjunctive
index'',
Mathematics of Operations Research 28 (2003) 884--885.
-
D.C. Gijswijt, A. Schrijver,
On the b-stable set polytope of graphs without bad K4,
SIAM Journal on Discrete Mathematics 16 (2003) 511--516.
-
B. Mohar, A. Schrijver,
Blocking nonorientability of a surface,
Journal of Combinatorial Theory, Series B 87 (2003) 2--16.
-
A. Schrijver,
Strong t-perfection of bad-K4-free graphs,
SIAM Journal on Discrete Mathematics 15 (2002) 403--415.
PS
PDF
- A. Schrijver,
A short proof of Guenin's characterization of weakly bipartite graphs,
Journal of Combinatorial Theory, Series B 85 (2002) 255--260.
PS
PDF
- A. Schrijver,
On the history of the transportation and maximum flow problems,
Mathematical Programming 91 (2002) 437--445.
PS
PDF
- A. Schrijver,
A short proof of Mader's S-paths theorem,
Journal of Combinatorial Theory, Series B 82 (2001) 319--321.
PS
PDF
- A. Schrijver,
Total dual integrality of matching forest constraints,
Combinatorica 20 (2000) 575--588.
PS
- A. Schrijver,
A combinatorial algorithm minimizing submodular functions in strongly polynomial time,
Journal of Combinatorial Theory, Series B 80 (2000) 346--355.
PS
PDF
- J. Keijsper, R. Pendavingh, A. Schrijver,
Adjacency, inseparability, and base orderability in matroids,
European Journal of Combinatorics 21 (2000) 487--502.
- J. Koolen, M. Laurent, A. Schrijver,
Equilateral dimension of the rectilinear space,
Designs, Codes and Cryptography 21 (2000) 149--164.
-
L. Lovász, A. Schrijver,
On the null space of a Colin de Verdière matrix,
Annales de l'Institut Fourier 49 (1999) 1017--1026.
PS
- A. Schrijver,
Bipartite edge-colouring in O(Δm) time,
SIAM Journal on Computing 28 (1999) 841--846.
PS
PDF
- H. van der Holst, L. Lovász, A. Schrijver,
The Colin de Verdière graph parameter,
in: Graph Theory and Combinatorial Biology
(L. Lovász, A. Gyárfás, G. Katona, A. Recski, L. Székely, eds.),
János Bolyai Mathematical Society, Budapest, 1999, pp. 29--85.
PS
PDF
- S. van Vlijmen, S. Klusener, A. Schrijver,
The compact dynamic bus station,
Electronic Notes in Theoretical Computer Science Vol. 21 No. 7,
Elsevier, Amsterdam, 1999.
- A. Schrijver, P. Seymour, P. Winkler,
The ring loading problem,
SIAM Review 41 (1999) 777--791.
PS
PDF
-
A. Schrijver,
Counting 1-factors in regular bipartite graphs,
Journal of Combinatorial Theory, Series B 72 (1998) 122--135.
PS
PDF
-
L. Lovász, A. Schrijver,
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs,
Proceedings of the American Mathematical Society 126 (1998) 1275--1285.
PS
PDF
-
J. Keijsper, A. Schrijver,
On packing connectors,
Journal of Combinatorial Theory, Series B 73 (1998) 184--188.
-
A. Schrijver,
Routing and timetabling by topological search,
in: International Congress of Mathematicians Volume III,
Documenta Mathematica, Extra Vol. ICM III, (1998) 687-695.
PS
PDF
Further references in
MathSciNet for A. Schrijver
See also the
CWI repository
CWI DISCLAIMER