- Graph parameters and semigroup Laszlo Lovasz1
- Survey of Problems, Questions, and Conjectures
- TRANSPORTATION SCIENCE Vol. 40, No. 3, August 2006, pp. 378391
- A Course in Combinatorial Optimization Alexander Schrijver
- On the history of the transportation and maximum flow problems
- Free partially commutative groups, cohomology, and paths and circuits in directed graphs on
- Tensor subalgebras and First Fundamental Theorems in invariant
- New Limits on FaultTolerant Quantum Computation Harry Buhrman #
- Doc. Math. J. DMV 1 Routing and Timetabling by Topological Search
- Counting 1-factors in regular bipartite graphs Alexander Schrijver1
- The TutteBerge formula A basic result on matchings was found by Tutte [1947]. It characterizes graphs that
- Strong t-perfection of bad-K 4 -free graphs Alexander Schrijver 1
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time
- II. Stable sets and colourings 1. Stable sets and colourings
- Characterizing partition functions of the vertex Jan Draisma1
- Graph invariants in the edge model Alexander Schrijver1
- New upper bounds for nonbinary codes Dion Gijswijt , Alexander Schrijver y , Hajime Tanaka z
- Maximum flow In the 1950s, T.E. Harris at the RAND Corporation in Santa Monica (California) called
- Graph parameters and reflection positivity Michael H. Freedman
- Bipartite edgecolouring in O(\Deltam) time 1 Alexander Schrijver 2
- Advanced Graph Theory and Combinatorial Optimization
- Minimum circulation of railway stock Alexander Schrijver1
- Mathematisches Forschungsinstitut Oberwolfach Report No. 1/2006
- Counting 1factors in regular bipartite graphs Alexander Schrijver 1
- Alexander Schrijver Combinatorial Optimization
- Shunting of Passenger Train Units: an Integrated Approach
- The Tutte-Berge formula A basic result on matchings was found by Tutte [1947]. It characterizes graphs that
- Centrum voor Wiskunde en Informatica Spoorwegdienstregelingontwikkeling
- Polynomial and tensor invariants and combinatorial parameters
- Reduction of symmetric semidefinite programs using the regular #representation
- Theorem (Vizing's theorem for simple graphs). (G) 0 (G) (G)+ 1 for any simple graph G.
- Polyhedral Combinatorics and Combinatorial Optimization
- On the history of the transportation and maximum flow problems
- A short proof of Mader's Spaths theorem Alexander Schrijver 1
- 7. Cliques, cocliques, and colourings 7.1. Introduction
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable
- Graph parameters and semigroup Laszlo Lovasz 1 Alexander Schrijver 2
- Alexander Schrijver Combinatorial Optimization
- Block diagonalization of matrix -algebras A matrix -algebra is a nonempty collection A C
- Minimum circulation of railway stock Alexander Schrijver 1
- Polyhedral Combinatorics and Combinatorial Optimization
- Wiskunde achter het Spoorboekje Lex Schrijver
- Vol. 39, No. 1, JanuaryFebruary 2009, pp. 617 issn 0092-2102 eissn 1526-551X 09 3901 0006
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time
- The Colin de Verdi`ere graph parameter (Preliminary version, March 1997)
- The Ring Loading Problem Alexander Schrijver, Mathematics Center, Kruislaan 413, 1098 SJ Amsterdam
- TALG0702-19 ACM-TRANSACTION February 26, 2011 14:32 Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
- Centrum voor Wiskunde en Informatica Spoorwegdienstregelingontwikkeling
- Advanced Graph Theory and Combinatorial Optimization
- Maximum flow In the 1950s, T.E. Harris at the RAND Corporation in Santa Monica (California) called
- I. Matchings and coverings 1. Matchings, covers, and Gallai's theorem
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 181-192 www.stacs-conf.org
- Reduction of symmetric semidefinite programs using the regular -representation
- On the history of combinatorial optimization (till 1960)
- A convex quadratic characterization of the Lovsz theta number Carlos J. Luzy and Alexander Schrijverz
- New code upper bounds from the Terwilliger algebra and semidefinite programming
- A short proof of Guenin's characterization of weakly bipartite graphs
- A short proof of Mader's S-paths theorem Alexander Schrijver1
- Bipartite edge-colouring in O(m) time1 Alexander Schrijver2
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable
- On Leonid Gurvits's proof for permanents Monique Laurent and Alexander Schrijver
- Semidefinite code bounds based on quadruple Dion C. Gijswijt1
- A short proof of Guenin's characterization of weakly bipartite graphs
- A Course in Combinatorial Optimization Alexander Schrijver
- COMBINATORICA Bolyai Society --SpringerVerlag
- Strong t-perfection of bad-K4-free graphs Alexander Schrijver1
- The Colin de Verdi`ere graph parameter (Preliminary version, March 1997)
- 126 NAW 5/9 nr. 2 June 2008 Flows in railway optimization Alexander Schrijver Alexander Schrijver
- III. Disjoint paths 1. Shortest paths
- Doc. Math. J. DMV 1 !"#$&%' ($0)(21"2%'22 34%657!"87349
- New code upper bounds from the Terwilliger algebra and semidefinite programming
- Matching, Edge-Colouring, Dimers Alexander Schrijver
- Graph invariants in the edge model Alexander Schrijver 1
- Graph parameters and reflection positivity Michael H. Freedman
- Theorem (Vizing's theorem for simple graphs). (G) (G) (G) + 1 for any simple graph G.
- On Leonid Gurvits's Proof for Permanents Monique Laurent and Alexander Schrijver
- Grafen: Kleuren en Routeren Alexander Schrijver
- Tensor subalgebras and First Fundamental Theorems in invariant
- Semidefinite functions on categories Laszlo Lovasz
- Survey of Problems, Questions, and Conjectures
- Grafen: Kleuren en Routeren Alexander Schrijver
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- The Ring Loading Problem Alexander Schrijver, Mathematics Center, Kruislaan 413, 1098 SJ Amsterdam
- Characterizing partition functions of the vertex Jan Draisma1
- Semidefinite code bounds based on quadruple distances
