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.
Countries citing papers authored by Michael R. Fellows
Since
Specialization
Citations
This map shows the geographic impact of Michael R. Fellows'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 Michael R. Fellows with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael R. Fellows more than expected).
Fields of papers citing papers by Michael R. Fellows
This network shows the impact of papers produced by Michael R. Fellows. 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 Michael R. Fellows. The network helps show where Michael R. Fellows may publish in the future.
Co-authorship network of co-authors of Michael R. Fellows
This figure shows the co-authorship network connecting the top 25 collaborators of Michael R. Fellows.
A scholar is included among the top collaborators of Michael R. Fellows 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 Michael R. Fellows. Michael R. Fellows 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
1.
Bell, Tim, et al.. (2012). Unplugging Education: Removing barriers to engaging with new disciplines. CDU eSpace Institutional Repository (Charles Darwin University).1 indexed citations
Fellows, Michael R., Fedor V. Fomin, Daniel Lokshtanov, et al.. (2011). Local search: Is brute-force avoidable?. Journal of Computer and System Sciences. 78(3). 707–719.22 indexed citations
Fellows, Michael R., Frances Rosamond, Fedor V. Fomin, et al.. (2009). Local search: is brute-force avoidable?. CDU eSpace Institutional Repository (Charles Darwin University). 486–491.15 indexed citations
6.
Betzler, Nadja, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, & Frances Rosamond. (2009). How similarity helps to efficiently compute Kemeny rankings. CDU eSpace Institutional Repository (Charles Darwin University). 1(2009). 657–664.6 indexed citations
7.
Betzler, Nadja, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, & Frances Rosamond. (2009). Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science. 410(45). 4554–4570.50 indexed citations
8.
Betzler, Nadja, et al.. (2008). Computing Kemeny Rankings, Parameterized by the Average KT-Distance. NOVA (University of Newcastle Australia).2 indexed citations
9.
Fellows, Michael R. & Frances Rosamond. (2007). Why Is P Not Equal to NP. CDU eSpace Institutional Repository (Charles Darwin University).1 indexed citations
10.
Fellows, Michael R., Frances Rosamond, Udi Rotics, & Stefan Szeider. (2005). Proving NP-hardness for clique-width II: non-approximability of clique-width. Electronic colloquium on computational complexity.9 indexed citations
11.
Fellows, Michael R., Frances Rosamond, Udi Rotics, & Stefan Szeider. (2005). Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electronic colloquium on computational complexity.7 indexed citations
12.
Downey, Rodney G., et al.. (2004). Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings. Springer eBooks.1 indexed citations
Downey, Rodney G., Vladimir Estivill‐Castro, Michael R. Fellows, Elena Prieto, & Frances Rosamond. (2003). Cutting Up is Hard to Do: the Parameterized Complexity of k-cut and Related Problems.. Griffith Research Online (Griffith University, Queensland, Australia).6 indexed citations
15.
Fellows, Michael R., Jens Gramm, & Rolf Niedermeier. (2002). On the Parameterized Intractability of Closest Substring and Related Problems.3 indexed citations
16.
Cattell, Kevin, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, & Michael A. Langston. (2000). On computing graph minor obstruction sets. Theoretical Computer Science. 233(1-2). 107–127.17 indexed citations
17.
Bodlaender, Hans L., Michael R. Fellows, & Patricia Evans. (1996). Finite-State Computability of Annotations of Strings and Trees. 384–391.2 indexed citations
18.
Bodlaender, Hans L., Michael R. Fellows, & Michael Hallett. (1994). Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.. 449–458.37 indexed citations
19.
Fellows, Michael R. & Michael A. Langston. (1989). An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract). 520–525.7 indexed citations
20.
Abrahamson, Karl, et al.. (1989). On the Complexity of Fixed Parameter Problems (Extended Abstract). 210–215.2 indexed citations
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.