Peter Rossmanith

Recent Publications

First-Order Model-Checking in Random Graphs and Complex Networks
Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith
28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite
Hard Problems on Random Graphs
Jan Niclas Dreier, Henri Lotze, Peter Rossmanith
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 40:1-40:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
PDF Cite DOI
Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size
Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite DOI
The Complexity of Packing Edge-Disjoint Paths
Jan Niclas Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1-10:16, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
PDF Cite DOI
Are There Any Good Digraph Measures?
Robert Ganian, Petr Hlinen ́Y, Joachim Kneis, Daniel Meister, Jan Obdrz\ĺek, Peter Rossmanith, Somnath Sikdar
Journal of Combinatorial Theory, Series B, volume 116, pages 250-286, 2016.
Cite