Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Graph minors. II. Algorithmic aspects of tree-width
1986705 citationsNeil Robertson, Paul Seymourprofile →
Graph Minors .XIII. The Disjoint Paths Problem
1995581 citationsNeil Robertson, Paul SeymourJournal of Combinatorial Theory Series Bprofile →
The strong perfect graph theorem
2006567 citationsMaria Chudnovsky, Neil Robertson et al.profile →
Graph Minors. XX. Wagner's conjecture
2004374 citationsNeil Robertson, Paul SeymourJournal of Combinatorial Theory Series Bprofile →
This map shows the geographic impact of Paul Seymour'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 Paul Seymour with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Seymour more than expected).
This network shows the impact of papers produced by Paul Seymour. 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 Paul Seymour. The network helps show where Paul Seymour may publish in the future.
Co-authorship network of co-authors of Paul Seymour
This figure shows the co-authorship network connecting the top 25 collaborators of Paul Seymour.
A scholar is included among the top collaborators of Paul Seymour based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Paul Seymour. Paul Seymour is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
A proof of total dual integrality of matching polyhedra
1977·Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands·Paul Seymour,
Alexander Schrijver
3
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.