Paul D. Seymour
Computational Theory and Mathematics · 2001–2010
A researcher in the Science corpus: 9 papers; trusts 6 researchers and is trusted by 8 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 8 citations into it; #4,724 of 12,182 by trust here, #2,761 by citations
Whom Paul D. Seymour trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Paul D. Seymour overall
Papers from Paul D. Seymour's perspective
Ordered by how strongly the researchers Paul D. Seymour trusts endorse each paper. Same corpus, a different order for every researcher.
- Recognizing Berge Graphs (Comb.)
- Graph Minors. XX. Wagner's conjecture (J. Comb. Theory B)
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
- Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
- Submodular functions and convexity
- Solution of a Large-Scale Traveling-Salesman Problem
- ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
- Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions
- Mathematical Methods of Organizing and Planning Production
Their papers
- Graph Minors. XX. Wagner's conjecture (2004) — 992 citations
- Directed Tree-Width (2001) — 321 citations
- Graph minors XXIII. Nash-Williams' immersion conjecture (2010) — 810 citations
- Approximating clique-width and branch-width (2006) — 549 citations
- The Strong Perfect Graph Theorem (2002) — 680 citations
- Excluding induced subgraphs (2006) — 60 citations
- Recognizing Berge Graphs (2005) — 315 citations
- Graphs of bounded rank-width (2005) — 56 citations
- Graph Minors. XVI. Excluding a non-planar graph (2003) — 413 citations