A survey of online knapsack problems.

Peter Rossmanith RWTH Aachen University, Germany http://www-lti.informatik.rwth-aachen.de/~rossmani/ https://orcid.org/0000-0003-0177-8028

Hans-Joachim Böckenhauer Juraj Hromkovic Dennis Komm Peter Rossmanith Moritz Stocker A survey of online knapsack problems. 492-507 2026 378 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.08.011 db/journals/dam/dam378.html#BockenhauerHKRS26 streams/journals/dam

Fabian Frei Matthias Gehnen Dennis Komm Rastislav Královic Richard Královic Peter Rossmanith Moritz Stocker Tree coloring with predictions. 386-394 2026 380 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.10.024 db/journals/dam/dam380.html#FreiGKKKRS26 streams/journals/dam

Hans-Joachim Böckenhauer Ralf Klasing Tobias Mömke Peter Rossmanith Moritz Stocker David Wehner Online knapsack with removal and recourse. 103697 2026 155 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2025.103697 db/journals/jcss/jcss155.html#BockenhauerKMRSW26 streams/journals/jcss

Hans-Joachim Böckenhauer Matthias Gehnen Juraj Hromkovic Ralf Klasing Dennis Komm Henri Lotze Daniel Mock Peter Rossmanith Moritz Stocker Online Unbounded Knapsack. 14 2025 March 69 Theory Comput. Syst. 1 https://doi.org/10.1007/s00224-025-10215-0 db/journals/mst/mst69.html#BockenhauerGHKKLMRS25 streams/journals/mst

Jakub Balabán Daniel Mock Peter Rossmanith Solving Partial Dominating Set and Related Problems Using Twin-Width. 13:1-13:19 2025 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2025.13 conf/mfcs/2025 db/conf/mfcs/mfcs2025.html#BalabanMR25

Jakub Balabán Daniel Mock Peter Rossmanith Solving Partial Dominating Set and Related Problems Using Twin-Width. 2025 April abs/2504.18218 CoRR https://doi.org/10.48550/arXiv.2504.18218 db/journals/corr/corr2504.html#abs-2504-18218 streams/journals/corr

Elisabet Burjons Peter Rossmanith Uniform Universal Sets, Splitters, and Bisectors. 2025 May abs/2505.08308 CoRR https://doi.org/10.48550/arXiv.2505.08308 db/journals/corr/corr2505.html#abs-2505-08308 streams/journals/corr

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. 108448 2024 257 Comput. Methods Programs Biomed. https://doi.org/10.1016/j.cmpb.2024.108448 db/journals/cmpb/cmpb257.html#BrennerKFRWKRVK24 streams/journals/cmpb

Fabian Frei Peter Rossmanith Transformations of probability distributions. 114786 2024 1018 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2024.114786 db/journals/tcs/tcs1018.html#FreiR24 streams/journals/tcs

Peter Rossmanith Computing itpre* for General Context Free Grammars. 255-280 2024 Taming the Infinities of Concurrency https://doi.org/10.1007/978-3-031-56222-8_15 conf/birthday/2024esparza db/conf/birthday/esparza2024.html#Rossmanith24 Hans-Joachim Böckenhauer Fabian Frei Peter Rossmanith Removable Online Knapsack and Advice. 18:1-18:17 2024 STACS https://doi.org/10.4230/LIPIcs.STACS.2024.18 conf/stacs/2024 db/conf/stacs/stacs2024.html#BockenhauerFR24 Matthias Gehnen Henri Lotze Peter Rossmanith Online Simple Knapsack with Bounded Predictions. 37:1-37:20 2024 STACS https://doi.org/10.4230/LIPIcs.STACS.2024.37 conf/stacs/2024 db/conf/stacs/stacs2024.html#GehnenLR24 Daniel Mock Peter Rossmanith Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. 35:1-35:18 2024 SWAT https://doi.org/10.4230/LIPIcs.SWAT.2024.35 conf/swat/2024 db/conf/swat/swat2024.html#MockR24

Fabian Frei Matthias Gehnen Dennis Komm Rastislav Královic Richard Královic Peter Rossmanith Moritz Stocker Tree Coloring: Random Order and Predictions. 2024 abs/2405.18151 CoRR https://doi.org/10.48550/arXiv.2405.18151 db/journals/corr/corr2405.html#abs-2405-18151

Hans-Joachim Böckenhauer Matthias Gehnen Juraj Hromkovic Ralf Klasing Dennis Komm Henri Lotze Daniel Mock Peter Rossmanith Moritz Stocker Online Unbounded Knapsack. 2024 abs/2407.02045 CoRR https://doi.org/10.48550/arXiv.2407.02045 db/journals/corr/corr2407.html#abs-2407-02045 streams/journals/corr

Javier Esparza Peter Rossmanith Stefan Schwoon A Uniform Framework for Problems on Context-Free Grammars. 2024 abs/2410.19386 CoRR https://doi.org/10.48550/arXiv.2410.19386 db/journals/corr/corr2410.html#abs-2410-19386 streams/journals/corr

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? 2023 February 17 Frontiers Comput. Neurosci. https://doi.org/10.3389/fncom.2023.1149849 db/journals/ficn/ficn17.html#KutafinaTCRRN23

Elisabet Burjons Fabian Frei Matthias Gehnen Henri Lotze Daniel Mock Peter Rossmanith Delaying Decisions and Reservation Costs. 371-383 2023 COCOON (1) https://doi.org/10.1007/978-3-031-49190-0_27 conf/cocoon/2023-1 db/conf/cocoon/cocoon2023-1.html#BurjonsFGLMR23 Jan Dreier Daniel Mock Peter Rossmanith Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. 43:1-43:17 2023 ESA https://doi.org/10.4230/LIPIcs.ESA.2023.43 conf/esa/2023 db/conf/esa/esa2023.html#DreierMR23 Hans-Joachim Böckenhauer Ralf Klasing Tobias Mömke Peter Rossmanith Moritz Stocker David Wehner Online Knapsack with Removal and Recourse. 123-135 2023 IWOCA https://doi.org/10.1007/978-3-031-34347-6_11 conf/iwoca/2023 db/conf/iwoca/iwoca2023.html#BockenhauerKMRS23 Elisabet Burjons Matthias Gehnen Henri Lotze Daniel Mock Peter Rossmanith The Online Simple Knapsack Problem with Reservation and Removability. 29:1-29:12 2023 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2023.29 conf/mfcs/2023 db/conf/mfcs/mfcs2023.html#BurjonsGLMR23

