Alexander Schrijver
- Computational Theory and Mathematics top 0.01%
- Advanced Graph Theory Research 69
- Complexity and Algorithms in Graphs 16
- Graph Labeling and Dimension Problems 16
-
- Limits and Structures in Graph Theory 22
-
- Computational Geometry and Mesh Generation 23
- Numerical Analysis top 0.5%
-
- Graph theory and applications 22
- Advanced Topology and Set Theory 9
-
- graph theory and CDMA systems 22
- Co-authors
- László LovászAdam N. LetchfordMartin GrötschelDavid K. SmithWilliam J. CookPaul SeymourLeo KroonC.A.J. Hurkens
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Journals
- IEEE Transactions on Information Theory (3 papers)European Journal of Operational Research (1 paper)Journal of the Operational Research Society (4 papers)
- Partner nations
- NetherlandsUnited StatesHungary
In The Last Decade
Alexander Schrijver
144 papers receiving 10.9k citations
Hit Papers
Peers
Comparison fields: 5 of 162
- Computational Theory and Mathematics 6.2k
- Discrete Mathematics and Combinatorics 1.2k
- Computer Graphics and Computer-Aided Design 1.2k
- Numerical Analysis 1.3k
- Industrial and Manufacturing Engineering 1.9k
Countries citing papers authored by Alexander Schrijver
This map shows the geographic impact of Alexander Schrijver's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alexander Schrijver with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Schrijver more than expected).
Fields of papers citing papers by Alexander Schrijver
This network shows the impact of papers produced by Alexander Schrijver. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alexander Schrijver. The network helps show where Alexander Schrijver may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Alexander Schrijver, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 13 | |
| 2 | 2008 | 7 | |
| 3 | Flows in railway optimization | 2008 | 0 |
| 4 | A rolling stock circulation model for combining and splitting of passenger trains. | 2004 | 2 |
| 5 | Paths, flows, matchings | 2003 | 2 |
| 6 | Matching, edge-colouring, dimers | 2003 | 1 |
| 7 | Matroids, trees, stable sets | 2003 | 8 |
| 8 | Efficient Circulation of Railway Rolling Stock | 2002 | 3 |
| 9 | A short proof of Mader's I -paths theorem: 319 | 2001 | 4 |
| 10 | A group-theoretical approach to disjoint paths in directed graphs | 1993 | 2 |
| 11 | Graphs on the torus and geometry of numbers | 1992 | 1 |
| 12 | Induced circuits in planar graphs | 1991 | 1 |
| 13 | Paths, Flows, and VLSI-Layout | 1990 | 187 |
| 14 | 1990 | 3 | |
| 15 | Cones of matrices and setfunctions, and 0-1 optimization | 1989 | 40 |
| 16 | Edge-disjoint homotopic paths in a planar graph with one hole | 1986 | 1 |
| 17 | Remarks on a theorem of Redei | 1981 | 47 |
| 18 | Vertex-critical subgraphs of kneser-graphs : (preprint) | 1978 | 0 |
| 19 | A proof of total dual integrality of matching polyhedra | 1977 | 3 |
| 20 | Graphs and supercompact spaces | 1974 | 1 |
About Alexander Schrijver
Alexander Schrijver is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics, having authored 152 papers that have together received 12.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (69 papers), Computational Geometry and Mesh Generation (23 papers), Limits and Structures in Graph Theory (22 papers), Graph theory and applications (22 papers), graph theory and CDMA systems (22 papers), Complexity and Algorithms in Graphs (16 papers), Graph Labeling and Dimension Problems (16 papers) and Advanced Topology and Set Theory (9 papers). The work is most often cited by research in Computational Theory and Mathematics (6.2k citations), Discrete Mathematics and Combinatorics (1.2k citations) and Computer Graphics and Computer-Aided Design (1.2k citations). Alexander Schrijver has collaborated with scholars based in Netherlands, United States and Hungary. Frequent co-authors include László Lovász, Adam N. Letchford, Martin Grötschel, David K. Smith, William J. Cook, Paul Seymour, Leo Kroon, C.A.J. Hurkens, A.E. Brouwer and Janny Leung. Their work appears in journals such as IEEE Transactions on Information Theory, European Journal of Operational Research and Journal of the Operational Research Society.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.