| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar |
Linear Kernels on Graphs Excluding Topological Minors  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith |
On the Advice Complexity of the Knapsack Problem. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
IPEC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Courcelle's theorem - A game-theoretic approach. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A New Algorithm for Finding Trees with Many Leaves. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO1 Model-Checking |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Courcelle's Theorem - A Game-Theoretic Approach |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith |
A Property Tester for Tree-Likeness of Quartet Topologies. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 2n-barrier for Irredundance: Two lines of attack. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith |
Simulated Annealing. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith |
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 2n-Barrier for Irredundance. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Breaking Anonymity by Learning a Unique Minimum Hitting Set. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith |
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A Fine-grained Analysis of a Simple Independent Set Algorithm. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Mölle, Stefan Richter, Peter Rossmanith |
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity |
| 1 | Peter Rossmanith |
Simulated Annealing. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Improved Upper Bounds for Partial Vertex Cover. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith |
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A New Algorithm for Finding Trees with Many Leaves. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang |
Dynamic Programming for Minimum Steiner Trees. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Peter Rossmanith |
Partial vs. Complete Domination: t-Dominating Set. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Parameterized power domination complexity. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Mölle, Stefan Richter, Peter Rossmanith |
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Divide-and-Color. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Mölle, Stefan Richter, Peter Rossmanith |
A Faster Algorithm for the Steiner Tree Problem. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Mölle, Stefan Richter, Peter Rossmanith |
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Intuitive Algorithms and t-Vertex Cover. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Algorithms Based on the Treewidth of Sparse Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
On the Parameterized Complexity of Exact Satisfiability Problems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Consensus word analysis, NP-complete, Exact algorithms, Fixed-parameter tractability |
| 1 | Rolf Niedermeier, Peter Rossmanith |
On efficient fixed-parameter algorithms for weighted vertex cover. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
An efficient fixed-parameter algorithm for 3-Hitting Set. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith, Thomas Zeugmann |
Stochastic Finite Learning of the Pattern Languages. |
Machine Learning |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
Exact Solutions for CLOSEST STRING and Related Problems. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
A general method to speed up fixed-parameter-tractable algorithms. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
New Upper Bounds for Maximum Satisfiability. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Peter Rossmanith, Stefan Schwoon |
A Uniform Framework for Problems on Context-Free Grammars. |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon |
Efficient Algorithms for Model Checking Pushdown Systems. |
CAV |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith |
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
New Upper Bounds for MaxSat. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
Upper Bounds for Vertex Cover Further Improved. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith |
Learning from Random Text. |
ATL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
Unambiguous Computations and Locally Definable Acceptance Types. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith, Thomas Zeugmann |
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. |
ICGI |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Peter Rossmanith |
Expressing Uniformity via Oracles. |
Theory Comput. Syst. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Peter Rossmanith |
An Automata Approach to Some Problems on Context-Free Grammars. |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Peter Rossmanith |
Expressing Uniformity via Oracles |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. |
Parallel Processing Letters |
1995 |
DBLP BibTeX RDF |
|
| 1 | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith |
Optimal Average Case Sorting on Arrays. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
PRAM's Towards Realistic Parallelism: BRAM's. |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Kunde, Rolf Niedermeier, Peter Rossmanith |
Faster Sorting and Routing on Grids with Diagonals. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
Unambiguous Polynomial Hierarchies and Exponential Size. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
Extended Locally Definable Acceptance Types (Extended Abstract). |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith |
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. |
Developments in Language Theory |
1993 |
DBLP BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
On the Power of Reading and Writing Simultaneously in Parallel Computation. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith, Wojciech Rytter |
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter |
Parallel Recognition and Ranking of Context-Free Languages. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
The Emptiness Problem for Intersections of Regular Languages. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Peter Rossmanith |
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). |
LATIN |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith |
The Owner Concept for PRAMs. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith |
Unambiguity and Fewness for Logarithmic Space. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Inga Niepel, Peter Rossmanith |
Uniform Circuits and Exclusive Read PRAMs. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
Characterizing Unambiguous Augmented Pushdown Automata by Circuits. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")