| In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? P Kunz, H Molter, M Zehavi arXiv preprint arXiv:2301.10503, 2023 | 8 | 2023 |
| Computational complexity aspects of point visibility graphs AS Himmel, C Hoffmann, P Kunz, V Froese, M Sorge Discrete Applied Mathematics 254, 283-290, 2019 | 8 | 2019 |
| Disentangling the computational complexity of network untangling V Froese, P Kunz, P Zschoche arXiv preprint arXiv:2204.02668, 2022 | 7 | 2022 |
| Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees L Kellerhals, T Koana, P Kunz arXiv preprint arXiv:2203.05887, 2022 | 4 | 2022 |
| Parameterized Algorithms for Colored Clustering L Kellerhals, T Koana, P Kunz, R Niedermeier arXiv preprint arXiv:2302.00630, 2023 | 3 | 2023 |
| On Computing Optimal Tree Ensembles C Komusiewicz, P Kunz, F Sommer, M Sorge arXiv preprint arXiv:2306.04423, 2023 | 2 | 2023 |
| Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring T Fluschnik, P Kunz arXiv preprint arXiv:2111.09049, 2021 | 2 | 2021 |
| Approximate Turing kernelization and lower bounds for domination problems S Kratsch, P Kunz arXiv preprint arXiv:2307.02241, 2023 | | 2023 |
| Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives P Kunz, T Fluschnik, R Niedermeier, M Renken arXiv preprint arXiv:2107.04321, 2021 | | 2021 |
