Anne-Sophie Himmel | DeepAI

AI Chat

Featured Co-authors

Rolf Niedermeier
71 publications
Hendrik Molter
34 publications
Manuel Sorge
28 publications
Philipp Zschoche
21 publications
Malte Renken
20 publications
André Nichterlein
20 publications
Vincent Froese
19 publications
Matthias Bentert
19 publications
Klaus Heeger
19 publications
Arnaud Casteigts
11 publications
Frank Kammer
10 publications

∙ 06/26/2020

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

Editing a graph into a disjoint union of clusters is a standard optimiza...

0 Aleksander Figiel, et al. ∙

∙ 12/09/2019

Multistage Graph Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...

0 Klaus Heeger, et al. ∙

∙ 12/09/2019

Multistage Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...

0 Klaus Heeger, et al. ∙

∙ 09/13/2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints

Computing a (shortest) path between two vertices in a graph is one of th...

0 Arnaud Casteigts, et al. ∙

∙ 08/30/2019

Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints

Node connectivity plays a central role in temporal network analysis. We ...

0 Anne-Sophie Himmel, et al. ∙

∙ 06/26/2018

Listing All Maximal k-Plexes in Temporal Graphs

Social networks evolve over time, that is, new contacts appear and old c...

0 Matthias Bentert, et al. ∙

∙ 11/06/2017

Computational Complexity Aspects of Point Visibility Graphs

A point visibility graph is a graph induced by a set of points in the pl...

0 Anne-Sophie Himmel, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world