Pascal Kunz

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