Philipp Zschoche

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