2026 Rolf Niedermeier: 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	64	2622	2542	115	112	398	14992

Research.com Recognitions

2023 - Research.com Computer Science in Germany Leader Award

Overview

Rolf Niedermeier is affiliated with the Technical University of Berlin in Germany and has made contributions primarily within the field of computer science. Their research spans various subfields, including computational theory and mathematics, computer networks and communications, economics and econometrics, management science and operations research, and artificial intelligence.

Their work touches on multiple main topics such as advanced graph theory research, game theory and voting systems, complexity and algorithms in graphs, opportunistic and delay-tolerant networks, caching and content delivery, auction theory and applications, and optimization and search problems.

Rolf Niedermeier's recent published papers include the following:

"Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes," 2021, Psychometrika
"Efficient computation of optimal temporal walks under waiting-time constraints," 2020, Applied Network Science
"Envy-free allocations respecting social networks," 2022, Artificial Intelligence
"Robustness among multiwinner voting rules," 2020, Lecture notes in computer science
"The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality," 2022, Journal of Artificial Intelligence Research

Frequent coauthors collaborating with Niedermeier include:

Hendrik Molter
Robert Bredereck
André Nichterlein
Vincent Froese
Matthias Bentert

Niedermeier's publications have appeared often in venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Proceedings of the AAAI Conference on Artificial Intelligence
Lecture notes in computer science
Theoretical Computer Science

Best Publications

Invitation to fixed-parameter algorithms

Rolf Niedermeier

2117
Citations
Invitation to data reduction and problem kernelization

Jiong Guo;Rolf Niedermeier

374
Citations
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

Jochen Alber;Hans L. Bodlaender;Henning Fernau;Ton Kloks

335
Citations
Polynomial-time data reduction for dominating set

Jochen Alber;Michael R. Fellows;Rolf Niedermeier

262
Citations
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Jiong Guo;Jens Gramm;Falk Hüffner;Rolf Niedermeier

219
Citations
Parameterized complexity: exponential speed-up for planar graph problems

Jochen Alber;Henning Fernau;Rolf Niedermeier

208
Citations
An efficient fixed-parameter algorithm for 3-hitting set

Rolf Niedermeier;Peter Rossmanith

207
Citations
Upper bounds for Vertex Cover further improved

R. Niedermeier;P. Rossmanith

184
Citations
Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner;Christian Komusiewicz;Hannes Moser;Rolf Niedermeier

180
Citations
A general method to speed up fixed-parameter-tractable algorithms

Rolf Niedermeier;Peter Rossmanith

173
Citations
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

170
Citations
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

156
Citations
On efficient fixed-parameter algorithms for weighted vertex cover

Rolf Niedermeier;Peter Rossmanith

148
Citations
Reflections on Multivariate Algorithmics and Problem Parameterization

Rolf Niedermeier

133
Citations
A structural view on parameterizing problems: Distance from triviality

Jiong Guo;Falk Hüffner;Rolf Niedermeier

132
Citations
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Jens Gramm;Edward A. Hirsch;Rolf Niedermeier;Peter Rossmanith

129
Citations
Improved Algorithms and Complexity Results for Power Domination in Graphs

Jiong Guo;Rolf Niedermeier;Daniel Raible

125
Citations
Data reduction and exact algorithms for clique cover

Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

121
Citations
Parameterized Complexity of Vertex Cover Variants

Jiong Guo;Rolf Niedermeier;Sebastian Wernicke

106
Citations
Graph-modeled data clustering: fixed-parameter algorithms for clique generation

Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

104
Citations
Fixed-parameter tractability results for feedback set problems in tournaments

Michael Dom;Jiong Guo;Falk Hüffner;Rolf Niedermeier

68
Citations
PARAMETERIZED COMPLEXITY THEORY

Rolf Niedermeier

52
Citations

Frequent Co-Authors

Jiong Guo Shandong University

Piotr Faliszewski AGH University of Science and Technology

Michael R. Fellows Lebanese American University

Henning Fernau University of Trier

Gerhard J. Woeginger RWTH Aachen University

Toby Walsh University of New South Wales

Frances A. Rosamond University of Bergen

Hans L. Bodlaender Utrecht University

Peter Rossmanith RWTH Aachen University

Hartmut Ehrig Technical University of Berlin

External Links

Personal website of Rolf Niedermeier Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring online education opens up many flexible and affordable options for advancing your career in computer science and related fields. For those interested in business leadership roles, consider pursuing a cheap mba online to gain valuable management skills without breaking the bank.

If you prefer a more technical path, an artificial intelligence degree online lets you build expertise in one of today’s fastest-growing fields. Many reputable universities now offer high-quality online master’s programs tailored to your schedule, including the option to earn an online masters degree in as little as one year.

For those seeking a quick entry or a fast career upgrade, there are a range of fast degrees online designed to lead directly to well-paying roles. Whether you want to specialize further or shift your career, these flexible online programs make it easier than ever to reach your goals.