Philipp Zschoche

Orcid: 0000-0001-9846-0600

According to our database1, Philipp Zschoche authored at least 28 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Disentangling the Computational Complexity of Network Untangling.
Theory Comput. Syst., February, 2024

2023
Computing maximum matchings in temporal graphs.
J. Comput. Syst. Sci., November, 2023

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.
SIAM J. Discret. Math., September, 2023

Multistage s-t Path: Confronting Similarity with Dissimilarity.
Algorithmica, July, 2023

Interference-free walks in time: temporally disjoint paths.
Auton. Agents Multi Agent Syst., 2023

Restless Temporal Path Parameterized Above Lower Bounds.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Multistage Vertex Cover.
Theory Comput. Syst., 2022

A faster parameterized algorithm for temporal matching.
Inf. Process. Lett., 2022

2021
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.
ACM J. Exp. Algorithmics, 2021

Representative families for matroid intersections, with applications to location, packing, and covering problems.
Discret. Appl. Math., 2021

Finding Temporal Paths Under Waiting Time Constraints.
Algorithmica, 2021

Optimal Virtual Network Embeddings for Tree Topologies.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Temporal Reachability Minimization: Delaying vs. Deleting.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Complexity of Transitively Orienting Temporal Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Parameterized Algorithms for Diverse Multistage Problems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Temporal graph classes: A view through temporal separators.
Theor. Comput. Sci., 2020

The complexity of finding small separators in temporal graphs.
J. Comput. Syst. Sci., 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

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

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

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

Temporal Graph Classes: A View Through Temporal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
The Computational Complexity of Finding Separators in Temporal Graphs.
CoRR, 2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
Proceedings of the Theory and Applications of Models of Computation, 2017


  Loading...