Enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (ASONAM, 2016)

Algorithmic Aspects of Point Visibility Graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (CoRR, 2017)

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Soc. Netw. Anal. Min., 2017)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ASONAM, 2018)

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

Multistage Problems on a Global Budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (CoRR, 2019)

Computational complexity aspects of point visibility graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (Discret. Appl. Math., 2019)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ACM J. Exp. Algorithmics, 2019)

Efficient computation of optimal temporal walks under waiting-time constraints. - Matthias Bentert; Anne-Sophie Himmel; André Nichterlein; Rolf Niedermeier (Appl. Netw. Sci., 2020)

Finding Temporal Paths Under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (Algorithmica, 2021)

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. - Aleksander Figiel; Anne-Sophie Himmel; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2021)

Multistage graph problems on a global budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (Theor. Comput. Sci., 2021)

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. - Anne-Sophie Himmel; George B. Mertzios; André Nichterlein; Rolf Niedermeier (Commun. ACM, 2024)