Philipp Zschoche

Papers

Total Citations

H-Index

About

Philipp Zschoche is a rising star in algorithm design and temporal graph theory, whose work tackles fundamental challenges in dynamic networks. His primary research focus lies in the computational complexity of temporal graphs—networks where edges appear and disappear over time—with a particular emphasis on finding interference-free paths and walks. Zschoche’s major contribution is formalizing and solving the problem of temporally disjoint paths, which are routes that not only respect time constraints but also avoid sharing any time step or vertex. This has profound implications for scheduling, communication networks, and logistics, where non-overlapping routes are critical. His most-cited paper, "Interference-free walks in time: temporally disjoint paths" (2022), has already garnered 15 citations, reflecting its immediate impact on the field. By rigorously analyzing the computational complexity of these problems, Zschoche has provided both polynomial-time algorithms for restricted cases and hardness proofs for general settings, offering a clear roadmap for future research. His work bridges theoretical computer science and real-world applications, making him a key voice in the evolving study of time-varying networks.