Alexander Schrijver

1986–2005

A researcher in the Science corpus: 7 papers; trusts 0 researchers and is trusted by 40 researchers here, as inferred from the citation graph.

Whom Alexander Schrijver trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. L. Lov'asz
2. Joseph B. Kruskal
3. T. Lindvall

Who trusts Alexander Schrijver overall

1. Juan Pablo Vielma
2. James B. Orlin
3. Jan Vondr'ak
4. Martin J. Wainwright
5. J. D. Loera
6. Margaret H. Wright
7. Tim King
8. Stephen H. Bach
9. Danil V. Prokhorov
10. Shmuel Onn

Papers from Alexander Schrijver's perspective

Ordered by how strongly the researchers Alexander Schrijver trusts endorse each paper. Same corpus, a different order for every researcher.

1. Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions
2. Solution of a Large-Scale Traveling-Salesman Problem
3. Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
4. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
5. Submodular functions and convexity
6. Mathematical Methods of Organizing and Planning Production
7. Directed scale-free graphs (ACM-SIAM Symposium on Discrete Algorithms)
8. Emergence of Scaling in Random Networks
9. The Diameter of a Scale-Free Random Graph (Comb.)
10. Limits of dense graph sequences (J. Comb. Theory B)

Their papers

• A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time (2000) — 731 citations
• Reflection positivity, rank connectivity, and homomorphism of graphs (2004) — 199 citations
• A correction: orthogonal representations and connectivity of graphs (2000) — 56 citations
• On the History of Combinatorial Optimization (Till 1960) (2005) — 291 citations
• Matroids, trees, stable sets (2003) — 63 citations
• Combinatorial optimization. Polyhedra and efficiency. (2003) — 3,897 citations
• Theory of linear and integer programming (1986)