Jan Dreier Daniel Mock Peter Rossmanith Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. 2023 abs/2307.01832 CoRR https://doi.org/10.48550/arXiv.2307.01832 db/journals/corr/corr2307.html#abs-2307-01832

Elisabet Burjons Fabian Frei Matthias Gehnen Henri Lotze Daniel Mock Peter Rossmanith Delaying Decisions and Reservation Costs. 2023 abs/2307.07284 CoRR https://doi.org/10.48550/arXiv.2307.07284 db/journals/corr/corr2307.html#abs-2307-07284

Hans-Joachim Böckenhauer Elisabet Burjons Martin Raszyk Peter Rossmanith Reoptimization of parameterized problems. 427-450 2022 59 Acta Informatica 4 https://doi.org/10.1007/s00236-022-00428-y db/journals/acta/acta59.html#BockenhauerBRR22

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? 2022 16 Frontiers Comput. Neurosci. https://doi.org/10.3389/fncom.2022.899584 db/journals/ficn/ficn16.html#KutafinaTCRRN22

Li-Hsuan Chen Ling-Ju Hung Henri Lotze Peter Rossmanith Online Node- and Edge-Deletion Problems with Advice. 2719-2753 2021 83 Algorithmica 9 https://doi.org/10.1007/s00453-021-00840-9 db/journals/algorithmica/algorithmica83.html#ChenHLR21

Elisabet Burjons Matthias Gehnen Henri Lotze Daniel Mock Peter Rossmanith The Secretary Problem with Reservation Costs. 553-564 2021 COCOON https://doi.org/10.1007/978-3-030-89543-3_46 conf/cocoon/2021 db/conf/cocoon/cocoon2021.html#BurjonsGLMR21 Fabian Frei Peter Rossmanith David Wehner An Open Pouring Problem. 14:1-14:9 2021 FUN https://doi.org/10.4230/LIPIcs.FUN.2021.14 conf/fun/2021 db/conf/fun/fun2021.html#FreiRW21 Elisabet Burjons Peter Rossmanith Lower Bounds for Conjunctive and Disjunctive Turing Kernels. 12:1-12:17 2021 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2021.12 conf/iwpec/2021 db/conf/iwpec/ipec2021.html#BurjonsR21 Jan Dreier Peter Rossmanith Approximate Evaluation of First-Order Counting Queries. 1720-1739 2021 SODA https://doi.org/10.1137/1.9781611976465.104 conf/soda/2021 db/conf/soda/soda2021.html#DreierR21 Hans-Joachim Böckenhauer Elisabet Burjons Juraj Hromkovic Henri Lotze Peter Rossmanith Online Simple Knapsack with Reservation Costs. 16:1-16:18 2021 STACS https://doi.org/10.4230/LIPIcs.STACS.2021.16 conf/stacs/2021 db/conf/stacs/stacs2021.html#BockenhauerBHLR21

Juraj Hromkovic Peter Rossmanith What one has to know when attacking P vs. NP. 142-155 2020 107 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2019.06.004 db/journals/jcss/jcss107.html#HromkovicR20

Jan Dreier Philipp Kuinke Peter Rossmanith Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. 14:1-14:13 2020 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.14 conf/approx/2020 db/conf/approx/approx2020.html#DreierKR20 Jan Dreier Philipp Kuinke Peter Rossmanith First-Order Model-Checking in Random Graphs and Complex Networks. 40:1-40:23 2020 ESA https://doi.org/10.4230/LIPIcs.ESA.2020.40 conf/esa/2020 db/conf/esa/esa2020.html#DreierKR20 Jan Dreier Henri Lotze Peter Rossmanith Hard Problems on Random Graphs. 40:1-40:14 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.40 conf/icalp/2020 db/conf/icalp/icalp2020.html#DreierLR20 Li-Hsuan Chen Ling-Ju Hung Henri Lotze Peter Rossmanith Further Results on Online Node- and Edge-Deletion Problems with Advice. 140-153 2020 IWOCA https://doi.org/10.1007/978-3-030-48966-3_11 conf/iwoca/2020 db/conf/iwoca/iwoca2020.html#ChenHLR20 Pavol Duris Rastislav Královic Richard Královic Dana Pardubská Martin Pasen Peter Rossmanith Randomization in Non-Uniform Finite Automata. 30:1-30:13 2020 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2020.30 conf/mfcs/2020 db/conf/mfcs/mfcs2020.html#DurisKKPPR20

Hans-Joachim Böckenhauer Jan Dreier Fabian Frei Peter Rossmanith Advice for Online Knapsack With Removable Items. 2020 abs/2005.01867 CoRR https://arxiv.org/abs/2005.01867 db/journals/corr/corr2005.html#abs-2005-01867

Jan Dreier Philipp Kuinke Peter Rossmanith First-Order Model-Checking in Random Graphs and Complex Networks. 2020 abs/2006.14488 CoRR https://arxiv.org/abs/2006.14488 db/journals/corr/corr2006.html#abs-2006-14488

Hans-Joachim Böckenhauer Elisabet Burjons Juraj Hromkovic Henri Lotze Peter Rossmanith Online Simple Knapsack with Reservation Costs. 2020 abs/2009.14043 CoRR https://arxiv.org/abs/2009.14043 db/journals/corr/corr2009.html#abs-2009-14043

Jan Dreier Peter Rossmanith Approximate Evaluation of First-Order Counting Queries. 2020 abs/2010.14814 CoRR https://arxiv.org/abs/2010.14814 db/journals/corr/corr2010.html#abs-2010-14814

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. 199-241 2019 105 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2019.05.004 https://www.wikidata.org/entity/Q127822932 db/journals/jcss/jcss105.html#DemaineRRVSS19

