Skip to content

Philipp Zschoche

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

16

Venues

10

Active years

2017–2023

Best venue rank

A*

Where they publish

Papers

16 indexed papers, newest first.

YearVenueTitleAuthors
2023STACSRestless Temporal Path Parameterized Above Lower Bounds.Philipp Zschoche
2022IJCAIDisentangling the Computational Complexity of Network Untangling.Vincent Froese, Pascal Kunz, Philipp Zschoche
2021ESAParameterized Algorithms for Diverse Multistage Problems.Leon Kellerhals, Malte Renken, Philipp Zschoche
2021ICALPUsing a Geometric Lens to Find k Disjoint Shortest Paths.Matthias Bentert, Andr Nichterlein, Malte Renken, Philipp Zschoche
2021IJCAIInterference-free Walks in Time: Temporally Disjoint Paths.Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2021MFCSThe Complexity of Transitively Orienting Temporal Graphs.George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
2021MFCSTemporal Reachability Minimization: Delaying vs. Deleting.Hendrik Molter, Malte Renken, Philipp Zschoche
2021SPAAOptimal Virtual Network Embeddings for Tree Topologies.Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
2020ISAACFinding Temporal Paths Under Waiting Time Constraints.Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
2020ISAACMultistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2020STACSComputing Maximum Matchings in Temporal Graphs.George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2019CIACFixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.Ren van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2018ESAData Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.Viatcheslav Korenwein, Andr Nichterlein, Rolf Niedermeier, Philipp Zschoche
2018MFCSThe Complexity of Finding Small Separators in Temporal Graphs.Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2018WGTemporal Graph Classes: A View Through Temporal Separators.Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2017TAMCOn the Computational Complexity of Variants of Combinatorial Voter Control in Elections.Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen