| The Complexity of Finding Small Separators in Temporal Graphs P Zschoche, T Fluschnik, H Molter, R Niedermeier arXiv preprint arXiv:1711.00963, 2017 | 110* | 2017 |
| Finding temporal paths under waiting time constraints A Casteigts, AS Himmel, H Molter, P Zschoche Algorithmica 83 (9), 2754-2802, 2021 | 103* | 2021 |
| Temporal graph classes: A view through temporal separators T Fluschnik, H Molter, R Niedermeier, M Renken, P Zschoche Theoretical Computer Science 806, 197-218, 2020 | 72 | 2020 |
| Computing maximum matchings in temporal graphs GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche Journal of Computer and System Sciences 137, 1-19, 2023 | 48 | 2023 |
| Data reduction for maximum matching on real-world graphs: Theory and experiments T Koana, V Korenwein, A Nichterlein, R Niedermeier, P Zschoche arXiv preprint arXiv:1806.09683, 2018 | 45 | 2018 |
| Multistage vertex cover T Fluschnik, R Niedermeier, V Rohm, P Zschoche Theory of Computing Systems 66 (2), 454-483, 2022 | 38 | 2022 |
| Multistage s–t Path: Confronting Similarity with Dissimilarity T Fluschnik, R Niedermeier, C Schubert, P Zschoche Algorithmica 85 (7), 2028-2064, 2023 | 25* | 2023 |
| Interference-free walks in time: Temporally disjoint paths N Klobas, GB Mertzios, H Molter, R Niedermeier, P Zschoche Autonomous Agents and Multi-Agent Systems 37 (1), 1, 2023 | 24 | 2023 |
| Temporal reachability minimization: Delaying vs. deleting H Molter, M Renken, P Zschoche Journal of Computer and System Sciences 144, 103549, 2024 | 22 | 2024 |
| Representative families for matroid intersections, with applications to location, packing, and covering problems R van Bevern, OY Tsidulko, P Zschoche Discrete Applied Mathematics 298, 110-128, 2021 | 19* | 2021 |
| As time goes by: reflections on treewidth for temporal graphs T Fluschnik, H Molter, R Niedermeier, M Renken, P Zschoche Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender …, 2020 | 19 | 2020 |
| Using a Geometric Lens to Find -Disjoint Shortest Paths M Bentert, A Nichterlein, M Renken, P Zschoche SIAM Journal on Discrete Mathematics 37 (3), 1674-1703, 2023 | 18 | 2023 |
| The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing L Kellerhals, T Koana, A Nichterlein, P Zschoche 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021 | 17 | 2021 |
| The complexity of transitively orienting temporal graphs GB Mertzios, H Molter, M Renken, PG Spirakis, P Zschoche arXiv preprint arXiv:2102.06783, 2021 | 15 | 2021 |
| Parameterized algorithms for diverse multistage problems L Kellerhals, M Renken, P Zschoche arXiv preprint arXiv:2105.04856, 2021 | 13 | 2021 |
| Disentangling the computational complexity of network untangling V Froese, P Kunz, P Zschoche Theory of Computing Systems 68 (1), 103-121, 2024 | 7 | 2024 |
| A faster parameterized algorithm for temporal matching P Zschoche Information Processing Letters 174, 106181, 2022 | 6 | 2022 |
| Restless temporal path parameterized above lower bounds P Zschoche arXiv preprint arXiv:2203.15862, 2022 | 5 | 2022 |
| Optimal virtual network embeddings for tree topologies A Figiel, L Kellerhals, R Niedermeier, M Rost, S Schmid, P Zschoche Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 3 | 2021 |
| 31st International Symposium on Algorithms and Computation (ISAAC 2020) S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 3 | 2020 |
Till FluschnikTU ClausthalVerified email at tu-clausthal.de