Jan Dreier Peter Rossmanith Motif Counting in Preferential Attachment Graphs. 13:1-13:14 2019 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2019.13 conf/fsttcs/2019 db/conf/fsttcs/fsttcs2019.html#DreierR19 Jan Dreier Janosch Fuchs Tim A. Hartmann Philipp Kuinke Peter Rossmanith Bjoern Tauer Hung-Lung Wang The Complexity of Packing Edge-Disjoint Paths. 10:1-10:16 2019 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2019.10 conf/iwpec/2019 db/conf/iwpec/ipec2019.html#DreierFHKRTW19 Jan Dreier Peter Rossmanith Hardness of FO Model-Checking on Random Graphs. 11:1-11:15 2019 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2019.11 conf/iwpec/2019 db/conf/iwpec/ipec2019.html#DreierR19 Peter Rossmanith Pinar Heggernes Joost-Pieter Katoen 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26-30, 2019 MFCS Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019 LIPIcs 138 978-3-95977-117-7 http://www.dagstuhl.de/dagpub/978-3-95977-117-7 db/conf/mfcs/mfcs2019.html

Jan Dreier Janosch Fuchs Tim A. Hartmann Philipp Kuinke Peter Rossmanith Bjoern Tauer Hung-Lung Wang The Complexity of Packing Edge-Disjoint Paths. 2019 abs/1910.00440 CoRR http://arxiv.org/abs/1910.00440 db/journals/corr/corr1910.html#abs-1910-00440

Li-Hsuan Chen Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. 98 2018 11 Algorithms 7 https://doi.org/10.3390/a11070098 https://www.wikidata.org/entity/Q129599117 db/journals/algorithms/algorithms11.html#ChenRRV18

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. 114-125 2018 251 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.05.032 https://www.wikidata.org/entity/Q115577869 db/journals/dam/dam251.html#ChangCHLRS18

Peter Rossmanith MFCS 2019 - First Call for Papers. 2018 126 Bull. EATCS http://bulletin.eatcs.org/index.php/beatcs/article/view/559/557 db/journals/eatcs/eatcs126.html#Rossmanith18

Peter Rossmanith On the Advice Complexity of Online Edge- and Node-Deletion Problems. 449-462 2018 Adventures Between Lower Bounds and Higher Altitudes https://doi.org/10.1007/978-3-319-98355-4_26 conf/birthday/2018hromkovic db/conf/birthday/hromkovic2018.html#Rossmanith18 Jan Dreier Philipp Kuinke Ba Le Xuan Peter Rossmanith Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. 125-136 2018 SOFSEM https://doi.org/10.1007/978-3-319-73117-9_9 conf/sofsem/2018 db/conf/sofsem/sofsem2018.html#DreierKXR18

Jan Dreier Philipp Kuinke Peter Rossmanith The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. 2018 abs/1803.11114 CoRR http://arxiv.org/abs/1803.11114 db/journals/corr/corr1803.html#abs-1803-11114

Johan M. M. van Rooij Hans L. Bodlaender Erik Jan van Leeuwen Peter Rossmanith Martin Vatshelle Fast Dynamic Programming on Graph Decompositions. 2018 abs/1806.01667 CoRR http://arxiv.org/abs/1806.01667 db/journals/corr/corr1806.html#abs-1806-01667

Hans-Joachim Böckenhauer Elisabet Burjons Martin Raszyk Peter Rossmanith Reoptimization of Parameterized Problems. 2018 abs/1809.10578 CoRR http://arxiv.org/abs/1809.10578 db/journals/corr/corr1809.html#abs-1809-10578

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. 219-242 2017 84 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2016.09.002 db/journals/jcss/jcss84.html#GajarskyHOORRVS17

Juraj Hromkovic Peter Rossmanith What One Has to Know When Attacking P vs. NP (Extended Abstract). 11-28 2017 FCT https://doi.org/10.1007/978-3-662-55751-8_2 conf/fct/2017 db/conf/fct/fct2017.html#HromkovicR17 Li-Hsuan Chen Sun-Yuan Hsieh Ling-Ju Hung Peter Rossmanith An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. 20:1-20:13 2017 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2017.20 conf/isaac/2017 db/conf/isaac/isaac2017.html#ChenHHR17

Jan Dreier Philipp Kuinke Ba Le Xuan Peter Rossmanith Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. 2017 abs/1709.09152 CoRR http://arxiv.org/abs/1709.09152 db/journals/corr/corr1709.html#abs-1709-09152

Maw-Shang Chang Li-Hsuan Chen Ling-Ju Hung Peter Rossmanith Ping-Chen Su Fixed-parameter algorithms for vertex cover P3. 12-22 2016 19 Discret. Optim. https://doi.org/10.1016/j.disopt.2015.11.003 db/journals/disopt/disopt19.html#ChangCHRS16

Robert Ganian Petr Hlinený Joachim Kneis Daniel Meister 0001 Jan Obdrzálek Peter Rossmanith Somnath Sikdar Are there any good digraph width measures? 250-286 2016 116 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2015.09.001 db/journals/jct/jctb116.html#GanianHK0ORS16

Eun Jung Kim 0002 Alexander Langer Christophe Paul Felix Reidl Peter Rossmanith Ignasi Sau Somnath Sikdar Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. 21:1-21:41 2016 12 ACM Trans. Algorithms 2 https://doi.org/10.1145/2797140 db/journals/talg/talg12.html#0002LPRRSS16

Li-Hsuan Chen Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Width, depth and space. 2016 abs/1607.00945 CoRR http://arxiv.org/abs/1607.00945 db/journals/corr/corr1607.html#ChenRRV16

Alexander Langer Felix Reidl Peter Rossmanith Somnath Sikdar Practical algorithms for MSO model-checking on tree-decomposable graphs. 39-74 2014 13-14 Comput. Sci. Rev. https://doi.org/10.1016/j.cosrev.2014.08.001 db/journals/csr/csr13.html#LangerRRS14

Robert Ganian Petr Hlinený Joachim Kneis Alexander Langer Jan Obdrzálek Peter Rossmanith Digraph width measures in parameterized algorithmics. 88-107 2014 168 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.10.038 db/journals/dam/dam168.html#GanianHKLOR14

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. 510-513 2014 114 Inf. Process. Lett. 9 https://doi.org/10.1016/j.ipl.2014.04.009 db/journals/ipl/ipl114.html#ChangCHRW14

