World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Germany
2023

D-Index & Metrics

Computer Science

D-Index
64
Citations
14992
World Ranking
2622
National Ranking
115

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

  • Invitation to data reduction and problem kernelization

    Jiong Guo;Rolf Niedermeier

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

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

  • Polynomial-time data reduction for dominating set

    Jochen Alber;Michael R. Fellows;Rolf Niedermeier

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

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

  • Parameterized complexity: exponential speed-up for planar graph problems

    Jochen Alber;Henning Fernau;Rolf Niedermeier

  • An efficient fixed-parameter algorithm for 3-hitting set

    Rolf Niedermeier;Peter Rossmanith

  • Upper bounds for Vertex Cover further improved

    R. Niedermeier;P. Rossmanith

  • Fixed-Parameter Algorithms for Cluster Vertex Deletion

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

  • A general method to speed up fixed-parameter-tractable algorithms

    Rolf Niedermeier;Peter Rossmanith

  • Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

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

  • Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

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

  • On efficient fixed-parameter algorithms for weighted vertex cover

    Rolf Niedermeier;Peter Rossmanith

  • Reflections on Multivariate Algorithmics and Problem Parameterization

    Rolf Niedermeier

  • A structural view on parameterizing problems: Distance from triviality

    Jiong Guo;Falk Hüffner;Rolf Niedermeier

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

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

  • Improved Algorithms and Complexity Results for Power Domination in Graphs

    Jiong Guo;Rolf Niedermeier;Daniel Raible

  • Data reduction and exact algorithms for clique cover

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

  • Parameterized Complexity of Vertex Cover Variants

    Jiong Guo;Rolf Niedermeier;Sebastian Wernicke

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

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

  • Fixed-parameter tractability results for feedback set problems in tournaments

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

  • PARAMETERIZED COMPLEXITY THEORY

    Rolf Niedermeier

Frequent Co-Authors

Jiong Guo
Jiong Guo Shandong University
Piotr Faliszewski
Piotr Faliszewski AGH University of Science and Technology
Michael R. Fellows
Michael R. Fellows Lebanese American University
Henning Fernau
Henning Fernau University of Trier
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Toby Walsh
Toby Walsh University of New South Wales
Frances A. Rosamond
Frances A. Rosamond University of Bergen
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Peter Rossmanith
Peter Rossmanith RWTH Aachen University
Hartmut Ehrig
Hartmut Ehrig Technical University of Berlin

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 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.

Best Scientists Citing Rolf Niedermeier

Trending Scientists

Recently Published Articles