2026 Michael R. Fellows: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	73	1592	1545	1	1	311	21198

Research.com Recognitions

2026 - Research.com Computer Science in Lebanon Leader Award
2025 - Research.com Computer Science in Norway Leader Award
2023 - Research.com Computer Science in Norway Leader Award
2022 - Research.com Computer Science in Norway Leader Award
2018 - Member of Academia Europaea
2014 - Fellow of the Royal Society of New Zealand

Overview

Michael R. Fellows is affiliated with the University of Bergen in Norway. Their research primarily lies within the field of computer science, with a focus on computational theory and mathematics, artificial intelligence, computer networks and communications, computer vision and pattern recognition, and signal processing.

The scientist's work spans various specialized topics related to computer science, including:

Constraint Satisfaction and Optimization
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Logic, Reasoning, and Knowledge
Data Management and Algorithms
Advanced Algebra and Logic
Limits and Structures in Graph Theory

Michael R. Fellows has contributed to several recent academic publications. Selected papers include:

"Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory" (2021) published in Artificial Intelligence
"The Parameterized Complexity of Abduction" (2021) published in Proceedings of the AAAI Conference on Artificial Intelligence
"Parameterized String Equations" (2021) published on arXiv (Cornell University)
"On Solution Discovery via Reconfiguration" (2023) published on arXiv (Cornell University)
"Open Problems in (Hyper)Graph Decomposition" (2023) published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The frequent co-authors of Michael R. Fellows include:

Frances Rosamond
Emmanuel Sam
Petr A. Golovach
Mario Grobler
Nicole Megow

Michael R. Fellows has published in various venues, among the most common are:

arXiv (Cornell University)
Artificial Intelligence
Proceedings of the AAAI Conference on Artificial Intelligence
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Journal of Computer and System Sciences

Throughout their career, Michael R. Fellows has been recognized with several distinctions, including membership in Academia Europaea since 2018 and being named Fellow of the Royal Society of New Zealand in 2014.

Best Publications

Parameterized Complexity

Rodney G. Downey;M. R. Fellows

4338
Citations
Fundamentals of Parameterized Complexity

Rodney G. Downey;Michael R. Fellows

1718
Citations
Fixed-parameter tractability and completeness II: on completeness for W [1]

Rod G. Downey;Michael R. Fellows

685
Citations
On problems without polynomial kernels

Hans L. Bodlaender;Rodney G. Downey;Michael R. Fellows;Danny Hermelin

637
Citations
Fixed-Parameter Tractability and Completeness I: Basic Results

Rod G. Downey;Michael R. Fellows

610
Citations
On the parameterized complexity of multiple-interval graph problems

Michael R. Fellows;Danny Hermelin;Frances Rosamond;Stéphane Vialette

390
Citations
Two Strikes Against Perfect Phylogeny

Hans L. Bodlaender;Michael R. Fellows;Tandy Warnow

305
Citations
On search, decision, and the efficiency of polynomial-time algorithms

Michael R. Fellows;Michael A. Langston

285
Citations
Parameterized complexity: A framework for systematically confronting computational intractability.

Rodney G. Downey;Michael R. Fellows;Ulrike Stege

277
Citations
Nonconstructive tools for proving polynomial-time decidability

Michael R. Fellows;Michael A. Langston

270
Citations
Polynomial-time data reduction for dominating set

Jochen Alber;Michael R. Fellows;Rolf Niedermeier

262
Citations
Parameterized Computational Feasibility

Rodney G. Downey;Michael R. Fellows

261
Citations
Tight lower bounds for certain parameterized NP-hard problems

Jianer Chen;Benny Chor;Mike Fellows;Xiuzhen Huang

241
Citations
An improved fixed-parameter algorithm for vertex cover

R. Balasubramanian;Michael R. Fellows;Venkatesh Raman

211
Citations
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues

Karl A. Abrahamson;Rodney G. Downey;Michael R. Fellows

208
Citations
Fixed Parameter Tractability and Completeness.

Rodney G. Downey;Michael R. Fellows

203
Citations
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.

Faisal N. Abu-Khzam;Rebecca L. Collins;Michael R. Fellows;Michael A. Langston

202
Citations
Linear kernels in linear time, or how to save k colors in O ( n 2 ) steps

Benny Chor;Mike Fellows;David Juedes

169
Citations
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

Frank Dehne;Michael Fellows;Michael Langston;Frances Rosamond

168
Citations
Advice classes of parameterized tractability

Liming Cai;Jianer Chen;Rodney G. Downey;Michael R. Fellows

152
Citations
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)

Michael R. Fellows;Michael A. Langston

9
Citations

Frequent Co-Authors

Frances A. Rosamond University of Bergen

Rodney G. Downey Victoria University of Wellington

Michael A. Langston University of Tennessee at Knoxville

Rolf Niedermeier Technical University of Berlin

Hans L. Bodlaender Utrecht University

Jiong Guo Shandong University

Daniel Lokshtanov University of California, Santa Barbara

Saket Saurabh Institute of Mathematical Sciences

Stefan Szeider TU Wien

Frank Dehne Carleton University

External Links

Wikipedia of Michael R. Fellows Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring the right academic and career pathway is crucial for students interested in Computer Science. Fortunately, the digital shift in education now allows for flexibility through a range of online degrees. There are quick degrees online that pay well, letting students enter the workforce faster and start earning with in-demand skills.

Specializing in cutting-edge fields is also a smart choice. For instance, the best online master's in artificial intelligence programs offer advanced learning in a booming tech sector, often at affordable rates and flexible schedules. Computer Science remains one of the best degrees for the future, given its application across multiple industries from healthcare to finance.

For those focused on efficiency, there are also easiest online masters degree programs that provide streamlined curricula without compromising on foundational knowledge. Choosing the right online program can lead to rewarding roles in software development, data analytics, or AI research, giving students the tools for long-term career growth.