Robert Ganian Petr Hlinený Alexander Langer Jan Obdrzálek Peter Rossmanith Somnath Sikdar Lower bounds on the complexity of MSO1 model-checking. 180-194 2014 80 J. Comput. Syst. Sci. 1 https://doi.org/10.1016/j.jcss.2013.07.005 db/journals/jcss/jcss80.html#GanianHLORS14

Hans-Joachim Böckenhauer Dennis Komm Richard Královic Peter Rossmanith The online knapsack problem: Advice and randomization. 61-72 2014 527 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2014.01.027 db/journals/tcs/tcs527.html#BockenhauerKKR14

Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar A Faster Parameterized Algorithm for Treedepth. 931-942 2014 ICALP (1) https://doi.org/10.1007/978-3-662-43948-7_77 conf/icalp/2014-1 db/conf/icalp/icalp2014-1.html#ReidlRVS14 Jakub Gajarský Jan Obdrzálek Sebastian Ordyniak Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar Finite Integer Index of Pathwidth and Treewidth. 258-269 2014 IPEC https://doi.org/10.1007/978-3-319-13524-3_22 conf/iwpec/2014 db/conf/iwpec/ipec2014.html#GajarskyOORRVS14

Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar A Faster Parameterized Algorithm for Treedepth. 2014 abs/1401.7540 CoRR http://arxiv.org/abs/1401.7540 db/journals/corr/corr1401.html#ReidlRVS14

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. 2014 abs/1406.2587 CoRR http://arxiv.org/abs/1406.2587 db/journals/corr/corr1406.html#DemaineRRVSS14

Jan Dreier Philipp Kuinke Rafael Przybylski Felix Reidl Peter Rossmanith Somnath Sikdar Overlapping Communities in Social Networks. 2014 abs/1412.4973 CoRR http://arxiv.org/abs/1412.4973 db/journals/corr/corr1412.html#DreierKPRRS14

Stefan Kratsch Daniel Lokshtanov Dániel Marx Peter Rossmanith Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). 1-21 2014 4 Dagstuhl Reports 11 https://doi.org/10.4230/DagRep.4.11.1 db/journals/dagstuhl-reports/dagstuhl-reports4.html#KratschLMR14

Maw-Shang Chang Ling-Ju Hung Peter Rossmanith Recognition of probe distance-hereditary graphs. 336-348 2013 161 Discret. Appl. Math. 3 https://doi.org/10.1016/j.dam.2012.08.029 db/journals/dam/dam161.html#ChangHR13

Maw-Shang Chang Chuang-Chieh Lin Peter Rossmanith Testing consistency of quartet topologies: a parameterized approach. 852-857 2013 113 Inf. Process. Lett. 22-24 https://doi.org/10.1016/j.ipl.2013.08.006 db/journals/ipl/ipl113.html#ChangLR13

Konstanty Junosza-Szaniawski Jan Kratochvíl Mathieu Liedloff Peter Rossmanith Pawel Rzazewski Fast exact algorithm for L(2, 1)-labeling of graphs. 42-54 2013 505 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.06.037 https://www.wikidata.org/entity/Q62595918 db/journals/tcs/tcs505.html#Junosza-SzaniawskiKLRR13

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. 529-540 2013 ESA https://doi.org/10.1007/978-3-642-40450-4_45 conf/esa/2013 db/conf/esa/esa2013.html#GajarskyHOORRVS13 Eun Jung Kim 0002 Alexander Langer Christophe Paul Felix Reidl Peter Rossmanith Ignasi Sau Somnath Sikdar Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. 613-624 2013 ICALP (1) https://doi.org/10.1007/978-3-642-39206-1_52 conf/icalp/2013-1 db/conf/icalp/icalp2013-1.html#0002LPRRSS13

Alexander Langer Felix Reidl Peter Rossmanith Somnath Sikdar Evaluation of an MSO-Solver. 55-63 2012 ALENEX https://doi.org/10.1137/1.9781611972924.5 conf/alenex/2012 db/conf/alenex/alenex2012.html#LangerRRS12 Hans-Joachim Böckenhauer Juraj Hromkovic Dennis Komm Richard Královic Peter Rossmanith On the Power of Randomness versus Advice in Online Computation. 30-43 2012 Languages Alive https://doi.org/10.1007/978-3-642-31644-9_2 conf/birthday/2012dassow db/conf/birthday/dassow2012.html#BockenhauerHKKR12 Hans-Joachim Böckenhauer Dennis Komm Richard Královic Peter Rossmanith On the Advice Complexity of the Knapsack Problem. 61-72 2012 LATIN https://doi.org/10.1007/978-3-642-29344-3_6 conf/latin/2012 db/conf/latin/latin2012.html#BockenhauerKKR12 Robert Ganian Petr Hlinený Alexander Langer Jan Obdrzálek Peter Rossmanith Somnath Sikdar Lower Bounds on the Complexity of MSO_1 Model-Checking. 326-337 2012 STACS https://doi.org/10.4230/LIPIcs.STACS.2012.326 conf/stacs/2012 db/conf/stacs/stacs2012.html#GanianHLOR12 Dániel Marx Peter Rossmanith Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers 7112 2012 Springer Lecture Notes in Computer Science https://doi.org/10.1007/978-3-642-28050-4 978-3-642-28049-8 IPEC db/conf/iwpec/ipec2011.html

Alexander Langer Felix Reidl Peter Rossmanith Somnath Sikdar Linear Kernels on Graphs Excluding Topological Minors http://arxiv.org/abs/1201.2780 2012 CoRR abs/1201.2780 db/journals/corr/corr1201.html#abs-1201-2780

Eun Jung Kim 0002 Alexander Langer Christophe Paul Felix Reidl Peter Rossmanith Ignasi Sau Somnath Sikdar Linear kernels and single-exponential algorithms via protrusion decompositions http://arxiv.org/abs/1207.0835 2012 CoRR abs/1207.0835 db/journals/corr/corr1207.html#abs-1207-0835

Joachim Kneis Alexander Langer Peter Rossmanith A New Algorithm for Finding Trees with Many Leaves. 882-897 2011 61 Algorithmica 4 https://doi.org/10.1007/s00453-010-9454-5 db/journals/algorithmica/algorithmica61.html#KneisLR11

