Peter Rossmanith

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 52

Top Venues

CoRR

J. Comput. Syst. Sci.

IPEC

STACS

Technical University Munich, Germany (PHD)

Education History

Technical University Munich, Germany

PHD

Publications

Daniel Mock, Peter Rossmanith
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. SWAT (2024)
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
Online Unbounded Knapsack. CoRR (2024)
Peter Rossmanith
for General Context Free Grammars. Taming the Infinities of Concurrency (2024)
Matthias Gehnen, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Bounded Predictions. STACS (2024)
Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
Tree Coloring: Random Order and Predictions. CoRR (2024)
Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
Removable Online Knapsack and Advice. STACS (2024)
Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
Delaying Decisions and Reservation Costs. CoRR (2023)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
Online Knapsack with Removal and Recourse. IWOCA (2023)
Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
The Online Simple Knapsack Problem with Reservation and Removability. MFCS (2023)
Jan Dreier, Daniel Mock, Peter Rossmanith
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. CoRR (2023)
Ekaterina Kutafina, Alina Troglio, Roberto de Col, Rainer Röhrig, Peter Rossmanith, Barbara Namer
Corrigendum: Decoding neuropathic pain: Can we predict fluctuations of propagation speed in stimulated peripheral nerve? Frontiers Comput. Neurosci. 17 (2023)
Jan Dreier, Daniel Mock, Peter Rossmanith
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA (2023)
Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
Delaying Decisions and Reservation Costs. COCOON (1) (2023)
Ekaterina Kutafina, Alina Troglio, Roberto de Col, Rainer Röhrig, Peter Rossmanith, Barbara Namer
Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation Speed in Stimulated Peripheral Nerve? Frontiers Comput. Neurosci. 16 (2022)
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
Reoptimization of parameterized problems. Acta Informatica 59 (4) (2022)
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83 (9) (2021)
Elisabet Burjons, Peter Rossmanith
Lower Bounds for Conjunctive and Disjunctive Turing Kernels. IPEC (2021)
Fabian Frei, Peter Rossmanith, David Wehner
An Open Pouring Problem. FUN (2021)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. STACS (2021)
Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
The Secretary Problem with Reservation Costs. COCOON (2021)
Jan Dreier, Peter Rossmanith
Approximate Evaluation of First-Order Counting Queries. SODA (2021)
Jan Dreier, Henri Lotze, Peter Rossmanith
Hard Problems on Random Graphs. ICALP (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. APPROX-RANDOM (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
First-Order Model-Checking in Random Graphs and Complex Networks. ESA (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
First-Order Model-Checking in Random Graphs and Complex Networks. CoRR (2020)
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA (2020)
Juraj Hromkovic, Peter Rossmanith
What one has to know when attacking P vs. NP. J. Comput. Syst. Sci. 107 (2020)
Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
Randomization in Non-Uniform Finite Automata. MFCS (2020)
Jan Dreier, Peter Rossmanith
Approximate Evaluation of First-Order Counting Queries. CoRR (2020)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. CoRR (2020)
Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith
Advice for Online Knapsack With Removable Items. CoRR (2020)
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105 (2019)
Jan Dreier, Peter Rossmanith
Hardness of FO Model-Checking on Random Graphs. IPEC (2019)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. CoRR (2019)
Jan Dreier, Peter Rossmanith
Motif Counting in Preferential Attachment Graphs. FSTTCS (2019)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. IPEC (2019)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. 251 (2018)
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
Reoptimization of Parameterized Problems. CoRR (2018)
Peter Rossmanith
MFCS 2019 - First Call for Papers. Bull. EATCS 126 (2018)
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM (2018)
Peter Rossmanith
On the Advice Complexity of Online Edge- and Node-Deletion Problems. Adventures Between Lower Bounds and Higher Altitudes (2018)
Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms 11 (7) (2018)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. CoRR (2018)
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
Fast Dynamic Programming on Graph Decompositions. CoRR (2018)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. ISAAC (2017)
Juraj Hromkovic, Peter Rossmanith
What One Has to Know When Attacking P vs. NP (Extended Abstract). FCT (2017)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84 (2017)
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. CoRR (2017)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su
. Discret. Optim. 19 (2016)
Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil
Width, depth and space. CoRR (2016)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12 (2) (2016)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? J. Comb. Theory, Ser. B 116 (2016)
Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports 4 (11) (2014)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527 (2014)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
model-checking. J. Comput. Syst. Sci. 80 (1) (2014)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114 (9) (2014)
Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar
Overlapping Communities in Social Networks. CoRR (2014)
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR (2014)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168 (2014)
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Finite Integer Index of Pathwidth and Treewidth. IPEC (2014)
Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
A Faster Parameterized Algorithm for Treedepth. CoRR (2014)
Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
A Faster Parameterized Algorithm for Treedepth. ICALP (1) (2014)
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev. (2014)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. 113 (22-24) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes CoRR (2013)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) (2013)
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. 505 (2013)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161 (3) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA (2013)
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
Linear Kernels on Graphs Excluding Topological Minors CoRR (2012)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
On the Power of Randomness versus Advice in Online Computation. Languages Alive (2012)
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
Evaluation of an MSO-Solver. ALENEX (2012)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
On the Advice Complexity of the Knapsack Problem. LATIN (2012)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS (2012)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear kernels and single-exponential algorithms via protrusion decompositions CoRR (2012)
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9 (3) (2011)
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
(2, 1)-Labeling of Graphs. TAMC (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Courcelle's theorem - A game-theoretic approach. Discret. Optim. 8 (4) (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Courcelle's Theorem - A Game-Theoretic Approach CoRR (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61 (4) (2011)
Alexander Langer, Peter Rossmanith, Somnath Sikdar
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory CoRR (2011)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Lower Bounds on the Complexity of MSO1 Model-Checking CoRR (2011)
Alexander Langer, Peter Rossmanith, Somnath Sikdar
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC (2011)
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412 (45) (2011)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49 (3) (2011)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. 47 (2) (2010)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Probe Distance-Hereditary Graphs. CATS (2010)
Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
-Barrier for Irredundance. CIAC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are There Any Good Digraph Width Measures? IPEC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? CoRR (2010)
Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA (2009)
Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR (2009)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS (2009)
Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith
Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410 (36) (2009)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discret. Math. 23 (1) (2009)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
On Digraph Width Measures in Parameterized Algorithmics. IWPEC (2009)
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC (2009)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Improved Upper Bounds for Partial Vertex Cover. WG (2008)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A New Algorithm for Finding Trees with Many Leaves. ISAAC (2008)

Peter Rossmanith.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Rossmanith