Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. - Annabell Berger; Winfried Hochstättler (Electron. Notes Discret. Math., 2007)

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. - Annabell Berger; Daniel Delling; Andreas Gebhardt 001; Matthias Müller-Hannemann (ATMOS, 2009)

Uniform sampling of undirected and directed graphs with a fixed degree sequence - Annabell Berger; Matthias Müller-Hannemann (CoRR, 2009)

Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. - Annabell Berger; Martin Grimmer 002; Matthias Müller-Hannemann (SEA, 2010)

Uniform Sampling of Digraphs with a Fixed Degree Sequence. - Annabell Berger; Matthias Müller-Hannemann (WG, 2010)

Stochastic Delay Prediction in Large Train Networks. - Annabell Berger; Andreas Gebhardt 001; Matthias Müller-Hannemann; Martin Ostrowski (ATMOS, 2011)

Passenger Flow-Oriented Train Disposition. - Annabell Berger; Christian Blaar; Andreas Gebhardt 001; Matthias Müller-Hannemann; Mathias Schnee (ESA, 2011)

Dag Realizations of Directed Degree Sequences. - Annabell Berger; Matthias Müller-Hannemann (FCT, 2011)

Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. - Annabell Berger; Matthias Müller-Hannemann; Steffen Rechner; Alexander Zock (WALCOM, 2011)

Directed degree sequences - Annabell Berger (2011)

How to Attack the NP-Complete Dag Realization Problem in Practice. - Annabell Berger; Matthias Müller-Hannemann (SEA, 2012)

The Connection between the Number of Realizations for Degree Sequences and Majorization - Annabell Berger (CoRR, 2012)

Broder's Chain Is Not Rapidly Mixing. - Annabell Berger; Steffen Rechner (CoRR, 2014)

A note on the characterization of digraphic sequences. - Annabell Berger (Discret. Math., 2014)

Marathon: An open source software library for the analysis of Markov-Chain Monte Carlo algorithms. - Steffen Rechner; Annabell Berger (CoRR, 2015)

Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence. - Corrie Jacobien Carstens; Annabell Berger; Giovanni Strona (CoRR, 2016)

The Isomorphic Version of Brualdi's and Sanderson's Nestedness. - Annabell Berger; Berit Schreck (Algorithms, 2017)