Joachim Kneis Alexander Langer Peter Rossmanith Courcelle's theorem - A game-theoretic approach. 568-594 2011 8 Discret. Optim. 4 https://doi.org/10.1016/j.disopt.2011.06.001 db/journals/disopt/disopt8.html#KneisLR11

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. 214-230 2011 9 J. Discrete Algorithms 3 https://doi.org/10.1016/j.jda.2011.03.002 db/journals/jda/jda9.html#Binkele-RaibleBCFKKLLPRW11

Maw-Shang Chang Chuang-Chieh Lin Peter Rossmanith A Property Tester for Tree-Likeness of Quartet Topologies. 576-587 2011 49 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-010-9276-5 db/journals/mst/mst49.html#ChangLR11

Henning Fernau Joachim Kneis Dieter Kratsch Alexander Langer Mathieu Liedloff Daniel Raible 0001 Peter Rossmanith An exact algorithm for the Maximum Leaf Spanning Tree problem. 6290-6302 2011 412 Theor. Comput. Sci. 45 https://doi.org/10.1016/j.tcs.2011.07.011 https://www.wikidata.org/entity/Q59442095 db/journals/tcs/tcs412.html#FernauKKLLRR11

Konstanty Junosza-Szaniawski Jan Kratochvíl Mathieu Liedloff Peter Rossmanith Pawel Rzazewski Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. 82-93 2011 TAMC https://doi.org/10.1007/978-3-642-20877-5_9 conf/tamc/2011 db/conf/tamc/tamc2011.html#Junosza-SzaniawskiKLRR11 Alexander Langer Peter Rossmanith Somnath Sikdar Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). 505-516 2011 TAMC https://doi.org/10.1007/978-3-642-20877-5_49 conf/tamc/2011 db/conf/tamc/tamc2011.html#LangerRS11 Peter Rossmanith Simulated Annealing. 393-400 2011 Algorithms Unplugged https://doi.org/10.1007/978-3-642-15328-0_41 books/sp/voecking11 db/books/collections/Voecking2011.html#Rossmanith11

Alexander Langer Peter Rossmanith Somnath Sikdar Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory http://arxiv.org/abs/1102.0908 2011 CoRR abs/1102.0908 db/journals/corr/corr1102.html#abs-1102-0908

Joachim Kneis Alexander Langer Peter Rossmanith Courcelle's Theorem - A Game-Theoretic Approach http://arxiv.org/abs/1104.3905 2011 CoRR abs/1104.3905 db/journals/corr/corr1104.html#abs-1104-3905

Robert Ganian Petr Hlinený Alexander Langer Jan Obdrzálek Peter Rossmanith Somnath Sikdar Lower Bounds on the Complexity of MSO1 Model-Checking http://arxiv.org/abs/1109.5804 2011 CoRR abs/1109.5804 db/journals/corr/corr1109.html#abs-1109-5804

Maw-Shang Chang Chuang-Chieh Lin Peter Rossmanith New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. 342-367 2010 47 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-009-9165-y db/journals/mst/mst47.html#ChangLR10

Maw-Shang Chang Ling-Ju Hung Peter Rossmanith Probe Distance-Hereditary Graphs. 55-64 2010 CATS http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV109Chang.html conf/cats/2010 db/conf/cats/cats2010.html#ChangHR10 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. 311-322 2010 CIAC https://doi.org/10.1007/978-3-642-13073-1_28 conf/ciac/2010 db/conf/ciac/ciac2010.html#Binkele-RaibleBFKKLLR10 Robert Ganian Petr Hlinený Joachim Kneis Daniel Meister 0001 Jan Obdrzálek Peter Rossmanith Somnath Sikdar Are There Any Good Digraph Width Measures? 135-146 2010 IPEC https://doi.org/10.1007/978-3-642-17493-3_14 conf/iwpec/2010 db/conf/iwpec/ipec2010.html#GanianHKMORS10

Robert Ganian Petr Hlinený Joachim Kneis Daniel Meister 0001 Jan Obdrzálek Peter Rossmanith Somnath Sikdar Are there any good digraph width measures? http://arxiv.org/abs/1004.1485 2010 CoRR abs/1004.1485 db/journals/corr/corr1004.html#abs-1004-1485

Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. 407-427 2009 23 SIAM J. Discret. Math. 1 https://doi.org/10.1137/080715482 db/journals/siamdm/siamdm23.html#KneisMRR09

Hans-Joachim Böckenhauer Juraj Hromkovic Richard Královic Tobias Mömke Peter Rossmanith Reoptimization of Steiner trees: Changing the terminal set. 3428-3435 2009 410 Theor. Comput. Sci. 36 https://doi.org/10.1016/j.tcs.2008.04.039 db/journals/tcs/tcs410.html#BockenhauerHKMR09

Dogan Kesdogan Daniel Mölle Stefan Richter 0001 Peter Rossmanith Breaking Anonymity by Learning a Unique Minimum Hitting Set. 299-309 2009 CSR https://doi.org/10.1007/978-3-642-03351-3_28 conf/csr/2009 db/conf/csr/csr2009.html#KesdoganMRR09 Johan M. M. van Rooij Hans L. Bodlaender Peter Rossmanith Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. 566-577 2009 ESA https://doi.org/10.1007/978-3-642-04128-0_51 https://www.wikidata.org/entity/Q59567694 conf/esa/2009 db/conf/esa/esa2009.html#RooijBR09 Joachim Kneis Alexander Langer Peter Rossmanith A Fine-grained Analysis of a Simple Independent Set Algorithm. 287-298 2009 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2326 conf/fsttcs/2009 db/conf/fsttcs/fsttcs2009.html#KneisLR09 Henning Fernau Joachim Kneis Dieter Kratsch Alexander Langer Mathieu Liedloff Daniel Raible 0001 Peter Rossmanith An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. 161-172 2009 IWPEC https://doi.org/10.1007/978-3-642-11269-0_13 conf/iwpec/2009 db/conf/iwpec/iwpec2009.html#FernauKKLLRR09 Robert Ganian Petr Hlinený Joachim Kneis Alexander Langer Jan Obdrzálek Peter Rossmanith On Digraph Width Measures in Parameterized Algorithmics. 185-197 2009 IWPEC https://doi.org/10.1007/978-3-642-11269-0_15 conf/iwpec/2009 db/conf/iwpec/iwpec2009.html#GanianHKLOR09

