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

Matthias Bentert, André Nichterlein, Malte Renken, and Philipp Zschoche:
Using a geometric lens to find k disjoint shortest paths.
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:
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

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, and Philipp Zschoche:
Temporal graph classes - A view through temporal separators.
Theor. Comput. Sci. (2020)  |  WG 2018  |  arXiv (2018)  |  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  |  arXiv (2017)  |  BibTeX

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

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche:
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.
arXiv (2019)  |  BibTeX

René van Bevern, Oxana Yu. Tsidulko, and Philipp Zschoche:
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.
CIAC 2019  |  arXiv (2018)  |  BibTeX

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

Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, and Jiehua Chen 0001:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
TAMC 2017  |  arXiv (2017)  |  BibTeX