Peter Winkler
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 13
-
- Advanced Graph Theory Research 25
- Complexity and Algorithms in Graphs 12
- Co-authors
- Graham BrightwellRichard J. NowakowskiRonald GrahamPrasad TetaliLászló LovászGordon WilfongPaul SeymourRonald Fagin
- Journals
- International Journal of Quantum Chemistry (16 papers)Communications of the ACM (11 papers)Random Structures and Algorithms (7 papers)SIAM Journal on Discrete Mathematics (7 papers)Discrete Mathematics (6 papers)
- Partner nations
- United StatesGermanyUnited Kingdom
In The Last Decade
Peter Winkler
168 papers receiving 3.0k citations
Peers
Comparison fields: 5 of 128
- Discrete Mathematics and Combinatorics 344
- Computational Theory and Mathematics 1.3k
- Geometry and Topology 458
- Mathematical Physics 408
- Statistics and Probability 371
Countries citing papers authored by Peter Winkler
This map shows the geographic impact of Peter Winkler'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 Peter Winkler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Winkler more than expected).
Fields of papers citing papers by Peter Winkler
This network shows the impact of papers produced by Peter Winkler. 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 Peter Winkler. The network helps show where Peter Winkler may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Peter Winkler, 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 | 2025 | 2 | |
| 2 | 2014 | 4 | |
| 3 | 2009 | 2 | |
| 4 | 2009 | 3 | |
| 5 | 2005 | 21 | |
| 6 | 2004 | 24 | |
| 7 | 2003 | 37 | |
| 8 | Random Colorings of a Cayley Tree | 2000 | 10 |
| 9 | 2000 | 39 | |
| 10 | 2000 | 11 | |
| 11 | 1999 | 26 | |
| 12 | 1997 | 39 | |
| 13 | 1995 | 42 | |
| 14 | On playing “Twenty Questions” with a liar | 1992 | 29 |
| 15 | 1985 | 103 | |
| 16 | On graphs which are metric spaces of negative type0 | 1985 | 4 |
| 17 | 1984 | 154 | |
| 18 | 1983 | 266 | |
| 19 | 1983 | 3 | |
| 20 | 1982 | 39 |
About Peter Winkler
Peter Winkler is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Mathematical Physics, Statistics and Probability and Geometry and Topology, having authored 185 papers that have together received 3.3k indexed citations. Recurring topics across this work include Advanced Chemical Physics Studies (32 papers), Atomic and Molecular Physics (25 papers), Advanced Graph Theory Research (25 papers), Stochastic processes and statistical mechanics (23 papers), Markov Chains and Monte Carlo Methods (22 papers), Optimization and Search Problems (14 papers), Limits and Structures in Graph Theory (13 papers) and Complexity and Algorithms in Graphs (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (344 citations), Computational Theory and Mathematics (1.3k citations), Geometry and Topology (458 citations), Mathematical Physics (408 citations) and Statistics and Probability (371 citations). Peter Winkler has collaborated with scholars based in United States, Germany and United Kingdom. Frequent co-authors include Graham Brightwell, Richard J. Nowakowski, Ronald Graham, Prasad Tetali, László Lovász, Gordon Wilfong, Paul Seymour, Ronald Fagin, Moni Naor and Robert Yaris. Their work appears in journals such as International Journal of Quantum Chemistry, Communications of the ACM, Random Structures and Algorithms, SIAM Journal on Discrete Mathematics and Discrete Mathematics.
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.