World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Lebanon
2026
Award Badge
Computer Science
Norway
2025

D-Index & Metrics

Computer Science

D-Index
73
Citations
21198
World Ranking
1592
National Ranking
1

Michael R. Fellows publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Michael R. Fellows sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 311 publications — 76th percentile

76% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Michael R. Fellows D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Michael R. Fellows sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 73 D-Index — 89th percentile

89% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

  • Fundamentals of Parameterized Complexity

    Rodney G. Downey;Michael R. Fellows

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

    Rod G. Downey;Michael R. Fellows

  • On problems without polynomial kernels

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

  • Fixed-Parameter Tractability and Completeness I: Basic Results

    Rod G. Downey;Michael R. Fellows

  • On the parameterized complexity of multiple-interval graph problems

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

  • Two Strikes Against Perfect Phylogeny

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

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

    Michael R. Fellows;Michael A. Langston

  • Parameterized complexity: A framework for systematically confronting computational intractability.

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

  • Nonconstructive tools for proving polynomial-time decidability

    Michael R. Fellows;Michael A. Langston

  • Polynomial-time data reduction for dominating set

    Jochen Alber;Michael R. Fellows;Rolf Niedermeier

  • Parameterized Computational Feasibility

    Rodney G. Downey;Michael R. Fellows

  • Tight lower bounds for certain parameterized NP-hard problems

    Jianer Chen;Benny Chor;Mike Fellows;Xiuzhen Huang

  • An improved fixed-parameter algorithm for vertex cover

    R. Balasubramanian;Michael R. Fellows;Venkatesh Raman

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

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

  • Fixed Parameter Tractability and Completeness.

    Rodney G. Downey;Michael R. Fellows

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

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

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

    Benny Chor;Mike Fellows;David Juedes

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

    Frank Dehne;Michael Fellows;Michael Langston;Frances Rosamond

  • Advice classes of parameterized tractability

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

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

    Michael R. Fellows;Michael A. Langston

Frequent Co-Authors

Frances A. Rosamond
Frances A. Rosamond University of Bergen
Rodney G. Downey
Rodney G. Downey Victoria University of Wellington
Michael A. Langston
Michael A. Langston University of Tennessee at Knoxville
Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Jiong Guo
Jiong Guo Shandong University
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Frank Dehne
Frank Dehne Carleton University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Michael R. Fellows

Trending Scientists

Recently Published Articles