Annabell Berger

According to our database, Annabell Berger authored at least 16 papers between 2007 and 2017.

Collaborative distances:

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

2017

The Isomorphic Version of Brualdi's and Sanderson's Nestedness.

Annabell Berger, Berit Schreck

Algorithms, 2017

2016

Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence.

Corrie Jacobien Carstens, Annabell Berger, Giovanni Strona

CoRR, 2016

2015

Marathon: An open source software library for the analysis of Markov-Chain Monte Carlo algorithms.

Steffen Rechner, Annabell Berger

CoRR, 2015

2014

A note on the characterization of digraphic sequences.

Annabell Berger

Discret. Math., 2014

Broder's Chain Is Not Rapidly Mixing.

Annabell Berger, Steffen Rechner

CoRR, 2014

2012

The Connection between the Number of Realizations for Degree Sequences and Majorization

Annabell Berger

CoRR, 2012

How to Attack the NP-Complete Dag Realization Problem in Practice.

Annabell Berger, Matthias Müller-Hannemann

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Efficient Computation of Time-Dependent Centralities in Air Transportation Networks.

Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Dag Realizations of Directed Degree Sequences.

Annabell Berger, Matthias Müller-Hannemann

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Passenger Flow-Oriented Train Disposition.

Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee

Proceedings of the Algorithms - ESA 2011, 2011

Stochastic Delay Prediction in Large Train Networks.

Annabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann, Martin Ostrowski

Proceedings of the ATMOS 2011, 2011

2010

Uniform Sampling of Digraphs with a Fixed Degree Sequence.

Annabell Berger, Matthias Müller-Hannemann

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks.

Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

Uniform sampling of undirected and directed graphs with a fixed degree sequence

Annabell Berger, Matthias Müller-Hannemann

CoRR, 2009

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected.

Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann

Proceedings of the ATMOS 2009, 2009

2007

Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors.

Annabell Berger, Winfried Hochstättler

Electron. Notes Discret. Math., 2007