default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnabell Berger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j3]Annabell Berger, Berit Schreck:
The Isomorphic Version of Brualdi's and Sanderson's Nestedness. Algorithms 10(3): 74 (2017)- 2016
- [i6]Corrie Jacobien Carstens, Annabell Berger, Giovanni Strona:
Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence. CoRR abs/1609.05137 (2016) - 2015
- [i5]Steffen Rechner, Annabell Berger:
Marathon: An open source software library for the analysis of Markov-Chain Monte Carlo algorithms. CoRR abs/1508.04740 (2015) - 2014
- [j2]Annabell Berger:
A note on the characterization of digraphic sequences. Discret. Math. 314: 38-41 (2014) - [i4]Annabell Berger, Steffen Rechner:
Broder's Chain Is Not Rapidly Mixing. CoRR abs/1404.4249 (2014) - 2012
- [c8]Annabell Berger, Matthias Müller-Hannemann
:
How to Attack the NP-Complete Dag Realization Problem in Practice. SEA 2012: 51-62 - [i3]Annabell Berger, Matthias Müller-Hannemann:
How to Attack the NP-complete Dag Realization Problem in Practice. CoRR abs/1203.3636 (2012) - [i2]Annabell Berger:
The Connection between the Number of Realizations for Degree Sequences and Majorization. CoRR abs/1212.5443 (2012) - 2011
- [b1]Annabell Berger:
Directed degree sequences. University of Halle, Germany, 2011 - [c7]Annabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann, Martin Ostrowski:
Stochastic Delay Prediction in Large Train Networks. ATMOS 2011: 100-111 - [c6]Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee:
Passenger Flow-Oriented Train Disposition. ESA 2011: 227-238 - [c5]Annabell Berger, Matthias Müller-Hannemann:
Dag Realizations of Directed Degree Sequences. FCT 2011: 264-275 - [c4]Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock:
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. WALCOM 2011: 77-88 - 2010
- [c3]Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann:
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. SEA 2010: 35-46 - [c2]Annabell Berger, Matthias Müller-Hannemann:
Uniform Sampling of Digraphs with a Fixed Degree Sequence. WG 2010: 220-231
2000 – 2009
- 2009
- [c1]Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann:
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS 2009 - [i1]Annabell Berger, Matthias Müller-Hannemann:
Uniform sampling of undirected and directed graphs with a fixed degree sequence. CoRR abs/0912.0685 (2009) - 2007
- [j1]Annabell Berger, Winfried Hochstättler:
Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. Electron. Notes Discret. Math. 28: 69-76 (2007)
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-10-17 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:
