| Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs AS Himmel, H Molter, R Niedermeier, M Sorge Social Network Analysis and Mining 7, 1-16, 2017 | 120* | 2017 |
| The complexity of finding small separators in temporal graphs P Zschoche, T Fluschnik, H Molter, R Niedermeier Journal of Computer and System Sciences 107, 72-92, 2020 | 105 | 2020 |
| 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 | 49 | 2023 |
| Combining clickstream analyses and graph-modeled data clustering for identifying common response processes E Ulitzsch, Q He, V Ulitzsch, H Molter, A Nichterlein, R Niedermeier, ... psychometrika 86 (1), 190-214, 2021 | 48 | 2021 |
| Listing All Maximal k-Plexes in Temporal Graphs M Bentert, AS Himmel, H Molter, M Morik, R Niedermeier, R Saitenmacher Journal of Experimental Algorithmics (JEA) 24, 1-27, 2019 | 44 | 2019 |
| Sliding window temporal graph coloring GB Mertzios, H Molter, V Zamaraev Journal of Computer and System Sciences 120, 97-115, 2021 | 43 | 2021 |
| ACO beats EA on a dynamic pseudo-boolean function T Kötzing, H Molter International Conference on Parallel Problem Solving from Nature, 113-122, 2012 | 42 | 2012 |
| Algorithmic aspects of temporal betweenness S Buß, H Molter, R Niedermeier, M Rymar Network Science 12 (2), 160-188, 2024 | 41* | 2024 |
| Cluster editing for multi-layer and temporal graphs J Chen, H Molter, M Sorge, O Suchý Theory of Computing Systems, 1-52, 2024 | 27 | 2024 |
| Isolation concepts applied to temporal clique enumeration H Molter, R Niedermeier, M Renken Network Science 9 (S1), S83-S105, 2021 | 26* | 2021 |
| 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 |
| Counting temporal paths J Enright, K Meeks, H Molter arXiv preprint arXiv:2202.12055, 2022 | 22 | 2022 |
| Delay-robust routes in temporal graphs E Füchsle, H Molter, R Niedermeier, M Renken arXiv preprint arXiv:2201.05390, 2022 | 21 | 2022 |
| Parameterized dynamic cluster editing J Luo, H Molter, A Nichterlein, R Niedermeier Algorithmica 83 (1), 1-44, 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 |
| The complexity of computing optimum labelings for temporal connectivity N Klobas, GB Mertzios, H Molter, PG Spirakis Journal of Computer and System Sciences 146, 103564, 2024 | 18 | 2024 |
| A parameterized complexity view on collapsing k-cores J Luo, H Molter, O Suchý Theory of Computing Systems 65 (8), 1243-1282, 2021 | 18 | 2021 |
