Pascal Kunz

Orcid: 0000-0002-0787-8428

According to our database1, Pascal Kunz authored at least 10 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Disentangling the Computational Complexity of Network Untangling.
Theory Comput. Syst., February, 2024

2023
Approximate Turing Kernelization and Lower Bounds for Domination Problems.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On Computing Optimal Tree Ensembles.
Proceedings of the International Conference on Machine Learning, 2023

Parameterized Algorithms for Colored Clustering.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2019
Computational complexity aspects of point visibility graphs.
Discret. Appl. Math., 2019

2017
Algorithmic Aspects of Point Visibility Graphs.
CoRR, 2017


  Loading...