Peter Rossmanith

Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith: Recognition of probe distance-hereditary graphs. Discrete Applied Mathematics 161(3): 336-348 (2013)

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar: Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013)

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar: Evaluation of an MSO-Solver. ALENEX 2012: 55-63

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: 30-43

Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith: On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72

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: 326-337

Dániel Marx, Peter Rossmanith (Eds.): Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Lecture Notes in Computer Science 7112, Springer 2012, isbn 978-3-642-28049-8

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar: Linear Kernels on Graphs Excluding Topological Minors. CoRR abs/1201.2780 (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 abs/1207.0835 (2012)

Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61(4): 882-897 (2011)

Joachim Kneis, Alexander Langer, Peter Rossmanith: Courcelle's theorem - A game-theoretic approach. Discrete Optimization 8(4): 568-594 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)

Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith: A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49(3): 576-587 (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): 6290-6302 (2011)

Peter Rossmanith: Simulated Annealing. Algorithms Unplugged 2011: 393-400

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski: Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93

Alexander Langer, Peter Rossmanith, Somnath Sikdar: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC 2011: 505-516

Alexander Langer, Peter Rossmanith, Somnath Sikdar: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory. CoRR abs/1102.0908 (2011)

Joachim Kneis, Alexander Langer, Peter Rossmanith: Courcelle's Theorem - A Game-Theoretic Approach. CoRR abs/1104.3905 (2011)

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011)

Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith: New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. 47(2): 342-367 (2010)

Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith: Probe Distance-Hereditary Graphs. CATS 2010: 55-64

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith: A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. CIAC 2010: 311-322

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485 (2010)

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discrete Math. 23(1): 407-427 (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): 3428-3435 (2009)

Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith: Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR 2009: 299-309

Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577

Joachim Kneis, Alexander Langer, Peter Rossmanith: A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS 2009: 287-298

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: 161-172

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197

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 abs/0909.4224 (2009)

Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Theory Comput. Syst. 43(2): 234-253 (2008)

Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281

Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith: New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77

Joachim Kneis, Alexander Langer, Peter Rossmanith: Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251

Peter Rossmanith: Simulated Annealing. Taschenbuch der Algorithmen 2008: 423-431

Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang: Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. 41(3): 493-500 (2007)

Joachim Kneis, Daniel Mölle, Peter Rossmanith: Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006)

Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON 2006: 265-273

Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607

Daniel Mölle, Stefan Richter, Peter Rossmanith: A Faster Algorithm for the Steiner Tree Problem. STACS 2006: 561-570

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Divide-and-Color. WG 2006: 58-67

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396

Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003)

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130(2): 139-155 (2003)

Rolf Niedermeier, Peter Rossmanith: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2): 63-77 (2003)

Rolf Niedermeier, Peter Rossmanith: An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms 1(1): 89-102 (2003)

Peter Rossmanith, Thomas Zeugmann: Stochastic Finite Learning of the Pattern Languages. Machine Learning 44(1/2): 67-91 (2001)

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. 261(1): 119-156 (2001)

Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453

Javier Esparza, Peter Rossmanith, Stefan Schwoon: A Uniform Framework for Problems on Context-Free Grammars. Bulletin of the EATCS 72: 169-177 (2000)

Rolf Niedermeier, Peter Rossmanith: A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3-4): 125-129 (2000)

Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper: An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6): 221-227 (2000)

Rolf Niedermeier, Peter Rossmanith: New Upper Bounds for Maximum Satisfiability. J. Algorithms 36(1): 63-88 (2000)

Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon: Efficient Algorithms for Model Checking Pushdown Systems. CAV 2000: 232-247

Rolf Niedermeier, Peter Rossmanith: On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC 2000: 180-191

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC) 7(37) (2000)

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25(4): 438-458 (1999)

Peter Rossmanith: Learning from Random Text. ALT 1999: 132-144

Rolf Niedermeier, Peter Rossmanith: New Upper Bounds for MaxSat. ICALP 1999: 575-584

Rolf Niedermeier, Peter Rossmanith: Upper Bounds for Vertex Cover Further Improved. STACS 1999: 561-570

Rolf Niedermeier, Peter Rossmanith: Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. 194(1-2): 137-161 (1998)

Peter Rossmanith, Thomas Zeugmann: Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. ICGI 1998: 13-24

Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997)

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT 1997: 260-276

Javier Esparza, Peter Rossmanith: An Automata Approach to Some Problems on Context-Free Grammars. Foundations of Computer Science: Potential - Theory - Cognition 1997: 143-152

Rolf Niedermeier, Peter Rossmanith: Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits. Inf. Comput. 118(2): 227-245 (1995)

Rolf Niedermeier, Peter Rossmanith: On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Processing Letters 5: 299-309 (1995)

Rolf Niedermeier, Peter Rossmanith: PRAM's Towards Realistic Parallelism: BRAM's. FCT 1995: 363-373

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Average Case Sorting on Arrays. STACS 1995: 503-514

Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01 (1995)

Klaus-Jörn Lange, Peter Rossmanith: Unambiguous Polynomial Hierarchies and Exponential Size. Structure in Complexity Theory Conference 1994: 106-115

Manfred Kunde, Rolf Niedermeier, Peter Rossmanith: Faster Sorting and Routing on Grids with Diagonals. STACS 1994: 225-236

Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith: Deterministic OL Languages are of Very Low Complexity: DOL is in AC⁰. Developments in Language Theory 1993: 305-313

Rolf Niedermeier, Peter Rossmanith: On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC 1993: 240-249

Rolf Niedermeier, Peter Rossmanith: Extended Locally Definable Acceptance Types (Extended Abstract). STACS 1993: 473-483

Peter Rossmanith, Wojciech Rytter: Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. 44(5): 267-272 (1992)

Rolf Niedermeier, Peter Rossmanith: Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN 1992: 387-400

Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter: Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36

Klaus-Jörn Lange, Peter Rossmanith: The Emptiness Problem for Intersections of Regular Languages. MFCS 1992: 346-354

Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith: Unambiguity and Fewness for Logarithmic Space. FCT 1991: 168-179

Inga Niepel, Peter Rossmanith: Uniform Circuits and Exclusive Read PRAMs. FSTTCS 1991: 307-318

Peter Rossmanith: The Owner Concept for PRAMs. STACS 1991: 172-183

Klaus-Jörn Lange, Peter Rossmanith: Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS 1990: 399-406