Philipp Zschoche

According to our database, Philipp Zschoche authored at least 29 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Disentangling the Computational Complexity of Network Untangling.

Vincent Froese, Pascal Kunz, Philipp Zschoche

Theory Comput. Syst., February, 2024

Temporal reachability minimization: Delaying vs. deleting.

Hendrik Molter, Malte Renken, Philipp Zschoche

J. Comput. Syst. Sci., 2024

2023

Computing maximum matchings in temporal graphs.

George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche

J. Comput. Syst. Sci., November, 2023

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.

Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche

SIAM J. Discret. Math., September, 2023

Multistage s-t Path: Confronting Similarity with Dissimilarity.

Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche

Algorithmica, July, 2023

Interference-free walks in time: temporally disjoint paths.

Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche

Auton. Agents Multi Agent Syst., 2023

Restless Temporal Path Parameterized Above Lower Bounds.

Philipp Zschoche

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Parameterized algorithmics for time-evolving structures: temporalizing and multistaging (Parametrisierte Algorithmik für zeitabhängige Strukturen: Temporalisierung and Mehrstufigkeit)

Philipp Zschoche

PhD thesis, 2022

Multistage Vertex Cover.

Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche

Theory Comput. Syst., 2022

A faster parameterized algorithm for temporal matching.

Philipp Zschoche

Inf. Process. Lett., 2022

2021

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche

ACM J. Exp. Algorithmics, 2021

Representative families for matroid intersections, with applications to location, packing, and covering problems.

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

Discret. Appl. Math., 2021

Finding Temporal Paths Under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

Algorithmica, 2021

Optimal Virtual Network Embeddings for Tree Topologies.

Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

The Complexity of Transitively Orienting Temporal Graphs.

George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.

Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.

Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Parameterized Algorithms for Diverse Multistage Problems.

Leon Kellerhals, Malte Renken, Philipp Zschoche

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Temporal graph classes: A view through temporal separators.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Theor. Comput. Sci., 2020

The complexity of finding small separators in temporal graphs.

Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier

J. Comput. Syst. Sci., 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.

Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

CoRR, 2019

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Facility location under matroid constraints: fixed-parameter algorithms and applications.

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

CoRR, 2018

Temporal Graph Classes: A View Through Temporal Separators.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

The Computational Complexity of Finding Separators in Temporal Graphs.

Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier

CoRR, 2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.

Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen

Proceedings of the Theory and Applications of Models of Computation, 2017