Ljiljana Brankovic Henning Fernau Joachim Kneis Dieter Kratsch Alexander Langer Mathieu Liedloff Daniel Raible 0001 Peter Rossmanith Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles http://arxiv.org/abs/0909.4224 2009 CoRR abs/0909.4224 db/journals/corr/corr0909.html#abs-0909-4224

Daniel Mölle Stefan Richter 0001 Peter Rossmanith Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. 234-253 2008 43 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-007-9089-3 db/journals/mst/mst43.html#MolleRR08

Joachim Kneis Alexander Langer Peter Rossmanith A New Algorithm for Finding Trees with Many Leaves. 270-281 2008 ISAAC https://doi.org/10.1007/978-3-540-92182-0_26 conf/isaac/2008 db/conf/isaac/isaac2008.html#KneisLR08 Maw-Shang Chang Chuang-Chieh Lin Peter Rossmanith New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. 66-77 2008 IWPEC https://doi.org/10.1007/978-3-540-79723-4_8 conf/iwpec/2008 db/conf/iwpec/iwpec2008.html#ChangLR08 Joachim Kneis Alexander Langer Peter Rossmanith Improved Upper Bounds for Partial Vertex Cover. 240-251 2008 WG https://doi.org/10.1007/978-3-540-92248-3_22 conf/wg/2008 db/conf/wg/wg2008.html#KneisLR08 Peter Rossmanith Simulated Annealing. 423-431 2008 Taschenbuch der Algorithmen https://doi.org/10.1007/978-3-540-76394-9_43 reference/algo/2008t db/reference/algo/taschenbuch2008.html#Rossmanith08

Bernhard Fuchs Walter Kern Daniel Mölle Stefan Richter 0001 Peter Rossmanith Xinhui Wang Dynamic Programming for Minimum Steiner Trees. 493-500 2007 41 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-007-1324-4 db/journals/mst/mst41.html#FuchsKMRRW07

Joachim Kneis Daniel Mölle Peter Rossmanith Partial vs. Complete Domination: t-Dominating Set. 367-376 2007 conf/sofsem/2007 SOFSEM (1) https://doi.org/10.1007/978-3-540-69507-3_31 db/conf/sofsem/sofsem2007.html#KneisMR07

Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith Parameterized power domination complexity. 145-149 2006 98 Inf. Process. Lett. 4 https://doi.org/10.1016/j.ipl.2006.01.007 db/journals/ipl/ipl98.html#KneisMRR06

Daniel Mölle Stefan Richter 0001 Peter Rossmanith Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. 265-273 2006 conf/cocoon/2006 COCOON https://doi.org/10.1007/11809678_29 db/conf/cocoon/cocoon2006.html#MolleRR06 Daniel Mölle Stefan Richter 0001 Peter Rossmanith Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. 270-280 2006 conf/csr/2006 CSR https://doi.org/10.1007/11753728_28 db/conf/csr/csr2006.html#MolleRR06 Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith Intuitive Algorithms and t-Vertex Cover. 598-607 2006 conf/isaac/2006 ISAAC https://doi.org/10.1007/11940128_60 db/conf/isaac/isaac2006.html#KneisMRR06 Daniel Mölle Stefan Richter 0001 Peter Rossmanith A Faster Algorithm for the Steiner Tree Problem. 561-570 2006 conf/stacs/2006 STACS https://doi.org/10.1007/11672142_46 db/conf/stacs/stacs2006.html#MolleRR06 Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith Divide-and-Color. 58-67 2006 conf/wg/2006 WG https://doi.org/10.1007/11917496_6 db/conf/wg/wg2006.html#KneisMRR06 Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith On the Parameterized Complexity of Exact Satisfiability Problems. 568-579 2005 conf/mfcs/2005 MFCS https://doi.org/10.1007/11549345_49 db/conf/mfcs/mfcs2005.html#KneisMRR05 Joachim Kneis Daniel Mölle Stefan Richter 0001 Peter Rossmanith Algorithms Based on the Treewidth of Sparse Graphs. 385-396 2005 conf/wg/2005 WG https://doi.org/10.1007/11604686_34 https://www.wikidata.org/entity/Q29543557 db/conf/wg/wg2005.html#KneisMRR05

Jens Gramm Rolf Niedermeier Peter Rossmanith Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. 25-42 2003 37 Algorithmica 1 https://doi.org/10.1007/s00453-003-1028-3 db/journals/algorithmica/algorithmica37.html#GrammNR03

Jens Gramm Edward A. Hirsch Rolf Niedermeier Peter Rossmanith Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. 139-155 2003 130 Discret. Appl. Math. 2 https://doi.org/10.1016/S0166-218X(02)00402-X https://www.wikidata.org/entity/Q56288411 db/journals/dam/dam130.html#GrammHNR03

Rolf Niedermeier Peter Rossmanith On efficient fixed-parameter algorithms for weighted vertex cover. 63-77 2003 47 J. Algorithms 2 https://doi.org/10.1016/S0196-6774(03)00005-1 db/journals/jal/jal47.html#NiedermeierR03

Rolf Niedermeier Peter Rossmanith An efficient fixed-parameter algorithm for 3-Hitting Set. 89-102 2003 1 J. Discrete Algorithms 1 https://doi.org/10.1016/S1570-8667(03)00009-1 db/journals/jda/jda1.html#NiedermeierR03

Peter Rossmanith Thomas Zeugmann Stochastic Finite Learning of the Pattern Languages. 67-91 2001 44 Mach. Learn. 1/2 db/journals/ml/ml44.html#RossmanithZ01 https://doi.org/10.1023/A:1010875913047

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. 119-156 2001 261 Theor. Comput. Sci. 1 db/journals/tcs/tcs261.html#ErlebachRSSZ01 https://doi.org/10.1016/S0304-3975(00)00136-5 https://www.wikidata.org/entity/Q126778400

Jens Gramm Rolf Niedermeier Peter Rossmanith Exact Solutions for CLOSEST STRING and Related Problems. 441-453 2001 conf/isaac/2001 ISAAC https://doi.org/10.1007/3-540-45678-3_38 db/conf/isaac/isaac2001.html#GrammNR01

