Philipp Kuinke

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.
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.
The Complexity of Packing Edge-Disjoint Paths
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.
Local Structure Theorems for Erdos-R\'enyi Graphs and Their Algorithmic Applications
44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of Lecture Notes in Computer Science, pages 125-136, 2018, Springer.