Philipp Zschoche

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 51

Top Topics

Temporal Information

Facility Location

Top Venues

J. Comput. Syst. Sci.

Publications

Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68 (1) (2024)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. 144 (2024)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85 (7) (2023)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137 (2023)
Philipp Zschoche
Restless Temporal Path Parameterized Above Lower Bounds. STACS (2023)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37 (3) (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. Theory Comput. Syst. 66 (2) (2022)
Philipp Zschoche
A faster parameterized algorithm for temporal matching. Inf. Process. Lett. 174 (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. IJCAI (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. CoRR (2022)
Philipp Zschoche
Restless Temporal Path Parameterized Above Lower Bounds. CoRR (2022)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. CoRR (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR (2021)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal Reachability Minimization: Delaying vs. Deleting. CoRR (2021)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. 298 (2021)
Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC (2021)
Leon Kellerhals, Malte Renken, Philipp Zschoche
Parameterized Algorithms for Diverse Multistage Problems. CoRR (2021)
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
Optimal Virtual Network Embeddings for Tree Topologies. CoRR (2021)
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
Optimal Virtual Network Embeddings for Tree Topologies. SPAA (2021)
Leon Kellerhals, Malte Renken, Philipp Zschoche
Parameterized Algorithms for Diverse Multistage Problems. ESA (2021)
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26 (2021)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal Reachability Minimization: Delaying vs. Deleting. MFCS (2021)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83 (9) (2021)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. MFCS (2021)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI (2021)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR (2020)
Philipp Zschoche
A Faster Parameterized Algorithm for Temporal Matching. CoRR (2020)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms (2020)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC (2020)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a geometric lens to find k disjoint shortest paths. CoRR (2020)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. STACS (2020)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107 (2020)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. ISAAC (2020)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806 (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. CoRR (2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. IPEC (2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. CoRR (2019)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC (2019)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR (2019)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. WG (2018)
Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR (2018)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR (2018)
Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA (2018)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. CoRR (2018)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Complexity of Finding Small Separators in Temporal Graphs. MFCS (2018)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR (2017)
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR (2017)
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC (2017)