Javier Esparza Peter Rossmanith Stefan Schwoon A Uniform Framework for Problems on Context-Free Grammars. 169-177 2000 72 Bull. EATCS db/journals/eatcs/eatcs72.html#EsparzaRS00

Rolf Niedermeier Peter Rossmanith A general method to speed up fixed-parameter-tractable algorithms. 125-129 2000 73 Inf. Process. Lett. 3-4 db/journals/ipl/ipl73.html#NiedermeierR00 https://doi.org/10.1016/S0020-0190(00)00004-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. 221-227 2000 74 Inf. Process. Lett. 5-6 db/journals/ipl/ipl74.html#BouajjaniEFMRWW00 https://doi.org/10.1016/S0020-0190(00)00055-7

Rolf Niedermeier Peter Rossmanith New Upper Bounds for Maximum Satisfiability. 63-88 2000 36 J. Algorithms 1 db/journals/jal/jal36.html#NiedermeierR00 https://doi.org/10.1006/jagm.2000.1075

Javier Esparza David Hansel Peter Rossmanith Stefan Schwoon Efficient Algorithms for Model Checking Pushdown Systems. 232-247 2000 conf/cav/2000 CAV db/conf/cav/cav2000.html#EsparzaHRS00 https://doi.org/10.1007/10722167_20 Rolf Niedermeier Peter Rossmanith On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. 180-191 https://doi.org/10.1007/3-540-40996-3_16 2000 conf/isaac/2000 ISAAC db/conf/isaac/isaac2000.html#NiedermeyerR00

Jens Gramm Edward A. Hirsch Rolf Niedermeier Peter Rossmanith New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Electron. Colloquium Comput. Complex. 2000 TR00 TR00-037 db/journals/eccc/eccc7.html#ECCC-TR00-037 https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-037/index.html

Manfred Kunde Rolf Niedermeier Klaus Reinhardt Peter Rossmanith Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. 438-458 1999 25 Algorithmica 4 https://doi.org/10.1007/PL00009288 db/journals/algorithmica/algorithmica25.html#KundeNRR99

Peter Rossmanith Learning from Random Text. 132-144 https://doi.org/10.1007/3-540-46769-6_11 1999 conf/alt/1999 ALT db/conf/alt/alt1999.html#Rossmanith98 Rolf Niedermeier Peter Rossmanith New Upper Bounds for MaxSat. 575-584 https://doi.org/10.1007/3-540-48523-6_54 1999 conf/icalp/99 ICALP db/conf/icalp/icalp99.html#NiedermeierR99 Rolf Niedermeier Peter Rossmanith Upper Bounds for Vertex Cover Further Improved. 561-570 1999 conf/stacs/1999 STACS db/conf/stacs/stacs99.html#NiedermeierR99 https://doi.org/10.1007/3-540-49116-3_53

Rolf Niedermeier Peter Rossmanith Unambiguous Computations and Locally Definable Acceptance Types. 137-161 1998 194 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs194.html#NiedermeierR98 https://doi.org/10.1016/S0304-3975(97)00005-4

Peter Rossmanith Thomas Zeugmann Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. 13-24 https://doi.org/10.1007/BFb0054060 1998 conf/icgi/1998 ICGI db/conf/icgi/icgi1998.html#RossmanithZ98

Carsten Damm Markus Holzer 0001 Peter Rossmanith Expressing Uniformity via Oracles. 355-366 1997 30 Theory Comput. Syst. 4 db/journals/mst/mst30.html#DammHR97 https://doi.org/10.1007/s002240000056

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. 260-276 1997 conf/alt/1997 ALT db/conf/alt/alt1997.html#ErlebachRSSZ97 https://doi.org/10.1007/3-540-63577-7_48 Javier Esparza Peter Rossmanith An Automata Approach to Some Problems on Context-Free Grammars. 143-152 https://doi.org/10.1007/BFb0052083 1997 conf/birthday/1997brauer Foundations of Computer Science: Potential - Theory - Cognition db/conf/birthday/brauer97.html#EsparzaR97

Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits Rolf Niedermeier Peter Rossmanith 227-245 Inf. Comput. May 1995 118 2 db/journals/iandc/iandc118.html#NiedermeierR95 https://doi.org/10.1006/inco.1995.1064

Rolf Niedermeier Peter Rossmanith On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. 299-309 1995 5 Parallel Process. Lett. db/journals/ppl/ppl5.html#NiedermeierR95 https://doi.org/10.1142/S012962649500028X

Rolf Niedermeier Peter Rossmanith PRAM's Towards Realistic Parallelism: BRAM's. 363-373 1995 conf/fct/1995 FCT db/conf/fct/fct95.html#NiedermeierR95 https://doi.org/10.1007/3-540-60249-6_68 Manfred Kunde Rolf Niedermeier Klaus Reinhardt Peter Rossmanith Optimal Average Case Sorting on Arrays. 503-514 1995 conf/stacs/1995 STACS db/conf/stacs/stacs95.html#KundeNRR95 https://doi.org/10.1007/3-540-59042-0_100

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

Peter Rossmanith Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions. 1994 1-113 Technical University Munich, Germany https://d-nb.info/943202728 Klaus-Jörn Lange Peter Rossmanith Unambiguous Polynomial Hierarchies and Exponential Size. 106-115 1994 conf/coco/1994 SCT db/conf/coco/coco94.html#LangeR94 https://doi.org/10.1109/SCT.1994.315812 https://doi.ieeecomputersociety.org/10.1109/SCT.1994.315812 Manfred Kunde Rolf Niedermeier Peter Rossmanith Faster Sorting and Routing on Grids with Diagonals. 225-236 1994 conf/stacs/1994 STACS db/conf/stacs/stacs94.html#KundeNR94 https://doi.org/10.1007/3-540-57785-8_144 Carsten Damm Markus Holzer 0001 Klaus-Jörn Lange Peter Rossmanith Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. 305-313 1993 conf/dlt/1993 Developments in Language Theory db/conf/dlt/dlt1993.html#DammHLR93 Rolf Niedermeier Peter Rossmanith On the Power of Reading and Writing Simultaneously in Parallel Computation. 240-249 1993 conf/isaac/1993 ISAAC db/conf/isaac/isaac93.html#NiedermeierR93 https://doi.org/10.1007/3-540-57568-5_254 Rolf Niedermeier Peter Rossmanith Extended Locally Definable Acceptance Types (Extended Abstract). 473-483 1993 conf/stacs/1993 STACS db/conf/stacs/stacs93.html#NiedermeierR93 https://doi.org/10.1007/3-540-56503-5_47

