Anne-Sophie Himmel

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 20

Top Topics

Algorithmic Aspects

Temporal Information

Maximal Cliques

Top Venues

Soc. Netw. Anal. Min.

COMPLEX NETWORKS (2)

Publications

Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67 (4) (2024)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC (2021)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25 (1) (2021)
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
Multistage graph problems on a global budget. Theor. Comput. Sci. 868 (2021)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83 (9) (2021)
Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5 (1) (2020)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR (2020)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. ISAAC (2020)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR (2019)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254 (2019)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) (2019)
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
Multistage Problems on a Global Budget. CoRR (2019)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24 (1) (2019)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR (2019)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. CoRR (2018)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM (2018)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Algorithmic Aspects of Point Visibility Graphs. CoRR (2017)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7 (1) (2017)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Enumerating Maximal Cliques in Temporal Graphs. CoRR (2016)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Enumerating maximal cliques in temporal graphs. ASONAM (2016)