Peter Rossmanith

Recent Publications

First-Order Model-Checking in Random Graphs and Complex Networks
28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hard Problems on Random Graphs
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.
Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hardness of FO Model-Checking on Random Graphs
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of LIPIcs, pages 11:1-11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Motif Counting in Preferential Attachment Graphs
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), volume 150 of LIPIcs, pages 13:1-13:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.