default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Rossmanith
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Alexander Brenner
, Felix Knispel, Florian P. Fischer, Peter Rossmanith, Yvonne Weber, Henner Koch, Rainer Röhrig, Julian Varghese, Ekaterina Kutafina:
Concept-based AI interpretability in physiological time-series data: Example of abnormality detection in electroencephalography. Comput. Methods Programs Biomed. 257: 108448 (2024)- [j49]Fabian Frei, Peter Rossmanith:
Transformations of probability distributions. Theor. Comput. Sci. 1018: 114786 (2024) - [c77]Peter Rossmanith:
Computing itpre* for General Context Free Grammars. Taming the Infinities of Concurrency 2024: 255-280 - [c76]Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith:
Removable Online Knapsack and Advice. STACS 2024: 18:1-18:17 - [c75]Matthias Gehnen, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Bounded Predictions. STACS 2024: 37:1-37:20 - [c74]Daniel Mock, Peter Rossmanith:
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. SWAT 2024: 35:1-35:18 - [i35]Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker:
Tree Coloring: Random Order and Predictions. CoRR abs/2405.18151 (2024) - [i34]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - [i33]Javier Esparza, Peter Rossmanith, Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars. CoRR abs/2410.19386 (2024) - 2023
- [j48]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) - [c73]Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. COCOON (1) 2023: 371-383 - [c72]Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA 2023: 43:1-43:17 - [c71]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner:
Online Knapsack with Removal and Recourse. IWOCA 2023: 123-135 - [c70]Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Online Simple Knapsack Problem with Reservation and Removability. MFCS 2023: 29:1-29:12 - [i32]Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. CoRR abs/2307.01832 (2023) - [i31]Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. CoRR abs/2307.07284 (2023) - 2022
- [j47]Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of parameterized problems. Acta Informatica 59(4): 427-450 (2022) - [j46]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) - 2021
- [j45]Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83(9): 2719-2753 (2021) - [c69]Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Secretary Problem with Reservation Costs. COCOON 2021: 553-564 - [c68]Fabian Frei, Peter Rossmanith, David Wehner:
An Open Pouring Problem. FUN 2021: 14:1-14:9 - [c67]Elisabet Burjons, Peter Rossmanith:
Lower Bounds for Conjunctive and Disjunctive Turing Kernels. IPEC 2021: 12:1-12:17 - [c66]Jan Dreier, Peter Rossmanith:
Approximate Evaluation of First-Order Counting Queries. SODA 2021: 1720-1739 - [c65]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. STACS 2021: 16:1-16:18 - 2020
- [j44]Juraj Hromkovic, Peter Rossmanith:
What one has to know when attacking P vs. NP. J. Comput. Syst. Sci. 107: 142-155 (2020) - [c64]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. APPROX-RANDOM 2020: 14:1-14:13 - [c63]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
First-Order Model-Checking in Random Graphs and Complex Networks. ESA 2020: 40:1-40:23 - [c62]Jan Dreier, Henri Lotze, Peter Rossmanith:
Hard Problems on Random Graphs. ICALP 2020: 40:1-40:14 - [c61]Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA 2020: 140-153 - [c60]Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith:
Randomization in Non-Uniform Finite Automata. MFCS 2020: 30:1-30:13 - [i30]Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith:
Advice for Online Knapsack With Removable Items. CoRR abs/2005.01867 (2020) - [i29]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
First-Order Model-Checking in Random Graphs and Complex Networks. CoRR abs/2006.14488 (2020) - [i28]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. CoRR abs/2009.14043 (2020) - [i27]Jan Dreier, Peter Rossmanith:
Approximate Evaluation of First-Order Counting Queries. CoRR abs/2010.14814 (2020)
2010 – 2019
- 2019
- [j43]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: 199-241 (2019) - [c59]Jan Dreier, Peter Rossmanith:
Motif Counting in Preferential Attachment Graphs. FSTTCS 2019: 13:1-13:14 - [c58]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: 10:1-10:16 - [c57]Jan Dreier, Peter Rossmanith:
Hardness of FO Model-Checking on Random Graphs. IPEC 2019: 11:1-11:15 - [e2]Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen:
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. LIPIcs 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-117-7 [contents] - [i26]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. CoRR abs/1910.00440 (2019) - 2018
- [j42]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms 11(7): 98 (2018) - [j41]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: 114-125 (2018) - [j40]Peter Rossmanith:
MFCS 2019 - First Call for Papers. Bull. EATCS 126 (2018) - [c56]Peter Rossmanith:
On the Advice Complexity of Online Edge- and Node-Deletion Problems. Adventures Between Lower Bounds and Higher Altitudes 2018: 449-462 - [c55]Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith:
Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM 2018: 125-136 - [i25]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. CoRR abs/1803.11114 (2018) - [i24]Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle:
Fast Dynamic Programming on Graph Decompositions. CoRR abs/1806.01667 (2018) - [i23]Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of Parameterized Problems. CoRR abs/1809.10578 (2018) - 2017
- [j39]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: 219-242 (2017) - [c54]Juraj Hromkovic, Peter Rossmanith:
What One Has to Know When Attacking P vs. NP (Extended Abstract). FCT 2017: 11-28 - [c53]Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith:
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. ISAAC 2017: 20:1-20:13 - [i22]Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith:
Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. CoRR abs/1709.09152 (2017) - 2016
- [j38]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su:
Fixed-parameter algorithms for vertex cover P3. Discret. Optim. 19: 12-22 (2016) - [j37]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 B 116: 250-286 (2016) - [j36]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): 21:1-21:41 (2016) - [i21]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, depth and space. CoRR abs/1607.00945 (2016) - 2014
- [j35]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev. 13-14: 39-74 (2014) - [j34]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014) - [j33]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): 510-513 (2014) - [j32]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower bounds on the complexity of MSO1 model-checking. J. Comput. Syst. Sci. 80(1): 180-194 (2014) - [j31]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527: 61-72 (2014) - [c52]Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. ICALP (1) 2014: 931-942 - [c51]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: 258-269 - [i20]Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. CoRR abs/1401.7540 (2014) - [i19]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 abs/1406.2587 (2014) - [i18]Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Overlapping Communities in Social Networks. CoRR abs/1412.4973 (2014) - [i17]Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith:
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports 4(11): 1-21 (2014) - 2013
- [j30]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161(3): 336-348 (2013) - [j29]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. 113(22-24): 852-857 (2013) - [j28]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: 42-54 (2013) - [c50]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: 529-540 - [c49]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: 613-624 - [i16]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 abs/1302.6863 (2013) - 2012
- [c48]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Evaluation of an MSO-Solver. ALENEX 2012: 55-63 - [c47]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 - [c46]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - [c45]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 - [e1]Dániel Marx, Peter Rossmanith:
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 [contents] - [i15]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Linear Kernels on Graphs Excluding Topological Minors. CoRR abs/1201.2780 (2012) - [i14]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) - 2011
- [j27]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61(4): 882-897 (2011) - [j26]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's theorem - A game-theoretic approach. Discret. Optim. 8(4): 568-594 (2011) - [j25]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 9(3): 214-230 (2011) - [j24]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) - [j23]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) - [c44]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 - [c43]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 - [p2]Peter Rossmanith:
Simulated Annealing. Algorithms Unplugged 2011: 393-400 - [i13]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) - [i12]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's Theorem - A Game-Theoretic Approach. CoRR abs/1104.3905 (2011) - [i11]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) - 2010
- [j22]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) - [c42]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Probe Distance-Hereditary Graphs. CATS 2010: 55-64 - [c41]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: 311-322 - [c40]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 - [i10]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)
2000 – 2009
- 2009
- [j21]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): 407-427 (2009) - [j20]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) - [c39]Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR 2009: 299-309 - [c38]Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith:
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577 - [c37]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS 2009: 287-298 - [c36]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 - [c35]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [i9]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) - 2008
- [j19]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) - [c34]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281 - [c33]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77 - [c32]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251 - [p1]Peter Rossmanith:
Simulated Annealing. Taschenbuch der Algorithmen 2008: 423-431 - 2007
- [j18]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) - [c31]Joachim Kneis, Daniel Mölle, Peter Rossmanith:
Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376 - 2006
- [j17]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006) - [c30]Daniel Mölle, Stefan Richter, Peter Rossmanith:
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON 2006: 265-273 - [c29]Daniel Mölle, Stefan Richter, Peter Rossmanith:
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280 - [c28]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607 - [c27]