Colin Cooper
Impact in
-
- Limits and Structures in Graph Theory
-
- Complex Network Analysis Techniques
- Opinion Dynamics and Social Influence
Papers in
-
- Advanced Graph Theory Research 32
- Complexity and Algorithms in Graphs 15
-
- Stochastic processes and statistical mechanics 41
- Co-authors
- Alan Frieze (60 shared papers)Tomasz Radzik (20 shared papers)Martin Dyer (7 shared papers)Catherine Greenhill (2 shared papers)Juan C. Vera (2 shared papers)Petra Berenbrink (13 shared papers)Bruce Reed (3 shared papers)Ralf Klasing (4 shared papers)
- Journals
- Random Structures and Algorithms (21 papers)Combinatorics Probability Computing (11 papers)SIAM Journal on Discrete Mathematics (8 papers)Internet Mathematics (7 papers)Theoretical Computer Science (5 papers)
- Partner nations
- United KingdomUnited StatesCanada
In The Last Decade
Colin Cooper
115 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 89
- Discrete Mathematics and Combinatorics 240
- Statistical and Nonlinear Physics 627
- Mathematical Physics 413
- Statistics and Probability 249
- Computational Theory and Mathematics 459
Countries citing papers authored by Colin Cooper
This map shows the geographic impact of Colin Cooper'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 Colin Cooper with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Colin Cooper more than expected).
Fields of papers citing papers by Colin Cooper
This network shows the impact of papers produced by Colin Cooper. 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 Colin Cooper. The network helps show where Colin Cooper may publish in the future.
Co-authors
The 25 scholars most cited alongside Colin Cooper, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 122 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 195 | |
| 2 | 20th Annual ACM-SIAM Symposium on Discrete Algorithms | 2009 | 68 |
| 3 | 2006 | 62 | |
| 4 | 2015 | 61 | |
| 5 | 2004 | 60 | |
| 6 | 2009 | 57 | |
| 7 | 2000 | 54 | |
| 8 | 2009 | 53 | |
| 9 | 2004 | 52 | |
| 10 | 2014 | 44 | |
| 11 | 2005 | 41 | |
| 12 | 2006 | 37 | |
| 13 | 1988 | 36 | |
| 14 | 2000 | 35 | |
| 15 | 2006 | 34 | |
| 16 | 2004 | 33 | |
| 17 | Automata, Languages and Programming, 36th International Colloquium , ICALP 2009 | 2009 | 32 |
| 18 | 2006 | 30 | |
| 19 | 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) | 2002 | 30 |
| 20 | 1999 | 29 |
About Colin Cooper
Colin Cooper is a scholar working on Computational Theory and Mathematics, Mathematical Physics, Discrete Mathematics and Combinatorics, Statistical and Nonlinear Physics and Geometry and Topology, having authored 122 papers that have together received 1.8k indexed citations. Recurring topics across this work include Stochastic processes and statistical mechanics (41 papers), Advanced Graph Theory Research (32 papers), Complex Network Analysis Techniques (31 papers), Limits and Structures in Graph Theory (30 papers), Graph theory and applications (27 papers), Markov Chains and Monte Carlo Methods (17 papers), Complexity and Algorithms in Graphs (15 papers) and Optimization and Search Problems (10 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (240 citations), Statistical and Nonlinear Physics (627 citations), Mathematical Physics (413 citations), Statistics and Probability (249 citations) and Computational Theory and Mathematics (459 citations). Colin Cooper has collaborated with scholars based in United Kingdom, United States and Canada. Frequent co-authors include Alan Frieze, Tomasz Radzik, Martin Dyer, Catherine Greenhill, Juan C. Vera, Petra Berenbrink, Bruce Reed, Ralf Klasing, Katarzyna Musiał and Fei Gao. Their work appears in journals such as Random Structures and Algorithms, Combinatorics Probability Computing, SIAM Journal on Discrete Mathematics, Internet Mathematics and Theoretical Computer Science.
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.