Peter Rossmanith
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
59
Venues
21
Active years
1990–2026
Best venue rank
A*
Where they publish
Papers
59 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SIROCCO | Cow Path by Finite Agent: Time vs Pebbles. | Stefan Dobrev, Rastislav Krlovic, Richard Krlovic, Dana Pardubsk, Peter Rossmanith |
| 2025 | MFCS | Solving Partial Dominating Set and Related Problems Using Twin-Width. | Jakub Balabn, Daniel Mock, Peter Rossmanith |
| 2024 | STACS | Removable Online Knapsack and Advice. | Hans-Joachim Bckenhauer, Fabian Frei, Peter Rossmanith |
| 2024 | STACS | Online Simple Knapsack with Bounded Predictions. | Matthias Gehnen, Henri Lotze, Peter Rossmanith |
| 2023 | COCOON | Delaying Decisions and Reservation Costs. | Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
| 2023 | ESA | Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. | Jan Dreier, Daniel Mock, Peter Rossmanith |
| 2023 | IWOCA | Online Knapsack with Removal and Recourse. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | MFCS | The Online Simple Knapsack Problem with Reservation and Removability. | Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
| 2021 | COCOON | The Secretary Problem with Reservation Costs. | Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
| 2021 | FUN | An Open Pouring Problem. | Fabian Frei, Peter Rossmanith, David Wehner |
| 2021 | SODA | Approximate Evaluation of First-Order Counting Queries. | Jan Dreier, Peter Rossmanith |
| 2021 | STACS | Online Simple Knapsack with Reservation Costs. | Hans-Joachim Bckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
| 2020 | ESA | First-Order Model-Checking in Random Graphs and Complex Networks. | Jan Dreier, Philipp Kuinke, Peter Rossmanith |
| 2020 | ICALP | Hard Problems on Random Graphs. | Jan Dreier, Henri Lotze, Peter Rossmanith |
| 2020 | IWOCA | Further Results on Online Node- and Edge-Deletion Problems with Advice. | Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith |
| 2020 | MFCS | Randomization in Non-Uniform Finite Automata. | Pavol Duris, Rastislav Krlovic, Richard Krlovic, Dana Pardubsk, Martin Pasen, Peter Rossmanith |
| 2018 | SOFSEM | Local Structure Theorems for Erdős-Rnyi Graphs and Their Algorithmic Applications. | Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith |
| 2017 | FCT | What One Has to Know When Attacking P vs. NP (Extended Abstract). | Juraj Hromkovic, Peter Rossmanith |
| 2017 | ISAAC | An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith |
| 2014 | ICALP | A Faster Parameterized Algorithm for Treedepth. | Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | ESA | Kernelization Using Structural Parameters on Sparse Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | ICALP | Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. | Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar |
| 2012 | ALENEX | Evaluation of an MSO-Solver. | Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar |
| 2012 | LATIN | On the Advice Complexity of the Knapsack Problem. | Hans-Joachim Bckenhauer, Dennis Komm, Richard Krlovic, Peter Rossmanith |
| 2012 | STACS | Lower Bounds on the Complexity of MSO_1 Model-Checking. | Robert Ganian, Petr Hlinen, Alexander Langer, Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar |
| 2011 | TAMC | Fast Exact Algorithm for | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2011 | TAMC | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
| 2010 | CIAC | A Parameterized Route to Exact Puzzles: Breaking the 2 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
| 2009 | CSR | Breaking Anonymity by Learning a Unique Minimum Hitting Set. | Dogan Kesdogan, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2009 | ESA | Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. | Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith |
| 2008 | ISAAC | A New Algorithm for Finding Trees with Many Leaves. | Joachim Kneis, Alexander Langer, Peter Rossmanith |
| 2008 | WG | Improved Upper Bounds for Partial Vertex Cover. | Joachim Kneis, Alexander Langer, Peter Rossmanith |
| 2007 | SOFSEM | Partial vs. Complete Domination: t-Dominating Set. | Joachim Kneis, Daniel Mlle, Peter Rossmanith |
| 2006 | COCOON | Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | CSR | Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | ISAAC | Intuitive Algorithms and t-Vertex Cover. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | STACS | A Faster Algorithm for the Steiner Tree Problem. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | WG | Divide-and-Color. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2005 | MFCS | On the Parameterized Complexity of Exact Satisfiability Problems. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2005 | WG | Algorithms Based on the Treewidth of Sparse Graphs. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2001 | ISAAC | Exact Solutions for CLOSEST STRING and Related Problems. | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
| 2000 | CAV | Efficient Algorithms for Model Checking Pushdown Systems. | Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon |
| 2000 | ISAAC | On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. | Rolf Niedermeier, Peter Rossmanith |
| 1999 | ALT | Learning from Random Text. | Peter Rossmanith |
| 1999 | ICALP | New Upper Bounds for MaxSat. | Rolf Niedermeier, Peter Rossmanith |
| 1999 | STACS | Upper Bounds for Vertex Cover Further Improved. | Rolf Niedermeier, Peter Rossmanith |
| 1997 | ALT | Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. | Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann |
| 1995 | FCT | PRAM's Towards Realistic Parallelism: BRAM's. | Rolf Niedermeier, Peter Rossmanith |
| 1995 | STACS | Optimal Average Case Sorting on Arrays. | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith |
| 1994 | STACS | Faster Sorting and Routing on Grids with Diagonals. | Manfred Kunde, Rolf Niedermeier, Peter Rossmanith |
| 1993 | DLT | Deterministic OL Languages are of Very Low Complexity: DOL is in AC | Carsten Damm, Markus Holzer, Klaus-Jrn Lange, Peter Rossmanith |
| 1993 | ISAAC | On the Power of Reading and Writing Simultaneously in Parallel Computation. | Rolf Niedermeier, Peter Rossmanith |
| 1993 | STACS | Extended Locally Definable Acceptance Types (Extended Abstract). | Rolf Niedermeier, Peter Rossmanith |
| 1992 | LATIN | Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). | Rolf Niedermeier, Peter Rossmanith |
| 1992 | MFCS | The Emptiness Problem for Intersections of Regular Languages. | Klaus-Jrn Lange, Peter Rossmanith |
| 1992 | MFCS | Parallel Recognition and Ranking of Context-Free Languages. | Klaus-Jrn Lange, Peter Rossmanith, Wojciech Rytter |
| 1991 | FCT | Unambiguity and Fewness for Logarithmic Space. | Gerhard Buntrock, Birgit Jenner, Klaus-Jrn Lange, Peter Rossmanith |
| 1991 | STACS | The Owner Concept for PRAMs. | Peter Rossmanith |
| 1990 | MFCS | Characterizing Unambiguous Augmented Pushdown Automata by Circuits. | Klaus-Jrn Lange, Peter Rossmanith |