BibTeX records: Peter Rossmanith

download as .bib file

@inproceedings{DBLP:conf/stacs/BockenhauerFR24,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Fabian Frei and
                  Peter Rossmanith},
  editor       = {Olaf Beyersdorff and
                  Mamadou Moustapha Kant{\'{e}} and
                  Orna Kupferman and
                  Daniel Lokshtanov},
  title        = {Removable Online Knapsack and Advice},
  booktitle    = {41st International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
  series       = {LIPIcs},
  volume       = {289},
  pages        = {18:1--18:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2024.18},
  doi          = {10.4230/LIPICS.STACS.2024.18},
  timestamp    = {Mon, 11 Mar 2024 15:43:27 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BockenhauerFR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GehnenLR24,
  author       = {Matthias Gehnen and
                  Henri Lotze and
                  Peter Rossmanith},
  editor       = {Olaf Beyersdorff and
                  Mamadou Moustapha Kant{\'{e}} and
                  Orna Kupferman and
                  Daniel Lokshtanov},
  title        = {Online Simple Knapsack with Bounded Predictions},
  booktitle    = {41st International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
  series       = {LIPIcs},
  volume       = {289},
  pages        = {37:1--37:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2024.37},
  doi          = {10.4230/LIPICS.STACS.2024.37},
  timestamp    = {Mon, 11 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GehnenLR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ficn/KutafinaTCRRN23,
  author       = {Ekaterina Kutafina and
                  Alina Troglio and
                  Roberto de Col and
                  Rainer R{\"{o}}hrig and
                  Peter Rossmanith and
                  Barbara Namer},
  title        = {Corrigendum: Decoding neuropathic pain: Can we predict fluctuations
                  of propagation speed in stimulated peripheral nerve?},
  journal      = {Frontiers Comput. Neurosci.},
  volume       = {17},
  year         = {2023},
  url          = {https://doi.org/10.3389/fncom.2023.1149849},
  doi          = {10.3389/FNCOM.2023.1149849},
  timestamp    = {Wed, 08 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ficn/KutafinaTCRRN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BurjonsFGLMR23,
  author       = {Elisabet Burjons and
                  Fabian Frei and
                  Matthias Gehnen and
                  Henri Lotze and
                  Daniel Mock and
                  Peter Rossmanith},
  editor       = {Weili Wu and
                  Guangmo Tong},
  title        = {Delaying Decisions and Reservation Costs},
  booktitle    = {Computing and Combinatorics - 29th International Conference, {COCOON}
                  2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14422},
  pages        = {371--383},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-49190-0\_27},
  doi          = {10.1007/978-3-031-49190-0\_27},
  timestamp    = {Sat, 13 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoon/BurjonsFGLMR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DreierMR23,
  author       = {Jan Dreier and
                  Daniel Mock and
                  Peter Rossmanith},
  editor       = {Inge Li G{\o}rtz and
                  Martin Farach{-}Colton and
                  Simon J. Puglisi and
                  Grzegorz Herman},
  title        = {Evaluating Restricted First-Order Counting Properties on Nowhere Dense
                  Classes and Beyond},
  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
                  4-6, 2023, Amsterdam, The Netherlands},
  series       = {LIPIcs},
  volume       = {274},
  pages        = {43:1--43:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.43},
  doi          = {10.4230/LIPICS.ESA.2023.43},
  timestamp    = {Wed, 30 Aug 2023 15:40:45 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/DreierMR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BockenhauerKMRS23,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Ralf Klasing and
                  Tobias M{\"{o}}mke and
                  Peter Rossmanith and
                  Moritz Stocker and
                  David Wehner},
  editor       = {Sun{-}Yuan Hsieh and
                  Ling{-}Ju Hung and
                  Chia{-}Wei Lee},
  title        = {Online Knapsack with Removal and Recourse},
  booktitle    = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,
                  Tainan, Taiwan, June 7-10, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13889},
  pages        = {123--135},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-34347-6\_11},
  doi          = {10.1007/978-3-031-34347-6\_11},
  timestamp    = {Mon, 26 Jun 2023 15:55:36 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BockenhauerKMRS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BurjonsGLMR23,
  author       = {Elisabet Burjons and
                  Matthias Gehnen and
                  Henri Lotze and
                  Daniel Mock and
                  Peter Rossmanith},
  editor       = {J{\'{e}}r{\^{o}}me Leroux and
                  Sylvain Lombardy and
                  David Peleg},
  title        = {The Online Simple Knapsack Problem with Reservation and Removability},
  booktitle    = {48th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
  series       = {LIPIcs},
  volume       = {272},
  pages        = {29:1--29:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2023.29},
  doi          = {10.4230/LIPICS.MFCS.2023.29},
  timestamp    = {Mon, 28 Aug 2023 15:00:20 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BurjonsGLMR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-01832,
  author       = {Jan Dreier and
                  Daniel Mock and
                  Peter Rossmanith},
  title        = {Evaluating Restricted First-Order Counting Properties on Nowhere Dense
                  Classes and Beyond},
  journal      = {CoRR},
  volume       = {abs/2307.01832},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2307.01832},
  doi          = {10.48550/ARXIV.2307.01832},
  eprinttype    = {arXiv},
  eprint       = {2307.01832},
  timestamp    = {Mon, 10 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-01832.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07284,
  author       = {Elisabet Burjons and
                  Fabian Frei and
                  Matthias Gehnen and
                  Henri Lotze and
                  Daniel Mock and
                  Peter Rossmanith},
  title        = {Delaying Decisions and Reservation Costs},
  journal      = {CoRR},
  volume       = {abs/2307.07284},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2307.07284},
  doi          = {10.48550/ARXIV.2307.07284},
  eprinttype    = {arXiv},
  eprint       = {2307.07284},
  timestamp    = {Mon, 24 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-07284.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BockenhauerBRR22,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Elisabet Burjons and
                  Martin Raszyk and
                  Peter Rossmanith},
  title        = {Reoptimization of parameterized problems},
  journal      = {Acta Informatica},
  volume       = {59},
  number       = {4},
  pages        = {427--450},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00236-022-00428-y},
  doi          = {10.1007/S00236-022-00428-Y},
  timestamp    = {Mon, 24 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BockenhauerBRR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ficn/KutafinaTCRRN22,
  author       = {Ekaterina Kutafina and
                  Alina Troglio and
                  Roberto de Col and
                  Rainer R{\"{o}}hrig and
                  Peter Rossmanith and
                  Barbara Namer},
  title        = {Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation
                  Speed in Stimulated Peripheral Nerve?},
  journal      = {Frontiers Comput. Neurosci.},
  volume       = {16},
  year         = {2022},
  url          = {https://doi.org/10.3389/fncom.2022.899584},
  doi          = {10.3389/FNCOM.2022.899584},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ficn/KutafinaTCRRN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenHLR21,
  author       = {Li{-}Hsuan Chen and
                  Ling{-}Ju Hung and
                  Henri Lotze and
                  Peter Rossmanith},
  title        = {Online Node- and Edge-Deletion Problems with Advice},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {9},
  pages        = {2719--2753},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-021-00840-9},
  doi          = {10.1007/S00453-021-00840-9},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenHLR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BurjonsGLMR21,
  author       = {Elisabet Burjons and
                  Matthias Gehnen and
                  Henri Lotze and
                  Daniel Mock and
                  Peter Rossmanith},
  editor       = {Chi{-}Yeh Chen and
                  Wing{-}Kai Hon and
                  Ling{-}Ju Hung and
                  Chia{-}Wei Lee},
  title        = {The Secretary Problem with Reservation Costs},
  booktitle    = {Computing and Combinatorics - 27th International Conference, {COCOON}
                  2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13025},
  pages        = {553--564},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-89543-3\_46},
  doi          = {10.1007/978-3-030-89543-3\_46},
  timestamp    = {Wed, 03 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoon/BurjonsGLMR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/FreiRW21,
  author       = {Fabian Frei and
                  Peter Rossmanith and
                  David Wehner},
  editor       = {Martin Farach{-}Colton and
                  Giuseppe Prencipe and
                  Ryuhei Uehara},
  title        = {An Open Pouring Problem},
  booktitle    = {10th International Conference on Fun with Algorithms, {FUN} 2021,
                  May 30 to June 1, 2021, Favignana Island, Sicily, Italy},
  series       = {LIPIcs},
  volume       = {157},
  pages        = {14:1--14:9},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.FUN.2021.14},
  doi          = {10.4230/LIPICS.FUN.2021.14},
  timestamp    = {Mon, 21 Dec 2020 13:23:22 +0100},
  biburl       = {https://dblp.org/rec/conf/fun/FreiRW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BurjonsR21,
  author       = {Elisabet Burjons and
                  Peter Rossmanith},
  editor       = {Petr A. Golovach and
                  Meirav Zehavi},
  title        = {Lower Bounds for Conjunctive and Disjunctive Turing Kernels},
  booktitle    = {16th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
  series       = {LIPIcs},
  volume       = {214},
  pages        = {12:1--12:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2021.12},
  doi          = {10.4230/LIPICS.IPEC.2021.12},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/BurjonsR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DreierR21,
  author       = {Jan Dreier and
                  Peter Rossmanith},
  editor       = {D{\'{a}}niel Marx},
  title        = {Approximate Evaluation of First-Order Counting Queries},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {1720--1739},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.104},
  doi          = {10.1137/1.9781611976465.104},
  timestamp    = {Thu, 15 Jul 2021 13:48:55 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/DreierR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BockenhauerBHLR21,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Elisabet Burjons and
                  Juraj Hromkovic and
                  Henri Lotze and
                  Peter Rossmanith},
  editor       = {Markus Bl{\"{a}}ser and
                  Benjamin Monmege},
  title        = {Online Simple Knapsack with Reservation Costs},
  booktitle    = {38th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {187},
  pages        = {16:1--16:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2021.16},
  doi          = {10.4230/LIPICS.STACS.2021.16},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BockenhauerBHLR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HromkovicR20,
  author       = {Juraj Hromkovic and
                  Peter Rossmanith},
  title        = {What one has to know when attacking {P} vs. {NP}},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {107},
  pages        = {142--155},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.jcss.2019.06.004},
  doi          = {10.1016/J.JCSS.2019.06.004},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/HromkovicR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DreierKR20,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Peter Rossmanith},
  editor       = {Jaroslaw Byrka and
                  Raghu Meka},
  title        = {Maximum Shallow Clique Minors in Preferential Attachment Graphs Have
                  Polylogarithmic Size},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
                  Conference},
  series       = {LIPIcs},
  volume       = {176},
  pages        = {14:1--14:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.14},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2020.14},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DreierKR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DreierKR20,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Peter Rossmanith},
  editor       = {Fabrizio Grandoni and
                  Grzegorz Herman and
                  Peter Sanders},
  title        = {First-Order Model-Checking in Random Graphs and Complex Networks},
  booktitle    = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
                  7-9, 2020, Pisa, Italy (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {173},
  pages        = {40:1--40:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2020.40},
  doi          = {10.4230/LIPICS.ESA.2020.40},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/DreierKR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DreierLR20,
  author       = {Jan Dreier and
                  Henri Lotze and
                  Peter Rossmanith},
  editor       = {Artur Czumaj and
                  Anuj Dawar and
                  Emanuela Merelli},
  title        = {Hard Problems on Random Graphs},
  booktitle    = {47th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {168},
  pages        = {40:1--40:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2020.40},
  doi          = {10.4230/LIPICS.ICALP.2020.40},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DreierLR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChenHLR20,
  author       = {Li{-}Hsuan Chen and
                  Ling{-}Ju Hung and
                  Henri Lotze and
                  Peter Rossmanith},
  editor       = {Leszek Gasieniec and
                  Ralf Klasing and
                  Tomasz Radzik},
  title        = {Further Results on Online Node- and Edge-Deletion Problems with Advice},
  booktitle    = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
                  Bordeaux, France, June 8-10, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12126},
  pages        = {140--153},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-48966-3\_11},
  doi          = {10.1007/978-3-030-48966-3\_11},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/ChenHLR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DurisKKPPR20,
  author       = {Pavol Duris and
                  Rastislav Kr{\'{a}}lovic and
                  Richard Kr{\'{a}}lovic and
                  Dana Pardubsk{\'{a}} and
                  Martin Pasen and
                  Peter Rossmanith},
  editor       = {Javier Esparza and
                  Daniel Kr{\'{a}}l'},
  title        = {Randomization in Non-Uniform Finite Automata},
  booktitle    = {45th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
  series       = {LIPIcs},
  volume       = {170},
  pages        = {30:1--30:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2020.30},
  doi          = {10.4230/LIPICS.MFCS.2020.30},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/DurisKKPPR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01867,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Jan Dreier and
                  Fabian Frei and
                  Peter Rossmanith},
  title        = {Advice for Online Knapsack With Removable Items},
  journal      = {CoRR},
  volume       = {abs/2005.01867},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.01867},
  eprinttype    = {arXiv},
  eprint       = {2005.01867},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-01867.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-14488,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Peter Rossmanith},
  title        = {First-Order Model-Checking in Random Graphs and Complex Networks},
  journal      = {CoRR},
  volume       = {abs/2006.14488},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.14488},
  eprinttype    = {arXiv},
  eprint       = {2006.14488},
  timestamp    = {Wed, 01 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-14488.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14043,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Elisabet Burjons and
                  Juraj Hromkovic and
                  Henri Lotze and
                  Peter Rossmanith},
  title        = {Online Simple Knapsack with Reservation Costs},
  journal      = {CoRR},
  volume       = {abs/2009.14043},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.14043},
  eprinttype    = {arXiv},
  eprint       = {2009.14043},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-14043.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-14814,
  author       = {Jan Dreier and
                  Peter Rossmanith},
  title        = {Approximate Evaluation of First-Order Counting Queries},
  journal      = {CoRR},
  volume       = {abs/2010.14814},
  year         = {2020},
  url          = {https://arxiv.org/abs/2010.14814},
  eprinttype    = {arXiv},
  eprint       = {2010.14814},
  timestamp    = {Mon, 02 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-14814.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DemaineRRVSS19,
  author       = {Erik D. Demaine and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar and
                  Blair D. Sullivan},
  title        = {Structural sparsity of complex networks: Bounded expansion in random
                  models and real-world graphs},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {105},
  pages        = {199--241},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.jcss.2019.05.004},
  doi          = {10.1016/J.JCSS.2019.05.004},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/DemaineRRVSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DreierR19,
  author       = {Jan Dreier and
                  Peter Rossmanith},
  editor       = {Arkadev Chattopadhyay and
                  Paul Gastin},
  title        = {Motif Counting in Preferential Attachment Graphs},
  booktitle    = {39th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
                  Bombay, India},
  series       = {LIPIcs},
  volume       = {150},
  pages        = {13:1--13:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.13},
  doi          = {10.4230/LIPICS.FSTTCS.2019.13},
  timestamp    = {Thu, 19 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/DreierR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DreierFHKRTW19,
  author       = {Jan Dreier and
                  Janosch Fuchs and
                  Tim A. Hartmann and
                  Philipp Kuinke and
                  Peter Rossmanith and
                  Bjoern Tauer and
                  Hung{-}Lung Wang},
  editor       = {Bart M. P. Jansen and
                  Jan Arne Telle},
  title        = {The Complexity of Packing Edge-Disjoint Paths},
  booktitle    = {14th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2019, September 11-13, 2019, Munich, Germany},
  series       = {LIPIcs},
  volume       = {148},
  pages        = {10:1--10:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2019.10},
  doi          = {10.4230/LIPICS.IPEC.2019.10},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/DreierFHKRTW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DreierR19,
  author       = {Jan Dreier and
                  Peter Rossmanith},
  editor       = {Bart M. P. Jansen and
                  Jan Arne Telle},
  title        = {Hardness of {FO} Model-Checking on Random Graphs},
  booktitle    = {14th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2019, September 11-13, 2019, Munich, Germany},
  series       = {LIPIcs},
  volume       = {148},
  pages        = {11:1--11:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2019.11},
  doi          = {10.4230/LIPICS.IPEC.2019.11},
  timestamp    = {Thu, 19 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/DreierR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2019,
  editor       = {Peter Rossmanith and
                  Pinar Heggernes and
                  Joost{-}Pieter Katoen},
  title        = {44th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series       = {LIPIcs},
  volume       = {138},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {http://www.dagstuhl.de/dagpub/978-3-95977-117-7},
  isbn         = {978-3-95977-117-7},
  timestamp    = {Tue, 27 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/2019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00440,
  author       = {Jan Dreier and
                  Janosch Fuchs and
                  Tim A. Hartmann and
                  Philipp Kuinke and
                  Peter Rossmanith and
                  Bjoern Tauer and
                  Hung{-}Lung Wang},
  title        = {The Complexity of Packing Edge-Disjoint Paths},
  journal      = {CoRR},
  volume       = {abs/1910.00440},
  year         = {2019},
  url          = {http://arxiv.org/abs/1910.00440},
  eprinttype    = {arXiv},
  eprint       = {1910.00440},
  timestamp    = {Fri, 04 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1910-00440.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/ChenRRV18,
  author       = {Li{-}Hsuan Chen and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil},
  title        = {Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming},
  journal      = {Algorithms},
  volume       = {11},
  number       = {7},
  pages        = {98},
  year         = {2018},
  url          = {https://doi.org/10.3390/a11070098},
  doi          = {10.3390/A11070098},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithms/ChenRRV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangCHLRS18,
  author       = {Maw{-}Shang Chang and
                  Li{-}Hsuan Chen and
                  Ling{-}Ju Hung and
                  Yi{-}Zhi Liu and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Moderately exponential time algorithms for the maximum bounded-degree-1
                  set problem},
  journal      = {Discret. Appl. Math.},
  volume       = {251},
  pages        = {114--125},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.05.032},
  doi          = {10.1016/J.DAM.2018.05.032},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChangCHLRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Rossmanith18,
  author       = {Peter Rossmanith},
  title        = {{MFCS} 2019 - First Call for Papers},
  journal      = {Bull. {EATCS}},
  volume       = {126},
  year         = {2018},
  url          = {http://bulletin.eatcs.org/index.php/beatcs/article/view/559/557},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eatcs/Rossmanith18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Rossmanith18,
  author       = {Peter Rossmanith},
  editor       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Dennis Komm and
                  Walter Unger},
  title        = {On the Advice Complexity of Online Edge- and Node-Deletion Problems},
  booktitle    = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated
                  to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday},
  series       = {Lecture Notes in Computer Science},
  volume       = {11011},
  pages        = {449--462},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-98355-4\_26},
  doi          = {10.1007/978-3-319-98355-4\_26},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/Rossmanith18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DreierKXR18,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Ba Le Xuan and
                  Peter Rossmanith},
  editor       = {A Min Tjoa and
                  Ladjel Bellatreche and
                  Stefan Biffl and
                  Jan van Leeuwen and
                  Jir{\'{\i}} Wiedermann},
  title        = {Local Structure Theorems for Erd{\H{o}}s-R{\'{e}}nyi Graphs and
                  Their Algorithmic Applications},
  booktitle    = {{SOFSEM} 2018: Theory and Practice of Computer Science - 44th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  Krems, Austria, January 29 - February 2, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10706},
  pages        = {125--136},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-73117-9\_9},
  doi          = {10.1007/978-3-319-73117-9\_9},
  timestamp    = {Sat, 30 Sep 2023 09:57:10 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/DreierKXR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-11114,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Peter Rossmanith},
  title        = {The Fine Structure of Preferential Attachment Graphs {I:} Somewhere-Denseness},
  journal      = {CoRR},
  volume       = {abs/1803.11114},
  year         = {2018},
  url          = {http://arxiv.org/abs/1803.11114},
  eprinttype    = {arXiv},
  eprint       = {1803.11114},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1803-11114.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-01667,
  author       = {Johan M. M. van Rooij and
                  Hans L. Bodlaender and
                  Erik Jan van Leeuwen and
                  Peter Rossmanith and
                  Martin Vatshelle},
  title        = {Fast Dynamic Programming on Graph Decompositions},
  journal      = {CoRR},
  volume       = {abs/1806.01667},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.01667},
  eprinttype    = {arXiv},
  eprint       = {1806.01667},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-01667.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10578,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Elisabet Burjons and
                  Martin Raszyk and
                  Peter Rossmanith},
  title        = {Reoptimization of Parameterized Problems},
  journal      = {CoRR},
  volume       = {abs/1809.10578},
  year         = {2018},
  url          = {http://arxiv.org/abs/1809.10578},
  eprinttype    = {arXiv},
  eprint       = {1809.10578},
  timestamp    = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1809-10578.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GajarskyHOORRVS17,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  title        = {Kernelization using structural parameters on sparse graph classes},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {219--242},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.002},
  doi          = {10.1016/J.JCSS.2016.09.002},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/GajarskyHOORRVS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HromkovicR17,
  author       = {Juraj Hromkovic and
                  Peter Rossmanith},
  editor       = {Ralf Klasing and
                  Marc Zeitoun},
  title        = {What One Has to Know When Attacking {P} vs. {NP} (Extended Abstract)},
  booktitle    = {Fundamentals of Computation Theory - 21st International Symposium,
                  {FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10472},
  pages        = {11--28},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-662-55751-8\_2},
  doi          = {10.1007/978-3-662-55751-8\_2},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/HromkovicR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenHHR17,
  author       = {Li{-}Hsuan Chen and
                  Sun{-}Yuan Hsieh and
                  Ling{-}Ju Hung and
                  Peter Rossmanith},
  editor       = {Yoshio Okamoto and
                  Takeshi Tokuyama},
  title        = {An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition
                  Problem},
  booktitle    = {28th International Symposium on Algorithms and Computation, {ISAAC}
                  2017, December 9-12, 2017, Phuket, Thailand},
  series       = {LIPIcs},
  volume       = {92},
  pages        = {20:1--20:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.20},
  doi          = {10.4230/LIPICS.ISAAC.2017.20},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/ChenHHR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-09152,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Ba Le Xuan and
                  Peter Rossmanith},
  title        = {Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic
                  Application},
  journal      = {CoRR},
  volume       = {abs/1709.09152},
  year         = {2017},
  url          = {http://arxiv.org/abs/1709.09152},
  eprinttype    = {arXiv},
  eprint       = {1709.09152},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1709-09152.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ChangCHRS16,
  author       = {Maw{-}Shang Chang and
                  Li{-}Hsuan Chen and
                  Ling{-}Ju Hung and
                  Peter Rossmanith and
                  Ping{-}Chen Su},
  title        = {Fixed-parameter algorithms for vertex cover P\({}_{\mbox{3}}\)},
  journal      = {Discret. Optim.},
  volume       = {19},
  pages        = {12--22},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.disopt.2015.11.003},
  doi          = {10.1016/J.DISOPT.2015.11.003},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ChangCHRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GanianHK0ORS16,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Daniel Meister and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Are there any good digraph width measures?},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {116},
  pages        = {250--286},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jctb.2015.09.001},
  doi          = {10.1016/J.JCTB.2015.09.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/GanianHK0ORS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0002LPRRSS16,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  title        = {Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {12},
  number       = {2},
  pages        = {21:1--21:41},
  year         = {2016},
  url          = {https://doi.org/10.1145/2797140},
  doi          = {10.1145/2797140},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/0002LPRRSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenRRV16,
  author       = {Li{-}Hsuan Chen and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil},
  title        = {Width, depth and space},
  journal      = {CoRR},
  volume       = {abs/1607.00945},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.00945},
  eprinttype    = {arXiv},
  eprint       = {1607.00945},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChenRRV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/LangerRRS14,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Practical algorithms for {MSO} model-checking on tree-decomposable
                  graphs},
  journal      = {Comput. Sci. Rev.},
  volume       = {13-14},
  pages        = {39--74},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cosrev.2014.08.001},
  doi          = {10.1016/J.COSREV.2014.08.001},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/csr/LangerRRS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GanianHKLOR14,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith},
  title        = {Digraph width measures in parameterized algorithmics},
  journal      = {Discret. Appl. Math.},
  volume       = {168},
  pages        = {88--107},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2013.10.038},
  doi          = {10.1016/J.DAM.2013.10.038},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GanianHKLOR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangCHRW14,
  author       = {Maw{-}Shang Chang and
                  Li{-}Hsuan Chen and
                  Ling{-}Ju Hung and
                  Peter Rossmanith and
                  Guan{-}Han Wu},
  title        = {Exact algorithms for problems related to the densest k-set problem},
  journal      = {Inf. Process. Lett.},
  volume       = {114},
  number       = {9},
  pages        = {510--513},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.ipl.2014.04.009},
  doi          = {10.1016/J.IPL.2014.04.009},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ChangCHRW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GanianHLORS14,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Lower bounds on the complexity of MSO\({}_{\mbox{1}}\) model-checking},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {80},
  number       = {1},
  pages        = {180--194},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jcss.2013.07.005},
  doi          = {10.1016/J.JCSS.2013.07.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/GanianHLORS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockenhauerKKR14,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Dennis Komm and
                  Richard Kr{\'{a}}lovic and
                  Peter Rossmanith},
  title        = {The online knapsack problem: Advice and randomization},
  journal      = {Theor. Comput. Sci.},
  volume       = {527},
  pages        = {61--72},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.01.027},
  doi          = {10.1016/J.TCS.2014.01.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BockenhauerKKR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ReidlRVS14,
  author       = {Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  editor       = {Javier Esparza and
                  Pierre Fraigniaud and
                  Thore Husfeldt and
                  Elias Koutsoupias},
  title        = {A Faster Parameterized Algorithm for Treedepth},
  booktitle    = {Automata, Languages, and Programming - 41st International Colloquium,
                  {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8572},
  pages        = {931--942},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43948-7\_77},
  doi          = {10.1007/978-3-662-43948-7\_77},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/ReidlRVS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GajarskyOORRVS14,
  author       = {Jakub Gajarsk{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  editor       = {Marek Cygan and
                  Pinar Heggernes},
  title        = {Finite Integer Index of Pathwidth and Treewidth},
  booktitle    = {Parameterized and Exact Computation - 9th International Symposium,
                  {IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8894},
  pages        = {258--269},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13524-3\_22},
  doi          = {10.1007/978-3-319-13524-3\_22},
  timestamp    = {Sat, 19 Oct 2019 20:25:35 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/GajarskyOORRVS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReidlRVS14,
  author       = {Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  title        = {A Faster Parameterized Algorithm for Treedepth},
  journal      = {CoRR},
  volume       = {abs/1401.7540},
  year         = {2014},
  url          = {http://arxiv.org/abs/1401.7540},
  eprinttype    = {arXiv},
  eprint       = {1401.7540},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ReidlRVS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineRRVSS14,
  author       = {Erik D. Demaine and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar and
                  Blair D. Sullivan},
  title        = {Structural Sparsity of Complex Networks: Random Graph Models and Linear
                  Algorithms},
  journal      = {CoRR},
  volume       = {abs/1406.2587},
  year         = {2014},
  url          = {http://arxiv.org/abs/1406.2587},
  eprinttype    = {arXiv},
  eprint       = {1406.2587},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DemaineRRVSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DreierKPRRS14,
  author       = {Jan Dreier and
                  Philipp Kuinke and
                  Rafael Przybylski and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Overlapping Communities in Social Networks},
  journal      = {CoRR},
  volume       = {abs/1412.4973},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.4973},
  eprinttype    = {arXiv},
  eprint       = {1412.4973},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DreierKPRRS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/KratschLMR14,
  author       = {Stefan Kratsch and
                  Daniel Lokshtanov and
                  D{\'{a}}niel Marx and
                  Peter Rossmanith},
  title        = {Optimality and tight results in parameterized complexity (Dagstuhl
                  Seminar 14451)},
  journal      = {Dagstuhl Reports},
  volume       = {4},
  number       = {11},
  pages        = {1--21},
  year         = {2014},
  url          = {https://doi.org/10.4230/DagRep.4.11.1},
  doi          = {10.4230/DAGREP.4.11.1},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/KratschLMR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangHR13,
  author       = {Maw{-}Shang Chang and
                  Ling{-}Ju Hung and
                  Peter Rossmanith},
  title        = {Recognition of probe distance-hereditary graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {3},
  pages        = {336--348},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2012.08.029},
  doi          = {10.1016/J.DAM.2012.08.029},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChangHR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangLR13,
  author       = {Maw{-}Shang Chang and
                  Chuang{-}Chieh Lin and
                  Peter Rossmanith},
  title        = {Testing consistency of quartet topologies: a parameterized approach},
  journal      = {Inf. Process. Lett.},
  volume       = {113},
  number       = {22-24},
  pages        = {852--857},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ipl.2013.08.006},
  doi          = {10.1016/J.IPL.2013.08.006},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChangLR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Junosza-SzaniawskiKLRR13,
  author       = {Konstanty Junosza{-}Szaniawski and
                  Jan Kratochv{\'{\i}}l and
                  Mathieu Liedloff and
                  Peter Rossmanith and
                  Pawel Rzazewski},
  title        = {Fast exact algorithm for L(2, 1)-labeling of graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {505},
  pages        = {42--54},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.037},
  doi          = {10.1016/J.TCS.2012.06.037},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Junosza-SzaniawskiKLRR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GajarskyHOORRVS13,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  editor       = {Hans L. Bodlaender and
                  Giuseppe F. Italiano},
  title        = {Kernelization Using Structural Parameters on Sparse Graph Classes},
  booktitle    = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
                  France, September 2-4, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8125},
  pages        = {529--540},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40450-4\_45},
  doi          = {10.1007/978-3-642-40450-4\_45},
  timestamp    = {Mon, 03 Jan 2022 22:19:39 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/GajarskyHOORRVS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0002LPRRSS13,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7965},
  pages        = {613--624},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39206-1\_52},
  doi          = {10.1007/978-3-642-39206-1\_52},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/0002LPRRSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6863,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  title        = {Kernelization Using Structural Parameters on Sparse Graph Classes},
  journal      = {CoRR},
  volume       = {abs/1302.6863},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.6863},
  eprinttype    = {arXiv},
  eprint       = {1302.6863},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-6863.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LangerRRS12,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {David A. Bader and
                  Petra Mutzel},
  title        = {Evaluation of an MSO-Solver},
  booktitle    = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
                  Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
                  16, 2012},
  pages        = {55--63},
  publisher    = {{SIAM} / Omnipress},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611972924.5},
  doi          = {10.1137/1.9781611972924.5},
  timestamp    = {Tue, 29 Dec 2020 18:28:33 +0100},
  biburl       = {https://dblp.org/rec/conf/alenex/LangerRRS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BockenhauerHKKR12,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Juraj Hromkovic and
                  Dennis Komm and
                  Richard Kr{\'{a}}lovic and
                  Peter Rossmanith},
  editor       = {Henning Bordihn and
                  Martin Kutrib and
                  Bianca Truthe},
  title        = {On the Power of Randomness versus Advice in Online Computation},
  booktitle    = {Languages Alive - Essays Dedicated to J{\"{u}}rgen Dassow on
                  the Occasion of His 65th Birthday},
  series       = {Lecture Notes in Computer Science},
  volume       = {7300},
  pages        = {30--43},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31644-9\_2},
  doi          = {10.1007/978-3-642-31644-9\_2},
  timestamp    = {Sun, 25 Oct 2020 23:08:30 +0100},
  biburl       = {https://dblp.org/rec/conf/birthday/BockenhauerHKKR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BockenhauerKKR12,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Dennis Komm and
                  Richard Kr{\'{a}}lovic and
                  Peter Rossmanith},
  editor       = {David Fern{\'{a}}ndez{-}Baca},
  title        = {On the Advice Complexity of the Knapsack Problem},
  booktitle    = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
                  Arequipa, Peru, April 16-20, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7256},
  pages        = {61--72},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29344-3\_6},
  doi          = {10.1007/978-3-642-29344-3\_6},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/BockenhauerKKR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanianHLOR12,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {326--337},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.326},
  doi          = {10.4230/LIPICS.STACS.2012.326},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GanianHLOR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2011,
  editor       = {D{\'{a}}niel Marx and
                  Peter Rossmanith},
  title        = {Parameterized and Exact Computation - 6th International Symposium,
                  {IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7112},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-28050-4},
  doi          = {10.1007/978-3-642-28050-4},
  isbn         = {978-3-642-28049-8},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/2011.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-2780,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Linear Kernels on Graphs Excluding Topological Minors},
  journal      = {CoRR},
  volume       = {abs/1201.2780},
  year         = {2012},
  url          = {http://arxiv.org/abs/1201.2780},
  eprinttype    = {arXiv},
  eprint       = {1201.2780},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1201-2780.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0835,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  title        = {Linear kernels and single-exponential algorithms via protrusion decompositions},
  journal      = {CoRR},
  volume       = {abs/1207.0835},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0835},
  eprinttype    = {arXiv},
  eprint       = {1207.0835},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0835.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KneisLR11,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {A New Algorithm for Finding Trees with Many Leaves},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {4},
  pages        = {882--897},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9454-5},
  doi          = {10.1007/S00453-010-9454-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KneisLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KneisLR11,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {Courcelle's theorem - {A} game-theoretic approach},
  journal      = {Discret. Optim.},
  volume       = {8},
  number       = {4},
  pages        = {568--594},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.disopt.2011.06.001},
  doi          = {10.1016/J.DISOPT.2011.06.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KneisLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11,
  author       = {Daniel Binkele{-}Raible and
                  Ljiljana Brankovic and
                  Marek Cygan and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Marcin Pilipczuk and
                  Peter Rossmanith and
                  Jakub Onufry Wojtaszczyk},
  title        = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines
                  of attack},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {3},
  pages        = {214--230},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2011.03.002},
  doi          = {10.1016/J.JDA.2011.03.002},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChangLR11,
  author       = {Maw{-}Shang Chang and
                  Chuang{-}Chieh Lin and
                  Peter Rossmanith},
  title        = {A Property Tester for Tree-Likeness of Quartet Topologies},
  journal      = {Theory Comput. Syst.},
  volume       = {49},
  number       = {3},
  pages        = {576--587},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00224-010-9276-5},
  doi          = {10.1007/S00224-010-9276-5},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/ChangLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FernauKKLLRR11,
  author       = {Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  title        = {An exact algorithm for the Maximum Leaf Spanning Tree problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {45},
  pages        = {6290--6302},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2011.07.011},
  doi          = {10.1016/J.TCS.2011.07.011},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FernauKKLLRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Junosza-SzaniawskiKLRR11,
  author       = {Konstanty Junosza{-}Szaniawski and
                  Jan Kratochv{\'{\i}}l and
                  Mathieu Liedloff and
                  Peter Rossmanith and
                  Pawel Rzazewski},
  editor       = {Mitsunori Ogihara and
                  Jun Tarui},
  title        = {Fast Exact Algorithm for \emph{L}(2, 1)-Labeling of Graphs},
  booktitle    = {Theory and Applications of Models of Computation - 8th Annual Conference,
                  {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6648},
  pages        = {82--93},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20877-5\_9},
  doi          = {10.1007/978-3-642-20877-5\_9},
  timestamp    = {Sun, 25 Oct 2020 23:06:59 +0100},
  biburl       = {https://dblp.org/rec/conf/tamc/Junosza-SzaniawskiKLRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LangerRS11,
  author       = {Alexander Langer and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {Mitsunori Ogihara and
                  Jun Tarui},
  title        = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
                  Look Using Game Theory - (Extended Abstract)},
  booktitle    = {Theory and Applications of Models of Computation - 8th Annual Conference,
                  {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6648},
  pages        = {505--516},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20877-5\_49},
  doi          = {10.1007/978-3-642-20877-5\_49},
  timestamp    = {Sun, 21 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/LangerRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/voecking2011/Rossmanith11,
  author       = {Peter Rossmanith},
  editor       = {Berthold V{\"{o}}cking and
                  Helmut Alt and
                  Martin Dietzfelbinger and
                  R{\"{u}}diger Reischuk and
                  Christian Scheideler and
                  Heribert Vollmer and
                  Dorothea Wagner},
  title        = {Simulated Annealing},
  booktitle    = {Algorithms Unplugged},
  pages        = {393--400},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-15328-0\_41},
  doi          = {10.1007/978-3-642-15328-0\_41},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/sp/voecking2011/Rossmanith11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0908,
  author       = {Alexander Langer and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
                  Look Using Game Theory},
  journal      = {CoRR},
  volume       = {abs/1102.0908},
  year         = {2011},
  url          = {http://arxiv.org/abs/1102.0908},
  eprinttype    = {arXiv},
  eprint       = {1102.0908},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1102-0908.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3905,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {Courcelle's Theorem - {A} Game-Theoretic Approach},
  journal      = {CoRR},
  volume       = {abs/1104.3905},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.3905},
  eprinttype    = {arXiv},
  eprint       = {1104.3905},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-3905.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5804,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Lower Bounds on the Complexity of {MSO1} Model-Checking},
  journal      = {CoRR},
  volume       = {abs/1109.5804},
  year         = {2011},
  url          = {http://arxiv.org/abs/1109.5804},
  eprinttype    = {arXiv},
  eprint       = {1109.5804},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-5804.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChangLR10,
  author       = {Maw{-}Shang Chang and
                  Chuang{-}Chieh Lin and
                  Peter Rossmanith},
  title        = {New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency
                  Problem},
  journal      = {Theory Comput. Syst.},
  volume       = {47},
  number       = {2},
  pages        = {342--367},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00224-009-9165-y},
  doi          = {10.1007/S00224-009-9165-Y},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/ChangLR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/ChangHR10,
  author       = {Maw{-}Shang Chang and
                  Ling{-}Ju Hung and
                  Peter Rossmanith},
  editor       = {Taso Viglas and
                  Alex Potanin},
  title        = {Probe Distance-Hereditary Graphs},
  booktitle    = {Theory of Computing 2010, {CATS} 2010, Brisbane, Australia, January
                  2010},
  series       = {{CRPIT}},
  volume       = {109},
  pages        = {55--64},
  publisher    = {Australian Computer Society},
  year         = {2010},
  url          = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV109Chang.html},
  timestamp    = {Mon, 08 Feb 2021 13:26:48 +0100},
  biburl       = {https://dblp.org/rec/conf/cats/ChangHR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Binkele-RaibleBFKKLLR10,
  author       = {Daniel Binkele{-}Raible and
                  Ljiljana Brankovic and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Peter Rossmanith},
  editor       = {Tiziana Calamoneri and
                  Josep D{\'{\i}}az},
  title        = {A Parameterized Route to Exact Puzzles: Breaking the 2\({}^{\mbox{\emph{n}}}\)-Barrier
                  for Irredundance},
  booktitle    = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
                  Rome, Italy, May 26-28, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6078},
  pages        = {311--322},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13073-1\_28},
  doi          = {10.1007/978-3-642-13073-1\_28},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ciac/Binkele-RaibleBFKKLLR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GanianHKMORS10,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Daniel Meister and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {Are There Any Good Digraph Width Measures?},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {135--146},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_14},
  doi          = {10.1007/978-3-642-17493-3\_14},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/GanianHKMORS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1485,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Daniel Meister and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Are there any good digraph width measures?},
  journal      = {CoRR},
  volume       = {abs/1004.1485},
  year         = {2010},
  url          = {http://arxiv.org/abs/1004.1485},
  eprinttype    = {arXiv},
  eprint       = {1004.1485},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1004-1485.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KneisMRR09,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  title        = {A Bound on the Pathwidth of Sparse Graphs with Applications to Exact
                  Algorithms},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {1},
  pages        = {407--427},
  year         = {2009},
  url          = {https://doi.org/10.1137/080715482},
  doi          = {10.1137/080715482},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KneisMRR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockenhauerHKMR09,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Juraj Hromkovic and
                  Richard Kr{\'{a}}lovic and
                  Tobias M{\"{o}}mke and
                  Peter Rossmanith},
  title        = {Reoptimization of Steiner trees: Changing the terminal set},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {36},
  pages        = {3428--3435},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2008.04.039},
  doi          = {10.1016/J.TCS.2008.04.039},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BockenhauerHKMR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/KesdoganMRR09,
  author       = {Dogan Kesdogan and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Anna E. Frid and
                  Andrey Morozov and
                  Andrey Rybalchenko and
                  Klaus W. Wagner},
  title        = {Breaking Anonymity by Learning a Unique Minimum Hitting Set},
  booktitle    = {Computer Science - Theory and Applications, Fourth International Computer
                  Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
                  18-23, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5675},
  pages        = {299--309},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03351-3\_28},
  doi          = {10.1007/978-3-642-03351-3\_28},
  timestamp    = {Mon, 01 Mar 2021 13:46:21 +0100},
  biburl       = {https://dblp.org/rec/conf/csr/KesdoganMRR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RooijBR09,
  author       = {Johan M. M. van Rooij and
                  Hans L. Bodlaender and
                  Peter Rossmanith},
  editor       = {Amos Fiat and
                  Peter Sanders},
  title        = {Dynamic Programming on Tree Decompositions Using Generalised Fast
                  Subset Convolution},
  booktitle    = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
                  Denmark, September 7-9, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5757},
  pages        = {566--577},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-04128-0\_51},
  doi          = {10.1007/978-3-642-04128-0\_51},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/RooijBR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KneisLR09,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Ravi Kannan and
                  K. Narayan Kumar},
  title        = {A Fine-grained Analysis of a Simple Independent Set Algorithm},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
                  {IIT} Kanpur, India},
  series       = {LIPIcs},
  volume       = {4},
  pages        = {287--298},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2326},
  doi          = {10.4230/LIPICS.FSTTCS.2009.2326},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/KneisLR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FernauKKLLRR09,
  author       = {Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {An Exact Algorithm for the Maximum Leaf Spanning Tree Problem},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {161--172},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_13},
  doi          = {10.1007/978-3-642-11269-0\_13},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/FernauKKLLRR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GanianHKLOR09,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {On Digraph Width Measures in Parameterized Algorithmics},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {185--197},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_15},
  doi          = {10.1007/978-3-642-11269-0\_15},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/GanianHKLOR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4224,
  author       = {Ljiljana Brankovic and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  title        = {Breaking the 2{\^{}}n-Barrier for Irredundance: {A} Parameterized
                  Route to Solving Exact Puzzles},
  journal      = {CoRR},
  volume       = {abs/0909.4224},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.4224},
  eprinttype    = {arXiv},
  eprint       = {0909.4224},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-4224.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MolleRR08,
  author       = {Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  title        = {Enumerate and Expand: Improved Algorithms for Connected Vertex Cover
                  and Tree Cover},
  journal      = {Theory Comput. Syst.},
  volume       = {43},
  number       = {2},
  pages        = {234--253},
  year         = {2008},
  url          = {https://doi.org/10.1007/s00224-007-9089-3},
  doi          = {10.1007/S00224-007-9089-3},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/MolleRR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KneisLR08,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Seok{-}Hee Hong and
                  Hiroshi Nagamochi and
                  Takuro Fukunaga},
  title        = {A New Algorithm for Finding Trees with Many Leaves},
  booktitle    = {Algorithms and Computation, 19th International Symposium, {ISAAC}
                  2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5369},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92182-0\_26},
  doi          = {10.1007/978-3-540-92182-0\_26},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/KneisLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChangLR08,
  author       = {Maw{-}Shang Chang and
                  Chuang{-}Chieh Lin and
                  Peter Rossmanith},
  editor       = {Martin Grohe and
                  Rolf Niedermeier},
  title        = {New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency
                  Problem},
  booktitle    = {Parameterized and Exact Computation, Third International Workshop,
                  {IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5018},
  pages        = {66--77},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-79723-4\_8},
  doi          = {10.1007/978-3-540-79723-4\_8},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/ChangLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KneisLR08,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Hajo Broersma and
                  Thomas Erlebach and
                  Tom Friedetzky and
                  Dani{\"{e}}l Paulusma},
  title        = {Improved Upper Bounds for Partial Vertex Cover},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
                  {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5344},
  pages        = {240--251},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92248-3\_22},
  doi          = {10.1007/978-3-540-92248-3\_22},
  timestamp    = {Sun, 25 Oct 2020 23:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/KneisLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Rossmanith08,
  author       = {Peter Rossmanith},
  editor       = {Berthold V{\"{o}}cking and
                  Helmut Alt and
                  Martin Dietzfelbinger and
                  R{\"{u}}diger Reischuk and
                  Christian Scheideler and
                  Heribert Vollmer and
                  Dorothea Wagner},
  title        = {Simulated Annealing},
  booktitle    = {Taschenbuch der Algorithmen},
  series       = {eXamen.press},
  pages        = {423--431},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-76394-9\_43},
  doi          = {10.1007/978-3-540-76394-9\_43},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Rossmanith08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FuchsKMRRW07,
  author       = {Bernhard Fuchs and
                  Walter Kern and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith and
                  Xinhui Wang},
  title        = {Dynamic Programming for Minimum Steiner Trees},
  journal      = {Theory Comput. Syst.},
  volume       = {41},
  number       = {3},
  pages        = {493--500},
  year         = {2007},
  url          = {https://doi.org/10.1007/s00224-007-1324-4},
  doi          = {10.1007/S00224-007-1324-4},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/FuchsKMRRW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KneisMR07,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Peter Rossmanith},
  editor       = {Jan van Leeuwen and
                  Giuseppe F. Italiano and
                  Wiebe van der Hoek and
                  Christoph Meinel and
                  Harald Sack and
                  Frantisek Pl{\'{a}}sil},
  title        = {Partial vs. Complete Domination: t-Dominating Set},
  booktitle    = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
                  on Current Trends in Theory and Practice of Computer Science, Harrachov,
                  Czech Republic, January 20-26, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4362},
  pages        = {367--376},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-69507-3\_31},
  doi          = {10.1007/978-3-540-69507-3\_31},
  timestamp    = {Fri, 21 Oct 2022 16:47:28 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/KneisMR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KneisMRR06,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  title        = {Parameterized power domination complexity},
  journal      = {Inf. Process. Lett.},
  volume       = {98},
  number       = {4},
  pages        = {145--149},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ipl.2006.01.007},
  doi          = {10.1016/J.IPL.2006.01.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KneisMRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MolleRR06,
  author       = {Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Danny Z. Chen and
                  D. T. Lee},
  title        = {Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants},
  booktitle    = {Computing and Combinatorics, 12th Annual International Conference,
                  {COCOON} 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4112},
  pages        = {265--273},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11809678\_29},
  doi          = {10.1007/11809678\_29},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/MolleRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/MolleRR06,
  author       = {Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Dima Grigoriev and
                  John Harrison and
                  Edward A. Hirsch},
  title        = {Enumerate and Expand: Improved Algorithms for Connected Vertex Cover
                  and Tree Cover},
  booktitle    = {Computer Science - Theory and Applications, First International Symposium
                  on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia,
                  June 8-12, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3967},
  pages        = {270--280},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11753728\_28},
  doi          = {10.1007/11753728\_28},
  timestamp    = {Tue, 29 Nov 2022 13:36:56 +0100},
  biburl       = {https://dblp.org/rec/conf/csr/MolleRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KneisMRR06,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Tetsuo Asano},
  title        = {Intuitive Algorithms and t-Vertex Cover},
  booktitle    = {Algorithms and Computation, 17th International Symposium, {ISAAC}
                  2006, Kolkata, India, December 18-20, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4288},
  pages        = {598--607},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11940128\_60},
  doi          = {10.1007/11940128\_60},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/KneisMRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MolleRR06,
  author       = {Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Bruno Durand and
                  Wolfgang Thomas},
  title        = {A Faster Algorithm for the Steiner Tree Problem},
  booktitle    = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
                  Science, Marseille, France, February 23-25, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3884},
  pages        = {561--570},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11672142\_46},
  doi          = {10.1007/11672142\_46},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/MolleRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KneisMRR06,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Fedor V. Fomin},
  title        = {Divide-and-Color},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
                  {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4271},
  pages        = {58--67},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11917496\_6},
  doi          = {10.1007/11917496\_6},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/KneisMRR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KneisMRR05,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Joanna Jedrzejowicz and
                  Andrzej Szepietowski},
  title        = {On the Parameterized Complexity of Exact Satisfiability Problems},
  booktitle    = {Mathematical Foundations of Computer Science 2005, 30th International
                  Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3618},
  pages        = {568--579},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11549345\_49},
  doi          = {10.1007/11549345\_49},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/KneisMRR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KneisMRR05,
  author       = {Joachim Kneis and
                  Daniel M{\"{o}}lle and
                  Stefan Richter and
                  Peter Rossmanith},
  editor       = {Dieter Kratsch},
  title        = {Algorithms Based on the Treewidth of Sparse Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
                  {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3787},
  pages        = {385--396},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11604686\_34},
  doi          = {10.1007/11604686\_34},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/KneisMRR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrammNR03,
  author       = {Jens Gramm and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Fixed-Parameter Algorithms for {CLOSEST} {STRING} and Related Problems},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {1},
  pages        = {25--42},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1028-3},
  doi          = {10.1007/S00453-003-1028-3},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GrammNR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GrammHNR03,
  author       = {Jens Gramm and
                  Edward A. Hirsch and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Worst-case upper bounds for {MAX-2-SAT} with an application to {MAX-CUT}},
  journal      = {Discret. Appl. Math.},
  volume       = {130},
  number       = {2},
  pages        = {139--155},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00402-X},
  doi          = {10.1016/S0166-218X(02)00402-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GrammHNR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NiedermeierR03,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {On efficient fixed-parameter algorithms for weighted vertex cover},
  journal      = {J. Algorithms},
  volume       = {47},
  number       = {2},
  pages        = {63--77},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00005-1},
  doi          = {10.1016/S0196-6774(03)00005-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/NiedermeierR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NiedermeierR03,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {An efficient fixed-parameter algorithm for 3-Hitting Set},
  journal      = {J. Discrete Algorithms},
  volume       = {1},
  number       = {1},
  pages        = {89--102},
  year         = {2003},
  url          = {https://doi.org/10.1016/S1570-8667(03)00009-1},
  doi          = {10.1016/S1570-8667(03)00009-1},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/NiedermeierR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/RossmanithZ01,
  author       = {Peter Rossmanith and
                  Thomas Zeugmann},
  title        = {Stochastic Finite Learning of the Pattern Languages},
  journal      = {Mach. Learn.},
  volume       = {44},
  number       = {1/2},
  pages        = {67--91},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1010875913047},
  doi          = {10.1023/A:1010875913047},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/RossmanithZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachRSSZ01,
  author       = {Thomas Erlebach and
                  Peter Rossmanith and
                  Hans Stadtherr and
                  Angelika Steger and
                  Thomas Zeugmann},
  title        = {Learning one-variable pattern languages very efficiently on average,
                  in parallel, and by asking queries},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {119--156},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00136-5},
  doi          = {10.1016/S0304-3975(00)00136-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ErlebachRSSZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GrammNR01,
  author       = {Jens Gramm and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Peter Eades and
                  Tadao Takaoka},
  title        = {Exact Solutions for {CLOSEST} {STRING} and Related Problems},
  booktitle    = {Algorithms and Computation, 12th International Symposium, {ISAAC}
                  2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2223},
  pages        = {441--453},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45678-3\_38},
  doi          = {10.1007/3-540-45678-3\_38},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/GrammNR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/EsparzaRS00,
  author       = {Javier Esparza and
                  Peter Rossmanith and
                  Stefan Schwoon},
  title        = {A Uniform Framework for Problems on Context-Free Grammars},
  journal      = {Bull. {EATCS}},
  volume       = {72},
  pages        = {169--177},
  year         = {2000},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/EsparzaRS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NiedermeierR00,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {A general method to speed up fixed-parameter-tractable algorithms},
  journal      = {Inf. Process. Lett.},
  volume       = {73},
  number       = {3-4},
  pages        = {125--129},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00004-1},
  doi          = {10.1016/S0020-0190(00)00004-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/NiedermeierR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BouajjaniEFMRWW00,
  author       = {Ahmed Bouajjani and
                  Javier Esparza and
                  Alain Finkel and
                  Oded Maler and
                  Peter Rossmanith and
                  Bernard Willems and
                  Pierre Wolper},
  title        = {An efficient automata approach to some problems on context-free grammars},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {221--227},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00055-7},
  doi          = {10.1016/S0020-0190(00)00055-7},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BouajjaniEFMRWW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NiedermeierR00,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {New Upper Bounds for Maximum Satisfiability},
  journal      = {J. Algorithms},
  volume       = {36},
  number       = {1},
  pages        = {63--88},
  year         = {2000},
  url          = {https://doi.org/10.1006/jagm.2000.1075},
  doi          = {10.1006/JAGM.2000.1075},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/NiedermeierR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/EsparzaHRS00,
  author       = {Javier Esparza and
                  David Hansel and
                  Peter Rossmanith and
                  Stefan Schwoon},
  editor       = {E. Allen Emerson and
                  A. Prasad Sistla},
  title        = {Efficient Algorithms for Model Checking Pushdown Systems},
  booktitle    = {Computer Aided Verification, 12th International Conference, {CAV}
                  2000, Chicago, IL, USA, July 15-19, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1855},
  pages        = {232--247},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/10722167\_20},
  doi          = {10.1007/10722167\_20},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cav/EsparzaHRS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NiedermeyerR00,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {D. T. Lee and
                  Shang{-}Hua Teng},
  title        = {On Efficient Fixed Parameter Algorithms for {WEIGHTED} {VERTEX} {COVER}},
  booktitle    = {Algorithms and Computation, 11th International Conference, {ISAAC}
                  2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1969},
  pages        = {180--191},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-40996-3\_16},
  doi          = {10.1007/3-540-40996-3\_16},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/NiedermeyerR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-037,
  author       = {Jens Gramm and
                  Edward A. Hirsch and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {New Worst-Case Upper Bounds for {MAX-2-SAT} with Application to {MAX-CUT}},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR00-037}},
  year         = {2000},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-037/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR00-037},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR00-037.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KundeNRR99,
  author       = {Manfred Kunde and
                  Rolf Niedermeier and
                  Klaus Reinhardt and
                  Peter Rossmanith},
  title        = {Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals},
  journal      = {Algorithmica},
  volume       = {25},
  number       = {4},
  pages        = {438--458},
  year         = {1999},
  url          = {https://doi.org/10.1007/PL00009288},
  doi          = {10.1007/PL00009288},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KundeNRR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Rossmanith98,
  author       = {Peter Rossmanith},
  editor       = {Osamu Watanabe and
                  Takashi Yokomori},
  title        = {Learning from Random Text},
  booktitle    = {Algorithmic Learning Theory, 10th International Conference, {ALT}
                  '99, Tokyo, Japan, December 6-8, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1720},
  pages        = {132--144},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46769-6\_11},
  doi          = {10.1007/3-540-46769-6\_11},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/alt/Rossmanith98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/NiedermeierR99,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Jir{\'{\i}} Wiedermann and
                  Peter van Emde Boas and
                  Mogens Nielsen},
  title        = {New Upper Bounds for MaxSat},
  booktitle    = {Automata, Languages and Programming, 26th International Colloquium,
                  ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1644},
  pages        = {575--584},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48523-6\_54},
  doi          = {10.1007/3-540-48523-6\_54},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/NiedermeierR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NiedermeierR99,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Christoph Meinel and
                  Sophie Tison},
  title        = {Upper Bounds for Vertex Cover Further Improved},
  booktitle    = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
                  Science, Trier, Germany, March 4-6, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1563},
  pages        = {561--570},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-49116-3\_53},
  doi          = {10.1007/3-540-49116-3\_53},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/NiedermeierR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NiedermeierR98,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Unambiguous Computations and Locally Definable Acceptance Types},
  journal      = {Theor. Comput. Sci.},
  volume       = {194},
  number       = {1-2},
  pages        = {137--161},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0304-3975(97)00005-4},
  doi          = {10.1016/S0304-3975(97)00005-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NiedermeierR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/RossmanithZ98,
  author       = {Peter Rossmanith and
                  Thomas Zeugmann},
  editor       = {Vasant G. Honavar and
                  Giora Slutzki},
  title        = {Learning k-Variable Pattern Languages Efficiently Stochastically Finite
                  on Average from Positive Data},
  booktitle    = {Grammatical Inference, 4th International Colloquium, ICGI-98, Ames,
                  Iowa, USA, July 12-14, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1433},
  pages        = {13--24},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/BFb0054060},
  doi          = {10.1007/BFB0054060},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/icgi/RossmanithZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DammHR97,
  author       = {Carsten Damm and
                  Markus Holzer and
                  Peter Rossmanith},
  title        = {Expressing Uniformity via Oracles},
  journal      = {Theory Comput. Syst.},
  volume       = {30},
  number       = {4},
  pages        = {355--366},
  year         = {1997},
  url          = {https://doi.org/10.1007/s002240000056},
  doi          = {10.1007/S002240000056},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DammHR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/ErlebachRSSZ97,
  author       = {Thomas Erlebach and
                  Peter Rossmanith and
                  Hans Stadtherr and
                  Angelika Steger and
                  Thomas Zeugmann},
  editor       = {Ming Li and
                  Akira Maruoka},
  title        = {Learning One-Variable Pattern Languages Very Efficiently on Average,
                  in Parallel, and by Asking Queries},
  booktitle    = {Algorithmic Learning Theory, 8th International Conference, {ALT} '97,
                  Sendai, Japan, October 6-8, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1316},
  pages        = {260--276},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63577-7\_48},
  doi          = {10.1007/3-540-63577-7\_48},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/alt/ErlebachRSSZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/EsparzaR97,
  author       = {Javier Esparza and
                  Peter Rossmanith},
  editor       = {Christian Freksa and
                  Matthias Jantzen and
                  R{\"{u}}diger Valk},
  title        = {An Automata Approach to Some Problems on Context-Free Grammars},
  booktitle    = {Foundations of Computer Science: Potential - Theory - Cognition, to
                  Wilfried Brauer on the occasion of his sixtieth birthday},
  series       = {Lecture Notes in Computer Science},
  volume       = {1337},
  pages        = {143--152},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0052083},
  doi          = {10.1007/BFB0052083},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/EsparzaR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/NiedermeierR95,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in
                  Circuits},
  journal      = {Inf. Comput.},
  volume       = {118},
  number       = {2},
  pages        = {227--245},
  year         = {1995},
  url          = {https://doi.org/10.1006/inco.1995.1064},
  doi          = {10.1006/INCO.1995.1064},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/NiedermeierR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/NiedermeierR95,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {On Optimal Orow-Pram Algorithms for Computing Recursively Defined
                  Functions},
  journal      = {Parallel Process. Lett.},
  volume       = {5},
  pages        = {299--309},
  year         = {1995},
  url          = {https://doi.org/10.1142/S012962649500028X},
  doi          = {10.1142/S012962649500028X},
  timestamp    = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/NiedermeierR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/NiedermeierR95,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Horst Reichel},
  title        = {PRAM's Towards Realistic Parallelism: BRAM's},
  booktitle    = {Fundamentals of Computation Theory, 10th International Symposium,
                  {FCT} '95, Dresden, Germany, August 22-25, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {965},
  pages        = {363--373},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60249-6\_68},
  doi          = {10.1007/3-540-60249-6\_68},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/NiedermeierR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KundeNRR95,
  author       = {Manfred Kunde and
                  Rolf Niedermeier and
                  Klaus Reinhardt and
                  Peter Rossmanith},
  editor       = {Ernst W. Mayr and
                  Claude Puech},
  title        = {Optimal Average Case Sorting on Arrays},
  booktitle    = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer
                  Science, Munich, Germany, March 2-4, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {900},
  pages        = {503--514},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-59042-0\_100},
  doi          = {10.1007/3-540-59042-0\_100},
  timestamp    = {Sat, 07 Sep 2019 11:59:26 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KundeNRR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI95-01,
  author       = {Carsten Damm and
                  Markus Holzer and
                  Peter Rossmanith},
  title        = {Expressing Uniformity via Oracles},
  journal      = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
  volume       = {95-01},
  year         = {1995},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/tr/trier/MI95-01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Rossmanith94,
  author       = {Peter Rossmanith},
  title        = {Characterizations of memory access for PRAM's and bounds on the time
                  complexity of Boolean functions},
  school       = {Technical University Munich, Germany},
  year         = {1994},
  url          = {https://d-nb.info/943202728},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Rossmanith94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LangeR94,
  author       = {Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  title        = {Unambiguous Polynomial Hierarchies and Exponential Size},
  booktitle    = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
                  Amsterdam, The Netherlands, June 28 - July 1, 1994},
  pages        = {106--115},
  publisher    = {{IEEE} Computer Society},
  year         = {1994},
  url          = {https://doi.org/10.1109/SCT.1994.315812},
  doi          = {10.1109/SCT.1994.315812},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LangeR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KundeNR94,
  author       = {Manfred Kunde and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Patrice Enjalbert and
                  Ernst W. Mayr and
                  Klaus W. Wagner},
  title        = {Faster Sorting and Routing on Grids with Diagonals},
  booktitle    = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
                  Science, Caen, France, February 24-26, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {775},
  pages        = {225--236},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-57785-8\_144},
  doi          = {10.1007/3-540-57785-8\_144},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KundeNR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/DammHLR93,
  author       = {Carsten Damm and
                  Markus Holzer and
                  Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  editor       = {Grzegorz Rozenberg and
                  Arto Salomaa},
  title        = {Deterministic {OL} Languages are of Very Low Complexity: {DOL} is
                  in AC\({}^{\mbox{0}}\)},
  booktitle    = {Developments in Language Theory, At the Crossroads of Mathematics,
                  Computer Science and Biology, Turku, Finland, 12-15 July 1993},
  pages        = {305--313},
  publisher    = {World Scientific, Singapore},
  year         = {1993},
  timestamp    = {Fri, 26 May 2017 12:54:39 +0200},
  biburl       = {https://dblp.org/rec/conf/dlt/DammHLR93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NiedermeierR93,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Kam{-}Wing Ng and
                  Prabhakar Raghavan and
                  N. V. Balasubramanian and
                  Francis Y. L. Chin},
  title        = {On the Power of Reading and Writing Simultaneously in Parallel Computation},
  booktitle    = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
                  Hong Kong, December 15-17, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {762},
  pages        = {240--249},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57568-5\_254},
  doi          = {10.1007/3-540-57568-5\_254},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/NiedermeierR93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NiedermeierR93,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Patrice Enjalbert and
                  Alain Finkel and
                  Klaus W. Wagner},
  title        = {Extended Locally Definable Acceptance Types (Extended Abstract)},
  booktitle    = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
                  Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {665},
  pages        = {473--483},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-56503-5\_47},
  doi          = {10.1007/3-540-56503-5\_47},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/NiedermeierR93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9313,
  author       = {Manfred Kunde and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Faster sorting and routing on grids with diagonals},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9313},
  pages        = {1--31},
  year         = {1993},
  url          = {https://d-nb.info/940414147},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9313.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RossmanithR92,
  author       = {Peter Rossmanith and
                  Wojciech Rytter},
  title        = {Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's},
  journal      = {Inf. Process. Lett.},
  volume       = {44},
  number       = {5},
  pages        = {267--272},
  year         = {1992},
  url          = {https://doi.org/10.1016/0020-0190(92)90212-E},
  doi          = {10.1016/0020-0190(92)90212-E},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RossmanithR92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/NiedermeierR92,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  editor       = {Imre Simon},
  title        = {Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits
                  (Extended Abstract)},
  booktitle    = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
                  S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {583},
  pages        = {387--400},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/BFb0023843},
  doi          = {10.1007/BFB0023843},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/NiedermeierR92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LangeRR92,
  author       = {Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith and
                  Wojciech Rytter},
  editor       = {Ivan M. Havel and
                  V{\'{a}}clav Koubek},
  title        = {Parallel Recognition and Ranking of Context-Free Languages},
  booktitle    = {Mathematical Foundations of Computer Science 1992, 17th International
                  Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {629},
  pages        = {24--36},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-55808-X\_3},
  doi          = {10.1007/3-540-55808-X\_3},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LangeRR92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LangeR92,
  author       = {Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  editor       = {Ivan M. Havel and
                  V{\'{a}}clav Koubek},
  title        = {The Emptiness Problem for Intersections of Regular Languages},
  booktitle    = {Mathematical Foundations of Computer Science 1992, 17th International
                  Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {629},
  pages        = {346--354},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-55808-X\_33},
  doi          = {10.1007/3-540-55808-X\_33},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LangeR92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9218,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Optimal parallel algorithms for computing recursively defined functions},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9218},
  pages        = {1--28},
  year         = {1992},
  url          = {https://d-nb.info/941465233},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9218.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BuntrockJLR91,
  author       = {Gerhard Buntrock and
                  Birgit Jenner and
                  Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  editor       = {Lothar Budach},
  title        = {Unambiguity and Fewness for Logarithmic Space},
  booktitle    = {Fundamentals of Computation Theory, 8th International Symposium, {FCT}
                  '91, Gosen, Germany, September 9-13, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {529},
  pages        = {168--179},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/3-540-54458-5\_61},
  doi          = {10.1007/3-540-54458-5\_61},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/BuntrockJLR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/NiepelR91,
  author       = {Inga Niepel and
                  Peter Rossmanith},
  editor       = {Somenath Biswas and
                  Kesav V. Nori},
  title        = {Uniform Circuits and Exclusive Read PRAMs},
  booktitle    = {Foundations of Software Technology and Theoretical Computer Science,
                  11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {560},
  pages        = {307--318},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/3-540-54967-6\_77},
  doi          = {10.1007/3-540-54967-6\_77},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/NiepelR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Rossmanith91,
  author       = {Peter Rossmanith},
  editor       = {Christian Choffrut and
                  Matthias Jantzen},
  title        = {The Owner Concept for PRAMs},
  booktitle    = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
                  Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {480},
  pages        = {172--183},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/BFb0020797},
  doi          = {10.1007/BFB0020797},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Rossmanith91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LangeR90,
  author       = {Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  editor       = {Branislav Rovan},
  title        = {Characterizing Unambiguous Augmented Pushdown Automata by Circuits},
  booktitle    = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
                  Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {452},
  pages        = {399--406},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/BFb0029635},
  doi          = {10.1007/BFB0029635},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LangeR90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9006,
  author       = {Klaus{-}J{\"{o}}rn Lange and
                  Peter Rossmanith},
  title        = {Two results on unambiguous circuits},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9006},
  pages        = {1--29},
  year         = {1990},
  url          = {https://d-nb.info/920916287},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9006.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9028,
  author       = {Peter Rossmanith},
  title        = {The owner concept for PRAMs},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9028},
  pages        = {1--30},
  year         = {1990},
  url          = {https://d-nb.info/920791948},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9028.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9054,
  author       = {Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Unambiguous simulations of auxiliary pushdown automata and circuits},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9054},
  pages        = {1--38},
  year         = {1990},
  url          = {https://d-nb.info/920791824},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9054.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/tum/TUM-I-9055,
  author       = {Inga Niepel and
                  Peter Rossmanith},
  title        = {Uniform circuits and exclusive read PRAMs},
  journal      = {Forschungsberichte, {TU} Munich},
  volume       = {{TUM} {I} 9055},
  pages        = {1--34},
  year         = {1990},
  url          = {https://d-nb.info/920791808},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/tr/tum/TUM-I-9055.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics