Alexander Schrijver

Alexander Schrijver's AcademicInfluence.com Rankings

Alexander Schrijver

Computer Science

#959

World Rank

#995

Historical Rank

computer-science Degrees

Alexander Schrijver

Mathematics

#525

World Rank

#1019

Historical Rank

Measure Theory

#315

World Rank

#480

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Alexander Schrijver's Degrees

PhD Mathematics University of Amsterdam

Why Is Alexander Schrijver Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alexander Schrijver is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Amsterdam. Since 1993 he has been co-editor in chief of the journal Combinatorica.

(See a Problem?)

Alexander Schrijver's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Theory of linear and integer programming (1986) (5764)
Combinatorial optimization. Polyhedra and efficiency. (2003) (3681)
Combinatorial optimization (1997) (2211)
Geometric Algorithms and Combinatorial Optimization (1988) (2175)
The ellipsoid method and its consequences in combinatorial optimization (1981) (2072)
Cones of Matrices and Set-Functions and 0-1 Optimization (1991) (1176)
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time (2000) (685)
Polynomial Algorithms for Perfect Graphs (1984) (372)
Handbook of Critical Issues in Goal Programming (1992) (367)
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS (2008) (314)
Chvátal closures for mixed integer programming problems (1990) (284)
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 (1989) (259)
On the History of Combinatorial Optimization (Till 1960) (2005) (252)
A comparison of the Delsarte and Lovász bounds (1979) (245)
On the history of the transportation and maximum flow problems (2002) (218)
New code upper bounds from the Terwilliger algebra and semidefinite programming (2005) (214)
A Course in Combinatorial Optimization (1990) (211)
A rolling stock circulation model for combining and splitting of passenger trains (2006) (197)
Sensitivity theorems in integer linear programming (1986) (193)
The New Dutch Timetable: The OR Revolution (2008) (191)
Reflection positivity, rank connectivity, and homomorphism of graphs (2004) (184)
Vertex-critical subgraphs of Kneser-graphs (1978) (168)
Paths, Flows, and VLSI-Layout (1990) (167)
The Ring Loading Problem (1998) (158)
Efficient Circulation of Railway Rolling Stock (2002) (141)
Group divisible designs with block-size four (2006) (140)
Reduction of symmetric semidefinite programs using the regular $$\ast$$-representation (2007) (136)
Orthogonal representations and connectivity of graphs (1989) (129)
Relaxations of vertex packing (1986) (128)
Counting 1-Factors in Regular Bipartite Graphs (1998) (126)
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (1981) (122)
The Blocking Number of an Affine Space (1978) (122)
Combinatorial Optimization: Cook/Combinatorial (1997) (109)
Matrices with the edmonds—Johnson property (1986) (109)
The Colin de Verdière graph parameter (1999) (108)
Finding k Disjoint Paths in a Directed Planar Graph (1994) (108)
The Traveling Salesman Problem (2011) (107)
History of mathematical programming : a collection of personal reminiscences (1991) (106)
Remarks on a theorem of Redei (1981) (104)
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (1990) (101)
Shunting of Passenger Train Units: An Integrated Approach (2006) (89)
Polyhedral combinatorics (1996) (86)
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs (1998) (86)
On Cutting Planes (1980) (84)
Matroids and linking systems (1979) (84)
Invariant Semidefinite Programs (2010) (84)
An integer analogue of Carathéodory's theorem (1986) (83)
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (2006) (79)
Median graphs and Helly hypergraphs (1979) (76)
Bipartite Edge Coloring in O(Delta m) Time (1999) (74)
Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions (1984) (72)
Min-Max Results in Combinatorial Optimization (1982) (68)
A Short Proof of Minc's Conjecture (1978) (67)
Matroids, trees, stable sets (2003) (61)
On the period of an operator, defined on antichains (1974) (61)
New Limits on Fault-Tolerant Quantum Computation (2006) (61)
On total dual integrality (1981) (58)
Homotopic routing methods (1990) (57)
Finding disjoint trees in planar graphs in linear time (1991) (55)
Min-max Relations for Directed Graphs (1982) (55)
Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” (1984) (55)
Semidefinite Code Bounds Based on Quadruple Distances (2010) (51)
A correction: orthogonal representations and connectivity of graphs (2000) (50)
A counterexample to a conjecture of Edmonds and Giles (1980) (46)
On lower bounds for permanents (1979) (45)
On the null space of a Colin de Verdière matrix (1999) (45)
A Convex Quadratic Characterization of the Lovász Theta Number (2005) (44)
On the History of the Shortest Path Problem (2012) (42)
Geometric Methods in Combinatorial Optimization (1984) (42)
A simpler proof and a generalization of the zero-trees theorem (1991) (40)
Graph invariants in the spin model (2009) (37)
Characterizing partition functions of the vertex model (2011) (35)
Making Curves Minimally Crossing by Reidemeister Moves (1997) (35)
Graphs whose neighborhoods have no special cycles (1983) (34)
On a Minor-Monotone Graph Invariant (1995) (32)
Disjoint circuits of prescribed homotopies in a graph on a compact surface (1991) (31)
Equilateral Dimension of the Rectilinear Space (2000) (31)
Decomposition of graphs on surfaces and a homotopic circulation theorem (1991) (31)
On Leonid Gurvits’s Proof for Permanents (2010) (30)
Short proofs on the matching polyhedron (1983) (30)
Grid Minors of Graphs on the Torus (1994) (28)
Disjoint homotopic paths and trees in a planar graph (1991) (28)
Shortest vertex-disjoint two-face paths in planar graphs (2008) (28)
Semidefinite bounds for nonbinary codes based on quadruples (2016) (26)
Graphs on the Torus and Geometry of Numbers (1993) (25)
The Colin De Verdi Ere Graph Parameter (1997) (25)
A POLYNOMIAL-TIME TEST FOR TOTAL DUAL INTEGRALITY IN FIXED DIMENSION (1984) (25)
Disjoint Paths in a Planar Graph - A General Theorem (1992) (24)
The Ellipsoid Method (1993) (23)
The Colin de Verdière parameter (1999) (23)
A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs (2002) (22)
New lower bound on the Shannon capacity of C7 from circular graphs (2018) (22)
Proving total dual integrality with cross-free families—A general framework (1984) (22)
Bipartite edge-colouring in O( m) time1 (1999) (22)
Short proofs on multicommodity flows and cuts (1991) (20)
The Klein bottle and multicommodity flows (1989) (20)
Discrete mathematics and optimization (2004) (20)
A Short Proof of Mader's sigma-Paths Theorem (2001) (20)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (19)
Tensor subalgebras and First Fundamental Theorems in invariant theory (2006) (19)
Fete of combinatorics and computer science (2010) (18)
Characterizing partition functions of the spin model by rank growth (2012) (18)
Association schemes and the Shannon capacity: Eberlein-polynomials and the Erdos-Ko-Rado Theorem (1981) (17)
On the uniqueness of kernels (1992) (17)
Total Dual Integrality of Matching Forest Constraints (2000) (17)
Minor-monotone graph invariants. (1997) (17)
Matrix Cones, Projection Representations, and Stable Set Polyhedra (1990) (16)
Classification of Minimal Graphs of Given Face-Width on the Torus (1994) (16)
Distances and cuts in planar graphs (1989) (16)
Fractional packing and covering (1979) (15)
Induced Circuits in Planar Graphs (1994) (15)
Spanning Trees of Different Weights (1990) (14)
A short proof of Mader's I -paths theorem: 319 (2001) (14)
Bounds on the number of Eulerian orientations (1983) (14)
Routing and timetabling by topological search (1998) (13)
Strong T-Perfection of Bad-K4-Free Graphs (2002) (13)
Packing Odd Paths (1994) (12)
On the invariance of Colin de Verdière's graph parameter under clique sums (1995) (12)
Polyhedral proof methods in combinatorial optimization (1986) (12)
Graph parameters and semigroup functions (2008) (12)
Subbase characterizations of compact topological spaces (1979) (11)
Stable Sets in Graphs (1993) (11)
A proof of total dual integrality of matching polyhedra (1977) (11)
Complexity, Oracles, and Numerical Computation (1988) (11)
The dependence of some logical axioms on disjoint transversals and linked systems : (prepublication) (1976) (11)
Graph Invariants in the Edge Model (2008) (10)
Semidefinite Functions on Categories (2009) (10)
Paths, flows, matchings (2003) (9)
On fractional multicommodity flows and distance functions (1989) (9)
Bounds on permanents, and the number of 1-factors and 1-factorizations in bipatite graphs (1983) (9)
Edge-disjoint circuits in graphs on the torus (1992) (9)
Homotopy and crossings of systems of curves on a surface (1989) (8)
Tait's Flyping Conjecture for Well-Connected Links (1993) (8)
Packing and covering of crossing families of cuts (1983) (8)
Characterizing partition functions of the edge-coloring model by rank growth (2012) (8)
Edge-disjoint homotopic paths in a planar graph with one hole (1990) (8)
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index" (2003) (8)
Non-Interfering Network Flows (1992) (8)
Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs (1991) (7)
Np and Np‐Completeness (2011) (7)
On traces of tensor representations of diagrams (2015) (7)
Decomposition of Graphs on Surfaces (1997) (7)
On the number of edge-colourings of regular bipartite graphs (1982) (7)
A characterization of supercompactness with an application to treelike spaces (1974) (7)
Finding k Partially Disjoint Paths in a Directed Planar Graph (2015) (6)
Problems and Algorithms (2011) (6)
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle (1993) (6)
Signed graphs, regular matroids, grafts (1986) (6)
Dual graph homomorphism functions (2010) (5)
Compact orbit spaces in Hilbert spaces and limits of edge-colouring models (2012) (5)
Complexity of Disjoint Paths Problems in Planar Graphs (1993) (5)
On Packing Connectors (1998) (5)
Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms (1998) (5)
Solution of two fractional packing problems of lovász (2006) (4)
Adjacency, Inseparability, and Base Orderability in Matroids (2000) (4)
The new Linear programming method of Karmarkar (1985) (4)
On the existence of real R-matrices for virtual link invariants (2015) (4)
The Strong Arnold Property for 4-connected flat graphs (2015) (4)
Matching, edge-colouring, dimers (2003) (4)
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph (1990) (4)
On the b-Stable Set Polytope of Graphs without Bad K4 (2003) (4)
Blocking nonorientability of a surface (2003) (4)
A group-theoretical approach to disjoint paths in directed graphs (1993) (4)
Combinatorial Optimization: A Tour d’Horizon (1993) (4)
Matching, Edge-Colouring, and Dimers (2003) (3)
Non-interfering dipaths in planar digraphs (1991) (3)
Tensor algebras and combinatorial parameters (2006) (3)
Polyhedral combinatorics and combinatorial optimization (2004) (3)
A minor-monotone graph parameter based on oriented matroids (1997) (3)
Packing and covering in combinatorics (1979) (3)
Connection matrices and Lie algebra weight systems for multiloop chord diagrams (2014) (3)
Circuits in graphs embedded on the torus (1992) (3)
On partition functions for 3-graphs (2015) (3)
Flows in railway optimization (2008) (2)
Low rank approximation of polynomials (2012) (2)
Graphs and supercompact spaces (1974) (2)
Paths in Graphs and Curves on Surfaces (1994) (2)
Superextensions which are Hilbert cubes (1976) (2)
On Lie algebra weight systems for 3-graphs (2014) (2)
On virtual link invariants (2012) (2)
SHORTEST VERTEX-DISJOINT TWO-FACE PATHS (2008) (2)
GRAPH LIMITS AND EXCHANGEABLE RANDOM (2007) (2)
Free partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces (2012) (2)
Minimum‐Cost Flow Problems (2011) (2)
Characterizing homotopy of systems of curves on a compact surface by crossing numbers (1995) (2)
A Pythagoras proof of Szemer\'edi's regularity lemma (2012) (1)
Note on hypergraphs and sphere orders (1993) (1)
A Note on Packing Connectors (1997) (1)
Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces (1990) (1)
Polynomial and tensor invariants and combinatorial parameters (2012) (1)
Disjoint paths, hypergraphs (2003) (1)
On the Shannon capacity of sums and products of graphs (2022) (1)
Analysis of multi-stage open shop processing systems (2011) (1)
Paths and flows: a historical survey (1993) (1)
Review of modern applied mathematics: Optimization and operations research : edited by Bernhard Korte (1984) (1)
The Compact Dynamic Bus Station (1999) (1)
Nullspace embeddings for outerplanar graphs (2016) (1)
Maximum Flow Problems (2011) (1)
On the Behaviour of Colin De Verdi Ere's Invariant under Clique Sums (2007) (1)
Vertex-critical subgraphs of kneser-graphs : (preprint) (1978) (1)
On Total Dual (2005) (0)
On generalized link invariants (2012) (0)
Some combinatorial applications of the new linear programming method (1981) (0)
Optimal Trees and Paths (2011) (0)
Book reviews (1985) (0)
Algorithms for Convex Bodies (1993) (0)
Networks and logic - optimization and programming (PNA1) (2002) (0)
UvA-DARE (Digital Academic Repository) Semidefinite functions on categories (2009) (0)
Bounds on stable sets in graphs and codes (2010) (0)
United States Patent ( 19 Ajtai USOO 5737425 A 11 Patent Number : 5 , 737 , 425 45 Date of Patent : 54 CRYPTOSYSTEM EMPLOYING WORST (0)
A comparison of bounds of delsarte and lovasz : (preprint) (1978) (0)
Weak and strong regularity, compactness, and approximation of polynomials (2012) (0)
Graph parameters and reflection positivity (2004) (0)
Preface (2016) (0)
Integral solution to systems $ Ax leq b $ (1992) (0)
On the strong connectivity problem (1989) (0)
Total Dual lntegrallty from Directed Graphs , Crossing F ' amWes , and Sub · and Supermodular Functions (2005) (0)
Characterizations of supercompact spaces (1977) (0)
On the existence of real R-matrices for virtual link invariants (2017) (0)
The partially disjoint paths problem (2017) (0)
APPENDIX A: Linear Programming (2011) (0)
Semidefinite bounds for nonbinary codes based on quadruples (2016) (0)
Doc. Math. J. DMV 1 (0)
Integrality of Polyhedra (2011) (0)
Induced circuits in graphs on surfaces (1991) (0)
Combinatorial algorithms in bioinformatics (2004) (0)
A group-divisible design GD(4,1,2;n) exists iff $n \equiv 2$ (mod 6), $n \not 8$ (or: the packing of cocktail party graphs with $K_4$'s) (1976) (0)
Analysis of multi-stage open shop processing systems (2012) (0)
Polyhedra and algorithms (1987) (0)
It was completely abracadabra to me, but it seemed very interesting. An interview with Cor Baayen. (Dutch) (1994) (0)
Linking systems, matroids, and bipartite graphs (1976) (0)
Combinatorial Optimization: Some Basic Examples (1993) (0)
A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order" (1977) (0)
Some background information from linear algebra (1979) (0)
Graphs with balanced star-hypergraph (1975) (0)
OBSERVATIONS ON WOODALL’S CONJECTURE (2016) (0)
Algorithmic Aspects of Convex Sets: Formulation of the Problems (1993) (0)
Rambling along paths, flows, trees, curves, knots, and rails (1994) (0)
The linking of matroids by linking systems (1978) (0)
Each complete bipartite graph minus a matching is representable by line segments (1976) (0)
De ideale routeplanner (2006) (0)
UvA-DARE (Digital Academic Graph parameters and semigroup functions (0)
Applying free partially commutative groups to paths and circuits in directed graphs on surfaces (1993) (0)
Two optimal constant weight codes (1975) (0)
Problemen oplossen in de Lage Landen (1996) (0)
New Code Bounds with Algebra and Semidefinite Programming (2006) (0)
The Colin de Verdière graph parameter ( Preliminary version , March 1997 ) (1990) (0)
Algorithms, Combinatorics and Optimization (2003) (0)
Linking systems, 2 (1975) (0)
Diophantine Approximation and Basis Reduction (1993) (0)
/ 06 04 14 1 v 2 20 A pr 2 00 6 New Limits on Fault-Tolerant Quantum Computation (2006) (0)
Edge-coloring models (2015) (0)
Geometric methods in discrete optimization (1986) (0)
UvA-DARE ( Digital Academic Repository ) Graph parameters and semigroup functions (2017) (0)
Combinatoriële algoritmen in de bioinformatica (2004) (0)
Connection matrices and Lie algebra weight systems for multiloop chord diagrams (2015) (0)
Workshop: Combinatorics Table of Contents (2006) (0)
Preface (2011) (0)
UvA-DARE (Digital Academic Repository) On partition functions for 3-graphs (2018) (0)

This paper list is powered by the following services:

Other Resources About Alexander Schrijver

What Schools Are Affiliated With Alexander Schrijver?

Alexander Schrijver is affiliated with the following schools:

Alexander Schrijver's Academic­Influence.com Rankings

Alexander Schrijver's Degrees

Why Is Alexander Schrijver Influential?

Alexander Schrijver's Published Works

Published Works

Other Resources About Alexander Schrijver

What Schools Are Affiliated With Alexander Schrijver?

Image Attributions

Alexander Schrijver's AcademicInfluence.com Rankings