Anne-Sophie Himmel

According to our database, Anne-Sophie Himmel authored at least 13 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.

Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier

Commun. ACM, April, 2024

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

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering.

Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Finding Temporal Paths Under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Listing All Maximal <i>k</i>-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

ACM J. Exp. Algorithmics, 2019

Computational complexity aspects of point visibility graphs.

Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge

Discret. Appl. Math., 2019

Multistage Problems on a Global Budget.

Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko

CoRR, 2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

CoRR, 2019

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints.

Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier

Proceedings of the Complex Networks and Their Applications VIII, 2019

2018

Listing All Maximal k-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

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

Algorithmic Aspects of Point Visibility Graphs.

Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge

CoRR, 2017

2016

Enumerating maximal cliques in temporal graphs.

Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016