Publications

Leon Kellerhals, Malte Renken, and Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems.
ESA 2021  |  arXiv (2021)  |  BibTeX

Hendrik Molter, Malte Renken, and Philipp Zschoche:
Temporal Reachability Minimization - Delaying vs. Deleting.
MFCS 2021  |  arXiv (2021)  |  BibTeX

George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, and Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs.
MFCS 2021  |  arXiv (2021)  |  BibTeX

Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche:
Interference-free Walks in Time - Temporally Disjoint Paths.
IJCAI 2021  |  arXiv (2021)  |  BibTeX

Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, and Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies.
SPAA 2021  |  arXiv (2021)  |  BibTeX

Matthias Bentert, André Nichterlein, Malte Renken, and Philipp Zschoche:
Using a Geometric Lens to Find k Disjoint Shortest Paths.
ICALP 2021  |  arXiv (2020)  |  BibTeX

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche:
Finding Temporal Paths Under Waiting Time Constraints.
Algorithmica (2021)  |  ISAAC 2020  |  arXiv (2019)  |  BibTeX

René van Bevern, Oxana Yu. Tsidulko, and Philipp Zschoche:
Representative families for matroid intersections, with applications to location, packing, and covering problems.
Discret. Appl. Math. (2021)  |  CIAC 2019  |  BibTeX

Till Fluschnik, Rolf Niedermeier, Carsten Schubert, and Philipp Zschoche:
Multistage s-t Path - Confronting Similarity with Dissimilarity in Temporal Graphs.
ISAAC 2020  |  arXiv (2020)  |  BibTeX

Philipp Zschoche:
A Faster Parameterized Algorithm for Temporal Matching.
arXiv (2020)  |  BibTeX

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, and Philipp Zschoche:
Temporal graph classes - A view through temporal separators.
Theor. Comput. Sci. (2020)  |  BibTeX

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, and Philipp Zschoche:
As Time Goes By - Reflections on Treewidth for Temporal Graphs.
Treewidth, Kernels, and Algorithms 2020  |  arXiv (2020)  |  BibTeX

George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs.
STACS 2020  |  arXiv (2019)  |  BibTeX

Philipp Zschoche, Till Fluschnik, Hendrik Molter, and Rolf Niedermeier:
The complexity of finding small separators in temporal graphs.
J. Comput. Syst. Sci. (2020)  |  MFCS 2018  |  BibTeX

Till Fluschnik, Rolf Niedermeier, Valentin Rohm, and Philipp Zschoche:
Multistage Vertex Cover.
IPEC 2019  |  arXiv (2019)  |  BibTeX

Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, and Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs - Theory and Experiments.
ESA 2018  |  BibTeX