World's Best Scientists 2026 revealed!
Peter Rossmanith

Peter Rossmanith

D-Index & Metrics

Computer Science

D-Index
39
Citations
4431
World Ranking
9911
National Ranking
496

Overview

Peter Rossmanith is affiliated with RWTH Aachen University in Germany and specializes in the field of Computer Science, with a particular focus on Computational Theory and Mathematics, Computer Networks and Communications, and Artificial Intelligence. Their research extends also into Industrial and Manufacturing Engineering as well as Molecular Biology.

Their work covers a variety of topics, notably optimization and search problems, complexity and algorithms in graphs, optimization and packing problems, advanced graph theory research, semigroups and automata theory, ionic liquids properties and applications, and auction theory and applications.

Peter Rossmanith has contributed to multiple publications, with frequent appearances in the following venues:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Separation and Purification Technology
  • International Journal of Molecular Sciences
  • Frontiers in Computational Neuroscience

Some recent publications include:

  • How to Evaluate Non-Growing Cells-Current Strategies for Determining Antimicrobial Resistance of VBNC Bacteria (2021, Antibiotics)
  • Evaluation of the antimicrobial activity of pyrithione-based ionic liquids (2020, Separation and Purification Technology)
  • A Uniform Framework for Problems on Context-Free Grammars (2024, arXiv (Cornell University))
  • Bacterial Resistance Toward Antimicrobial Ionic Liquids Mediated by Multidrug Efflux Pumps (2022, Frontiers in Microbiology)
  • Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation Speed in Stimulated Peripheral Nerve? (2022, Frontiers in Computational Neuroscience)

The scientist frequently collaborates with a group of co-authors, with whom they have multiple joint publications. These include:

  • Henri Lotze (12 publications)
  • Patrick Mester (10 publications)
  • Hans-Joachim Böckenhauer (8 publications)
  • Elisabet Burjons (8 publications)
  • Fabian Frei (8 publications)

Best Publications

  • Efficient Algorithms for Model Checking Pushdown Systems

    Javier Esparza;David Hansel;Peter Rossmanith;Stefan Schwoon

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

    Rolf Niedermeier;Peter Rossmanith

  • Upper bounds for Vertex Cover further improved

    R. Niedermeier;P. Rossmanith

  • Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

    Eun Jung Kim;Alexander Langer;Christophe Paul;Felix Reidl

  • Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution

    Johan M. M. van Rooij;Hans L. Bodlaender;Peter Rossmanith

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

    Rolf Niedermeier;Peter Rossmanith

  • On efficient fixed-parameter algorithms for weighted vertex cover

    Rolf Niedermeier;Peter Rossmanith

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

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

  • New Upper Bounds for Maximum Satisfiability

    Rolf Niedermeier;Peter Rossmanith

  • Divide-and-color

    Joachim Kneis;Daniel Mölle;Stefan Richter;Peter Rossmanith

  • Parameterized power domination complexity

    Joachim Kneis;Daniel Mölle;Stefan Richter;Peter Rossmanith

  • Dynamic Programming for Minimum Steiner Trees

    B. Fuchs;W. Kern;D. Molle;S. Richter

  • Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

    Daniel Mölle;Stefan Richter;Peter Rossmanith

  • Exact Solutions for CLOSEST STRING and Related Problems

    Jens Gramm;Rolf Niedermeier;Peter Rossmanith

  • Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms

    Jianer Chen;Joachim Kneis;Songjian Lu;Daniel Mölle

  • A Faster Parameterized Algorithm for Treedepth

    Unknown

  • An exact algorithm for the Maximum Leaf Spanning Tree problem

    Henning Fernau;Joachim Kneis;Dieter Kratsch;Alexander Langer

  • Kernelization using structural parameters on sparse graph classes

    Jakub Gajarský;Petr Hlinźný;Jan Obdrźálek;Sebastian Ordyniak

  • A Fine-grained Analysis of a Simple Independent Set Algorithm

    Joachim Kneis;Alexander Langer;Peter Rossmanith

  • A faster algorithm for the steiner tree problem

    Daniel Mölle;Stefan Richter;Peter Rossmanith

  • The online knapsack problem: Advice and randomization

    Hans-Joachim Böckenhauer;Dennis Komm;Richard Královič;Peter Rossmanith

  • Are there any good digraph width measures

    Robert Ganian;Petr Hlinený;Joachim Kneis;Daniel Meister

Frequent Co-Authors

Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Javier Esparza
Javier Esparza Technical University of Munich
Dieter Kratsch
Dieter Kratsch University of Lorraine
Henning Fernau
Henning Fernau University of Trier
Thomas Erlebach
Thomas Erlebach Durham University
Christophe Paul
Christophe Paul University of Montpellier
Dániel Marx
Dániel Marx Saarland University
Wojciech Rytter
Wojciech Rytter University of Warsaw
Hans L. Bodlaender
Hans L. Bodlaender Utrecht 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

When considering a future in Computer Science, it’s important to explore various academic options and how they align with your career ambitions. Many students look into the most useful graduate degrees to boost their job prospects and specialize in high-demand tech fields. Earning an advanced degree can lead to better salaries and leadership roles.

For those seeking flexibility or a quicker start, an associate's degree online offers foundational skills and is a great entry point before pursuing higher qualifications.

Affordability is also a major concern. Students can minimize their expenses by looking for cheap online colleges that provide strong Computer Science programs without a hefty price tag.

If you are worried about admissions requirements, there are also college that accepts low gpa options, making Computer Science education accessible to a wider range of learners. With these diverse pathways, anyone can pursue a successful tech career, regardless of their background or prior academic performance.

Best Scientists Citing Peter Rossmanith

Trending Scientists

Recently Published Articles