default search action
Anne-Sophie Himmel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024) - 2021
- [j7]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
:
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83(9): 2754-2802 (2021) - [j6]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): 521-547 (2021) - [j5]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken
Multistage graph problems on a global budget. Theor. Comput. Sci. 868: 46-64 (2021) - [c5]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC 2021: 216-230 - 2020
- [j4]Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1): 73 (2020) - [c4]Arnaud Casteigts
Finding Temporal Paths Under Waiting Time Constraints. ISAAC 2020: 30:1-30:18 - [i7]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR abs/2006.14972 (2020)
2010 – 2019
- 2019
- [j3]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254: 283-290 (2019) - [j2]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24(1): 1.13:1-1.13:27 (2019) - [c3]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) 2019: 494-506 - [i6]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR abs/1909.01152 (2019) - [i5]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR abs/1909.06437 (2019) - [i4]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - 2018
- [c2]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM 2018: 41-46 - [i3]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. CoRR abs/1806.10210 (2018) - 2017
- [j1]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): 35:1-35:16 (2017) - [i2]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Algorithmic Aspects of Point Visibility Graphs. CoRR abs/1711.01811 (2017) - 2016
- [c1]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating maximal cliques in temporal graphs. ASONAM 2016: 337-344 - [i1]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating Maximal Cliques in Temporal Graphs. CoRR abs/1605.03871 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-29 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: