Algorithmics and Computational Complexity

Curriculum Vitae

since June 2021PhD student TU Berlin

Research interests

Parameterized complexity
Graph problems

Publication list


T. Fluschnik and P. Kunz, "Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring" in Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND '22), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 16:1–16:18.
V. Froese, P. Kunz and P. Zschoche, "Disentangling the Computational Complexity of Network Untangling" in Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI '22), International Joint Conferences on Artificial Intelligence Organization, 2022. pp. 2037–2043.
T. Fluschnik, P. Kunz, R. Niedermeier and M. Renken, "Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives" in Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '22), 2022.
L. Kellerhals, T. Koana and P. Kunz, "Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees" in Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC 22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 19:1–19:14.


A. Himmel, C. Hoffmann, P. Kunz, V. Froese and M. Sorge, "Computational complexity aspects of point visibility graphs" , Discrete Applied Mathematics, vol. 254, pp. 283–290, 2019.