Paul D. Seymour
Paul D. Seymour publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, on topics such as Advanced Graph Theory Research, Limits and Structures in Graph Theory and Graph Labeling and Dimension Problems.
- World rank
- #48,853 of 7,710,434 ranked researchers
- Rank in United States
- #18,851 of 1,627,098
- Works
- 437
- Citations
- 25k
- Citations per work
- 58.0
What does Paul D. Seymour research?
Paul D. Seymour's work is mostly in Computer Science (56%), Mathematics (26%), Engineering (7%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences38989.1%
- Computer Science24355.7%
- Mathematics11526.4%
- Engineering317.0%
- Everything else4810.9%
- 1Computational Theory and Mathematics47% of their works
- 2Discrete Mathematics and Combinatorics17% of their works
- 3Geometry and Topology9% of their works
- 4Electrical and Electronic Engineering7% of their works
- 5Computer Graphics and Computer-Aided Design5% of their works
- 6Computer Networks and Communications4% of their works
Research topics
Which keywords describe Paul D. Seymour's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Graph Limits, Szemerédi's Theorem, Graph Labeling and Metric Dimension.
- Topological Dynamics
- Mesh Generation
- Topological Indices
- Complexity Theory
- Spectral Amplitude Coding
- Metric Dimension
- Szemerédi's Theorem
- Parameterized Complexity
- Algorithmic Applications
- Approximation Algorithms
- Graph Theory
- Graph Limits
- Graph Labeling
- Fiber Bragg Grating
- Combinatorial Optimization
- Graph Spectra
- Delaunay Triangulations
- Model Theory
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms4613 topics
- Algorithmic Applications4052 topics
- Graph Theory3361 topic
- Parameterized Complexity3361 topic
- Graph Limits1911 topic
- Szemerédi's Theorem1911 topic
- Graph Labeling1101 topic
- Metric Dimension1101 topic
- Fiber Bragg Grating751 topic
- Spectral Amplitude Coding751 topic
- Combinatorial Optimization691 topic
- Complexity Theory691 topic
- Graph Spectra691 topic
- Topological Indices691 topic
- Delaunay Triangulations561 topic
- Mesh Generation561 topic
- Model Theory291 topic
- Topological Dynamics291 topic
Where does Paul D. Seymour work?
Paul D. Seymour's main affiliation in the publication record is Princeton University, United States.
How many publications and citations does Paul D. Seymour have?
OpenAlex counts 437 works and 25,344 citations for Paul D. Seymour, an h-index of 69, ranking #48,853 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Paul D. Seymour. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.