Algorithmic Aspects of Point Visibility Graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (CoRR, 2017)

Computational complexity aspects of point visibility graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (Discret. Appl. Math., 2019)

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001 (IPEC, 2022)

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. - Till Fluschnik; Pascal Kunz 001 (SAND, 2022)

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. - Pascal Kunz 001; Till Fluschnik; Rolf Niedermeier; Malte Renken (SWAT, 2022)

Parameterized Algorithms for Colored Clustering. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001; Rolf Niedermeier (AAAI, 2023)

On Computing Optimal Tree Ensembles. - Christian Komusiewicz; Pascal Kunz 001; Frank Sommer; Manuel Sorge (ICML, 2023)

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? - Pascal Kunz 001; Hendrik Molter; Meirav Zehavi (IJCAI, 2023)

Approximate Turing Kernelization and Lower Bounds for Domination Problems. - Stefan Kratsch; Pascal Kunz 001 (IPEC, 2023)

Disentangling the Computational Complexity of Network Untangling. - Vincent Froese; Pascal Kunz 001; Philipp Zschoche (Theory Comput. Syst., 2024)

Efficient parameterized approximation. - Stefan Kratsch; Pascal Kunz 001 (CoRR, 2025)