Peter Rossmanith

174 papers A* 4A 15B 31C 6Misc 5Journal 91Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A survey of online knapsack problems. Discret. Appl. Math. Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Peter Rossmanith, Moritz Stocker
2026	J	`jnl`	Online knapsack with removal and recourse. J. Comput. Syst. Sci. Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2026	J	`jnl`	Tree coloring with predictions. Discret. Appl. Math. Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
2025	J	`jnl`	Online Unbounded Knapsack. Theory Comput. Syst. Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2025	B	`conf`	Solving Partial Dominating Set and Related Problems Using Twin-Width. MFCS Jakub Balabán, Daniel Mock, Peter Rossmanith
2025	J	`jnl`	Solving Partial Dominating Set and Related Problems Using Twin-Width. CoRR Jakub Balabán, Daniel Mock, Peter Rossmanith
2025	J	`jnl`	Uniform Universal Sets, Splitters, and Bisectors. CoRR Elisabet Burjons, Peter Rossmanith
2024	J	`jnl`	A Uniform Framework for Problems on Context-Free Grammars. CoRR Javier Esparza, Peter Rossmanith, Stefan Schwoon
2024	—	`conf`	Computing itpre Taming the Infinities of Concurrency Peter Rossmanith
2024	J	`jnl`	Concept-based AI interpretability in physiological time-series data: Example of abnormality detection in electroencephalography. Comput. Methods Programs Biomed. Alexander Brenner, Felix Knispel, Florian P. Fischer, Peter Rossmanith, Yvonne Weber, Henner Koch, Rainer Röhrig, Julian Varghese, Ekaterina Kutafina
2024	A	`conf`	Online Simple Knapsack with Bounded Predictions. STACS Matthias Gehnen, Henri Lotze, Peter Rossmanith
2024	J	`jnl`	Online Unbounded Knapsack. CoRR Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024	A	`conf`	Removable Online Knapsack and Advice. STACS Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
2024	—	`conf`	Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. SWAT Daniel Mock, Peter Rossmanith
2024	J	`jnl`	Transformations of probability distributions. Theor. Comput. Sci. Fabian Frei, Peter Rossmanith
2024	J	`jnl`	Tree Coloring: Random Order and Predictions. CoRR Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
2023	J	`jnl`	Corrigendum: Decoding neuropathic pain: Can we predict fluctuations of propagation speed in stimulated peripheral nerve? Frontiers Comput. Neurosci. Ekaterina Kutafina, Alina Troglio, Roberto de Col, Rainer Röhrig, Peter Rossmanith, Barbara Namer
2023	—	`conf`	Delaying Decisions and Reservation Costs. COCOON (1) Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
2023	J	`jnl`	Delaying Decisions and Reservation Costs. CoRR Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
2023	A	`conf`	Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA Jan Dreier, Daniel Mock, Peter Rossmanith
2023	J	`jnl`	Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. CoRR Jan Dreier, Daniel Mock, Peter Rossmanith
2023	C	`conf`	Online Knapsack with Removal and Recourse. IWOCA Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2023	B	`conf`	The Online Simple Knapsack Problem with Reservation and Removability. MFCS Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
2022	J	`jnl`	Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation Speed in Stimulated Peripheral Nerve? Frontiers Comput. Neurosci. Ekaterina Kutafina, Alina Troglio, Roberto de Col, Rainer Röhrig, Peter Rossmanith, Barbara Namer
2022	J	`jnl`	Reoptimization of parameterized problems. Acta Informatica Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
2021	Misc	`conf`	An Open Pouring Problem. FUN Fabian Frei, Peter Rossmanith, David Wehner
2021	A*	`conf`	Approximate Evaluation of First-Order Counting Queries. SODA Jan Dreier, Peter Rossmanith
2021	B	`conf`	Lower Bounds for Conjunctive and Disjunctive Turing Kernels. IPEC Elisabet Burjons, Peter Rossmanith
2021	J	`jnl`	Online Node- and Edge-Deletion Problems with Advice. Algorithmica Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
2021	A	`conf`	Online Simple Knapsack with Reservation Costs. STACS Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2021	Misc	`conf`	The Secretary Problem with Reservation Costs. COCOON Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
2020	J	`jnl`	Advice for Online Knapsack With Removable Items. CoRR Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith
2020	J	`jnl`	Approximate Evaluation of First-Order Counting Queries. CoRR Jan Dreier, Peter Rossmanith
2020	A	`conf`	First-Order Model-Checking in Random Graphs and Complex Networks. ESA Jan Dreier, Philipp Kuinke, Peter Rossmanith
2020	J	`jnl`	First-Order Model-Checking in Random Graphs and Complex Networks. CoRR Jan Dreier, Philipp Kuinke, Peter Rossmanith
2020	C	`conf`	Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
2020	A*	`conf`	Hard Problems on Random Graphs. ICALP Jan Dreier, Henri Lotze, Peter Rossmanith
2020	—	`conf`	Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. APPROX-RANDOM Jan Dreier, Philipp Kuinke, Peter Rossmanith
2020	J	`jnl`	Online Simple Knapsack with Reservation Costs. CoRR Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2020	B	`conf`	Randomization in Non-Uniform Finite Automata. MFCS Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
2020	J	`jnl`	What one has to know when attacking P vs. NP. J. Comput. Syst. Sci. Juraj Hromkovic, Peter Rossmanith
2019	B	`ed.`	44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26-30, 2019 MFCS Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen
2019	B	`conf`	Hardness of FO Model-Checking on Random Graphs. IPEC Jan Dreier, Peter Rossmanith
2019	—	`conf`	Motif Counting in Preferential Attachment Graphs. FSTTCS Jan Dreier, Peter Rossmanith
2019	J	`jnl`	Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2019	B	`conf`	The Complexity of Packing Edge-Disjoint Paths. IPEC Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
2019	J	`jnl`	The Complexity of Packing Edge-Disjoint Paths. CoRR Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
2018	J	`jnl`	Fast Dynamic Programming on Graph Decompositions. CoRR Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
2018	B	`conf`	Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
2018	J	`jnl`	MFCS 2019 - First Call for Papers. Bull. EATCS Peter Rossmanith
2018	J	`jnl`	Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
2018	—	`conf`	On the Advice Complexity of Online Edge- and Node-Deletion Problems. Adventures Between Lower Bounds and Higher Altitudes Peter Rossmanith
2018	J	`jnl`	Reoptimization of Parameterized Problems. CoRR Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
2018	J	`jnl`	The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. CoRR Jan Dreier, Philipp Kuinke, Peter Rossmanith
2018	J	`jnl`	Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil
2017	B	`conf`	An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. ISAAC Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith
2017	J	`jnl`	Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2017	J	`jnl`	Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. CoRR Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
2017	B	`conf`	What One Has to Know When Attacking P vs. NP (Extended Abstract). FCT Juraj Hromkovic, Peter Rossmanith
2016	J	`jnl`	Are there any good digraph width measures? J. Comb. Theory B Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2016	J	`jnl`	Fixed-parameter algorithms for vertex cover P Discret. Optim. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su
2016	J	`jnl`	Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2016	J	`jnl`	Width, depth and space. CoRR Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil
2014	—	`conf`	A Faster Parameterized Algorithm for Treedepth. ICALP (1) Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014	J	`jnl`	A Faster Parameterized Algorithm for Treedepth. CoRR Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014	J	`jnl`	Digraph width measures in parameterized algorithmics. Discret. Appl. Math. Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2014	J	`jnl`	Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
2014	B	`conf`	Finite Integer Index of Pathwidth and Treewidth. IPEC Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014	J	`jnl`	Lower bounds on the complexity of MSO J. Comput. Syst. Sci. Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014	J	`jnl`	Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith
2014	J	`jnl`	Overlapping Communities in Social Networks. CoRR Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2014	J	`jnl`	Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev. Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2014	J	`jnl`	Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2014	J	`jnl`	The online knapsack problem: Advice and randomization. Theor. Comput. Sci. Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
2013	J	`jnl`	Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2013	J	`jnl`	Kernelization Using Structural Parameters on Sparse Graph Classes CoRR Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013	A	`conf`	Kernelization Using Structural Parameters on Sparse Graph Classes. ESA Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013	—	`conf`	Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013	J	`jnl`	Recognition of probe distance-hereditary graphs. Discret. Appl. Math. Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
2013	J	`jnl`	Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2012	A	`conf`	Evaluation of an MSO-Solver. ALENEX Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012	J	`jnl`	Linear Kernels on Graphs Excluding Topological Minors CoRR Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012	J	`jnl`	Linear kernels and single-exponential algorithms via protrusion decompositions CoRR Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012	A	`conf`	Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2012	B	`conf`	On the Advice Complexity of the Knapsack Problem. LATIN Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
2012	—	`conf`	On the Power of Randomness versus Advice in Online Computation. Languages Alive Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
2012	B	`ed.`	Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers IPEC Dániel Marx, Peter Rossmanith
2011	J	`jnl`	A New Algorithm for Finding Trees with Many Leaves. Algorithmica Joachim Kneis, Alexander Langer, Peter Rossmanith
2011	J	`jnl`	A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2011	J	`jnl`	An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2011	J	`jnl`	Breaking the 2 J. Discrete Algorithms Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Courcelle's Theorem - A Game-Theoretic Approach CoRR Joachim Kneis, Alexander Langer, Peter Rossmanith
2011	J	`jnl`	Courcelle's theorem - A game-theoretic approach. Discret. Optim. Joachim Kneis, Alexander Langer, Peter Rossmanith
2011	C	`conf`	Fast Exact Algorithm for TAMC Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2011	J	`jnl`	Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory CoRR Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011	C	`conf`	Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011	J	`jnl`	Lower Bounds on the Complexity of MSO1 Model-Checking CoRR Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011	—	`ch.`	Simulated Annealing. Algorithms Unplugged Peter Rossmanith
2010	C	`conf`	A Parameterized Route to Exact Puzzles: Breaking the 2 CIAC Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
2010	B	`conf`	Are There Any Good Digraph Width Measures? IPEC Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010	J	`jnl`	Are there any good digraph width measures? CoRR Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010	J	`jnl`	New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2010	—	`conf`	Probe Distance-Hereditary Graphs. CATS Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
2009	J	`jnl`	A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discret. Math. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2009	—	`conf`	A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS Joachim Kneis, Alexander Langer, Peter Rossmanith
2009	—	`conf`	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	Misc	`conf`	Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith
2009	J	`jnl`	Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	A	`conf`	Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
2009	—	`conf`	On Digraph Width Measures in Parameterized Algorithmics. IWPEC Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2009	J	`jnl`	Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
2008	B	`conf`	A New Algorithm for Finding Trees with Many Leaves. ISAAC Joachim Kneis, Alexander Langer, Peter Rossmanith
2008	J	`jnl`	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Theory Comput. Syst. Daniel Mölle, Stefan Richter, Peter Rossmanith
2008	B	`conf`	Improved Upper Bounds for Partial Vertex Cover. WG Joachim Kneis, Alexander Langer, Peter Rossmanith
2008	—	`conf`	New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2008	—	`ch.`	Simulated Annealing. Taschenbuch der Algorithmen Peter Rossmanith
2007	J	`jnl`	Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang
2007	—	`conf`	Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) Joachim Kneis, Daniel Mölle, Peter Rossmanith
2006	A	`conf`	A Faster Algorithm for the Steiner Tree Problem. STACS Daniel Mölle, Stefan Richter, Peter Rossmanith
2006	B	`conf`	Divide-and-Color. WG Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2006	Misc	`conf`	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR Daniel Mölle, Stefan Richter, Peter Rossmanith
2006	Misc	`conf`	Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON Daniel Mölle, Stefan Richter, Peter Rossmanith
2006	B	`conf`	Intuitive Algorithms and t-Vertex Cover. ISAAC Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2006	J	`jnl`	Parameterized power domination complexity. Inf. Process. Lett. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2005	B	`conf`	Algorithms Based on the Treewidth of Sparse Graphs. WG Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2005	B	`conf`	On the Parameterized Complexity of Exact Satisfiability Problems. MFCS Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2003	J	`jnl`	An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms Rolf Niedermeier, Peter Rossmanith
2003	J	`jnl`	Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica Jens Gramm, Rolf Niedermeier, Peter Rossmanith
2003	J	`jnl`	On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms Rolf Niedermeier, Peter Rossmanith
2003	J	`jnl`	Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
2001	B	`conf`	Exact Solutions for CLOSEST STRING and Related Problems. ISAAC Jens Gramm, Rolf Niedermeier, Peter Rossmanith
2001	J	`jnl`	Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
2001	J	`jnl`	Stochastic Finite Learning of the Pattern Languages. Mach. Learn. Peter Rossmanith, Thomas Zeugmann
2000	J	`jnl`	A Uniform Framework for Problems on Context-Free Grammars. Bull. EATCS Javier Esparza, Peter Rossmanith, Stefan Schwoon
2000	J	`jnl`	A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. Rolf Niedermeier, Peter Rossmanith
2000	J	`jnl`	An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper
2000	A*	`conf`	Efficient Algorithms for Model Checking Pushdown Systems. CAV Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon
2000	J	`jnl`	New Upper Bounds for Maximum Satisfiability. J. Algorithms Rolf Niedermeier, Peter Rossmanith
2000	J	`jnl`	New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Electron. Colloquium Comput. Complex. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
2000	B	`conf`	On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC Rolf Niedermeier, Peter Rossmanith
1999	B	`conf`	Learning from Random Text. ALT Peter Rossmanith
1999	A*	`conf`	New Upper Bounds for MaxSat. ICALP Rolf Niedermeier, Peter Rossmanith
1999	J	`jnl`	Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1999	A	`conf`	Upper Bounds for Vertex Cover Further Improved. STACS Rolf Niedermeier, Peter Rossmanith
1998	—	`conf`	Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. ICGI Peter Rossmanith, Thomas Zeugmann
1998	J	`jnl`	Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. Rolf Niedermeier, Peter Rossmanith
1997	—	`conf`	An Automata Approach to Some Problems on Context-Free Grammars. Foundations of Computer Science: Potential - Theory - Cognition Javier Esparza, Peter Rossmanith
1997	J	`jnl`	Expressing Uniformity via Oracles. Theory Comput. Syst. Carsten Damm, Markus Holzer, Peter Rossmanith
1997	B	`conf`	Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
1995	J	`jnl`	Expressing Uniformity via Oracles Universität Trier, Mathematik/Informatik, Forschungsbericht Carsten Damm, Markus Holzer, Peter Rossmanith
1995	J	`jnl`	On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Process. Lett. Rolf Niedermeier, Peter Rossmanith
1995	A	`conf`	Optimal Average Case Sorting on Arrays. STACS Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1995	B	`conf`	PRAM's Towards Realistic Parallelism: BRAM's. FCT Rolf Niedermeier, Peter Rossmanith
1995	J	`jnl`	Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits Inf. Comput. Rolf Niedermeier, Peter Rossmanith
1994	—	`—`	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions. Peter Rossmanith
1994	A	`conf`	Faster Sorting and Routing on Grids with Diagonals. STACS Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
1994	—	`conf`	Unambiguous Polynomial Hierarchies and Exponential Size. SCT Klaus-Jörn Lange, Peter Rossmanith
1993	C	`conf`	Deterministic OL Languages are of Very Low Complexity: DOL is in AC Developments in Language Theory Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
1993	A	`conf`	Extended Locally Definable Acceptance Types (Extended Abstract). STACS Rolf Niedermeier, Peter Rossmanith
1993	J	`jnl`	Faster sorting and routing on grids with diagonals Forschungsberichte, TU Munich Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
1993	B	`conf`	On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC Rolf Niedermeier, Peter Rossmanith
1992	J	`jnl`	Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. Peter Rossmanith, Wojciech Rytter
1992	J	`jnl`	Optimal parallel algorithms for computing recursively defined functions Forschungsberichte, TU Munich Rolf Niedermeier, Peter Rossmanith
1992	B	`conf`	Parallel Recognition and Ranking of Context-Free Languages. MFCS Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
1992	B	`conf`	The Emptiness Problem for Intersections of Regular Languages. MFCS Klaus-Jörn Lange, Peter Rossmanith
1992	B	`conf`	Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN Rolf Niedermeier, Peter Rossmanith
1991	A	`conf`	The Owner Concept for PRAMs. STACS Peter Rossmanith
1991	B	`conf`	Unambiguity and Fewness for Logarithmic Space. FCT Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
1991	—	`conf`	Uniform Circuits and Exclusive Read PRAMs. FSTTCS Inga Niepel, Peter Rossmanith
1990	B	`conf`	Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS Klaus-Jörn Lange, Peter Rossmanith
1990	J	`jnl`	The owner concept for PRAMs Forschungsberichte, TU Munich Peter Rossmanith
1990	J	`jnl`	Two results on unambiguous circuits Forschungsberichte, TU Munich Klaus-Jörn Lange, Peter Rossmanith
1990	J	`jnl`	Unambiguous simulations of auxiliary pushdown automata and circuits Forschungsberichte, TU Munich Rolf Niedermeier, Peter Rossmanith
1990	J	`jnl`	Uniform circuits and exclusive read PRAMs Forschungsberichte, TU Munich Inga Niepel, Peter Rossmanith