On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. - Leon Kellerhals; Viatcheslav Korenwein; Philipp Zschoche; Robert Bredereck; Jiehua Chen 001 (TAMC, 2017)

The Computational Complexity of Finding Separators in Temporal Graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (CoRR, 2017)

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. - Viatcheslav Korenwein; André Nichterlein; Rolf Niedermeier; Philipp Zschoche (ESA, 2018)

Temporal Graph Classes: A View Through Temporal Separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Philipp Zschoche (WG, 2018)

Facility location under matroid constraints: fixed-parameter algorithms and applications. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CoRR, 2018)

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CIAC, 2019)

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (CoRR, 2019)

As Time Goes By: Reflections on Treewidth for Temporal Graphs. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Treewidth, Kernels, and Algorithms, 2020)

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. - Till Fluschnik; Rolf Niedermeier; Carsten Schubert; Philipp Zschoche (ISAAC, 2020)

The complexity of finding small separators in temporal graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (J. Comput. Syst. Sci., 2020)

Temporal graph classes: A view through temporal separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Theor. Comput. Sci., 2020)

Parameterized Algorithms for Diverse Multistage Problems. - Leon Kellerhals; Malte Renken; Philipp Zschoche (ESA, 2021)

Using a Geometric Lens to Find k Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (ICALP, 2021)

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. - Leon Kellerhals; Tomohiro Koana; André Nichterlein; Philipp Zschoche (IPEC, 2021)

Optimal Virtual Network Embeddings for Tree Topologies. - Aleksander Figiel; Leon Kellerhals; Rolf Niedermeier; Matthias Rost; Stefan Schmid 001; Philipp Zschoche (SPAA, 2021)

Finding Temporal Paths Under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (Algorithmica, 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)

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)

A faster parameterized algorithm for temporal matching. - Philipp Zschoche (Inf. Process. Lett., 2022)

Multistage Vertex Cover. - Till Fluschnik; Rolf Niedermeier; Valentin Rohm; Philipp Zschoche (Theory Comput. Syst., 2022)

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

Restless Temporal Path Parameterized Above Lower Bounds. - Philipp Zschoche (STACS, 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)

Multistage s-t Path: Confronting Similarity with Dissimilarity. - Till Fluschnik; Rolf Niedermeier; Carsten Schubert; Philipp Zschoche (Algorithmica, 2023)

Using a Geometric Lens to Find ( boldsymbol{k} )-Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (SIAM J. Discret. Math., 2023)

Computing maximum matchings in temporal graphs. - George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Viktor Zamaraev; Philipp Zschoche (J. Comput. Syst. Sci., 2023)

Temporal reachability minimization: Delaying vs. deleting. - Hendrik Molter; Malte Renken; Philipp Zschoche (J. Comput. Syst. Sci., 2024)

Disentangling the Computational Complexity of Network Untangling. - Vincent Froese; Pascal Kunz 001; Philipp Zschoche (Theory Comput. Syst., 2024)

The complexity of transitively orienting temporal graphs. - George B. Mertzios; Hendrik Molter; Malte Renken; Paul G. Spirakis; Philipp Zschoche (J. Comput. Syst. Sci., 2025)