Pascal Kunz
Papers
1
Total Citations
4
H-Index
1
About
Pascal Kunz is a rising researcher in theoretical computer science, with a primary focus on temporal graphs and the algorithmic complexity of path and walk problems within them. His work addresses fundamental questions about how to efficiently find temporally disjoint paths and walks—structures that must not only avoid sharing vertices but also cannot occupy the same vertex at the same time step. Kunz’s most-cited paper, “In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?” (2023), systematically explores the computational boundaries of this problem, identifying graph classes where the problem becomes tractable versus those where it remains hard. This contribution is crucial for applications in dynamic network routing, communication scheduling, and logistics, where time-respecting connectivity is essential. Although early in his career, his work has already garnered attention, with his top paper accumulating 4 citations. Kunz’s research is notable for its clarity in bridging graph theory and algorithm design, offering a rigorous framework for understanding temporal constraints. For students and researchers, his work provides a compelling entry point into the growing field of temporal networks, highlighting how structural properties can unlock efficient solutions in dynamic environments.
Research Focus
Key Achievements
Top Papers
- 1