Pascal Kunz

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 19

Top Topics

Parameterized Complexity

Polynomial Time Approximation

Graph Structure

Top Venues

Publications

Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68 (1) (2024)
Stefan Kratsch, Pascal Kunz
Approximate Turing Kernelization and Lower Bounds for Domination Problems. IPEC (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. ICML (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. CoRR (2023)
Stefan Kratsch, Pascal Kunz
Approximate Turing kernelization and lower bounds for domination problems. CoRR (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. CoRR (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. AAAI (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. IJCAI (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. CoRR (2022)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC (2022)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT (2022)
Till Fluschnik, Pascal Kunz
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND (2022)
Till Fluschnik, Pascal Kunz
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. CoRR (2021)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR (2021)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254 (2019)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Algorithmic Aspects of Point Visibility Graphs. CoRR (2017)