Manfred Kunde Rolf Niedermeier Peter Rossmanith Faster sorting and routing on grids with diagonals 1-31 1993 Forschungsberichte, TU Munich TUM I 9313 https://d-nb.info/940414147

Peter Rossmanith Wojciech Rytter Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. 267-272 1992 44 Inf. Process. Lett. 5 db/journals/ipl/ipl44.html#RossmanithR92 https://doi.org/10.1016/0020-0190(92)90212-E

Rolf Niedermeier Peter Rossmanith Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). 387-400 1992 conf/latin/1992 LATIN db/conf/latin/latin92.html#NiedermeierR92 https://doi.org/10.1007/BFb0023843 Klaus-Jörn Lange Peter Rossmanith Wojciech Rytter Parallel Recognition and Ranking of Context-Free Languages. 24-36 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#LangeRR92 https://doi.org/10.1007/3-540-55808-X_3 Klaus-Jörn Lange Peter Rossmanith The Emptiness Problem for Intersections of Regular Languages. 346-354 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#LangeR92 https://doi.org/10.1007/3-540-55808-X_33

Rolf Niedermeier Peter Rossmanith Optimal parallel algorithms for computing recursively defined functions 1-28 1992 Forschungsberichte, TU Munich TUM I 9218 https://d-nb.info/941465233

Gerhard Buntrock Birgit Jenner Klaus-Jörn Lange Peter Rossmanith Unambiguity and Fewness for Logarithmic Space. 168-179 1991 conf/fct/1991 FCT db/conf/fct/fct91.html#BuntrockJLR91 https://doi.org/10.1007/3-540-54458-5_61 Inga Niepel Peter Rossmanith Uniform Circuits and Exclusive Read PRAMs. 307-318 1991 conf/fsttcs/1991 FSTTCS db/conf/fsttcs/fsttcs91.html#NiepelR91 https://doi.org/10.1007/3-540-54967-6_77 Peter Rossmanith The Owner Concept for PRAMs. 172-183 1991 conf/stacs/1991 STACS db/conf/stacs/stacs91.html#Rossmanith91 https://doi.org/10.1007/BFb0020797 Klaus-Jörn Lange Peter Rossmanith Characterizing Unambiguous Augmented Pushdown Automata by Circuits. 399-406 1990 conf/mfcs/1990 MFCS db/conf/mfcs/mfcs90.html#LangeR90 https://doi.org/10.1007/BFb0029635

Klaus-Jörn Lange Peter Rossmanith Two results on unambiguous circuits 1-29 1990 Forschungsberichte, TU Munich TUM I 9006 https://d-nb.info/920916287

Peter Rossmanith The owner concept for PRAMs 1-30 1990 Forschungsberichte, TU Munich TUM I 9028 https://d-nb.info/920791948

Rolf Niedermeier Peter Rossmanith Unambiguous simulations of auxiliary pushdown automata and circuits 1-38 1990 Forschungsberichte, TU Munich TUM I 9054 https://d-nb.info/920791824

Inga Niepel Peter Rossmanith Uniform circuits and exclusive read PRAMs 1-34 1990 Forschungsberichte, TU Munich TUM I 9055 https://d-nb.info/920791808

Jakub Balabán Daniel Binkele-RaibleDaniel Raible 0001 Hans-Joachim Böckenhauer Hans L. Bodlaender Ahmed Bouajjani Ljiljana Brankovic Alexander Brenner Gerhard Buntrock Elisabet Burjons Maw-Shang Chang Li-Hsuan Chen Roberto de Col Marek Cygan Carsten Damm Erik D. Demaine Jan Dreier Pavol Duris Thomas Erlebach Javier Esparza Henning Fernau Alain Finkel Florian P. Fischer Fabian Frei Bernhard Fuchs Janosch Fuchs Jakub Gajarský Robert Ganian Matthias Gehnen Jens Gramm David Hansel Tim A. Hartmann Pinar Heggernes Edward A. Hirsch Petr Hlinený Markus Holzer 0001 Juraj Hromkovic Sun-Yuan Hsieh Ling-Ju Hung Birgit Jenner Konstanty Junosza-Szaniawski Joost-Pieter Katoen Walter Kern Dogan Kesdogan Eun Jung Kim 0002 Ralf Klasing Joachim Kneis Felix Knispel Henner Koch Dennis Komm Rastislav KralovicRastislav Královic Richard Královic Jan Kratochvíl Dieter Kratsch Stefan Kratsch Philipp Kuinke Manfred Kunde Ekaterina Kutafina Klaus-Jörn Lange Alexander Langer Erik Jan van Leeuwen Mathieu Liedloff Chuang-Chieh Lin Yi-Zhi Liu Daniel Lokshtanov Henri Lotze Oded Maler Dániel Marx Daniel Meister 0001 Daniel Mock Daniel Mölle Tobias Mömke Barbara Namer Rolf Niedermeier Inga Niepel Jan Obdrzálek Sebastian Ordyniak Dana Pardubská Martin Pasen Christophe Paul Marcin Pilipczuk Rafael Przybylski Martin Raszyk Felix Reidl Klaus Reinhardt Stefan Richter 0001 Rainer Röhrig Johan M. M. van Rooij Wojciech Rytter Pawel Rzazewski Ignasi Sau Stefan Schwoon Somnath Sikdar Hans Stadtherr Angelika Steger Moritz Stocker Ping-Chen Su Blair D. Sullivan Bjoern Tauer Alina Troglio Julian Varghese Martin Vatshelle Fernando Sánchez Villaamil Hung-Lung Wang Xinhui Wang Yvonne Weber David Wehner Bernard Willems Jakub Onufry Wojtaszczyk Pierre Wolper Guan-Han Wu Ba Le Xuan Thomas Zeugmann