Rodney G. Downey

121 papers receiving 3.6k citations

Hit Papers

Parameterized Complexity19992026200820171999201320102505007501000

Peers

Rodney G. Downey
Comparison fields: 5 of 88
  • Computational Theory and Mathematics 3.3k
  • Artificial Intelligence 974
  • Computer Networks and Communications 829
  • Geometry and Topology 450
  • Statistics and Probability 294
Replace Michael Saks with:
Michael Saks United States
Martin Grohe Germany
Marek Karpiński Germany
Luca Trevisan United States
Colin McDiarmid United Kingdom
Derek G. Corneil Canada
Michael Krivelevich Israel
Raphael Yuster Israel
Michael O. Rabin United States
Fedor V. Fomin Norway
Rodney G. Downey relative to Michael Saks United States Michael Saks's profile →
Citations per field
00.5×2.6×
Michael Saks · 1×
Citations per year

Countries citing papers authored by Rodney G. Downey

Since Specialization
Citations

This map shows the geographic impact of Rodney G. Downey'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 Rodney G. Downey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rodney G. Downey more than expected).

Fields of papers citing papers by Rodney G. Downey

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rodney G. Downey. 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 Rodney G. Downey. The network helps show where Rodney G. Downey may publish in the future.

Co-authorship network of co-authors of Rodney G. Downey

This figure shows the co-authorship network connecting the top 25 collaborators of Rodney G. Downey. A scholar is included among the top collaborators of Rodney G. Downey 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 Rodney G. Downey. Rodney G. Downey is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 10
2 1
3 1
4 14
5 2
6 16
7
Mathematical logic in Asia : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005
4
8
Bounded persistence pathwidth
2
9
Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings
1
10
Cutting Up is Hard to Do: the Parameterized Complexity of k-cut and Related Problems.
6
11 17
12 16
13 12
14 13
15 3
16
Review: Robert I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets
19
17 4
18 23
19 5
20 14

About Rodney G. Downey

Rodney G. Downey is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Statistics and Probability, having authored 129 papers that have together received 3.9k indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (88 papers), semigroups and automata theory (70 papers) and Advanced Topology and Set Theory (39 papers). The work is most often cited by research in Computational Theory and Mathematics (3.3k citations), Discrete Mathematics and Combinatorics (221 citations) and Geometry and Topology (450 citations). Rodney G. Downey has collaborated with scholars based in New Zealand, United States and Singapore. Frequent co-authors include Michael R. Fellows, Denis R. Hirschfeldt, Hans L. Bodlaender, Danny Hermelin, Steffen Lempp, Alexander Melnikov, Michael Stob, Liming Cai, Jianer Chen and H. Todd Wareham. Their work appears in journals such as Transactions of the American Mathematical Society, Advances in 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026