Login for editors
Dr. Annabell Berger
Since April 2008 I`m working in Matthias Müller-Hannemann's team as Ph. D. student in the DFG Priority Programme 1307 "Algorithm Engineering". The aim of this project is to bridge the gap between the theory of algorithms and their practical applicability. Within this large area our team is concentrating on algorithms from graph theory and combinatorical optimization. For this, we include real world data from rail- and road traffic. One challenge in this are the huge amount of data. Besides handling these we are also concerned with the real problems full of trouble. Personally, I`m very interested in generalization of new problems and their exact solving. For this I`m also looking for metrics to compare the quality of real-world algorithms.
Publications and Preprints
Annabell Berger, Directed Degree Sequences, Dissertation 2011
Directed-degree-sequences.pdf
(3.1 MB) vom 09.01.2012
Annabell Berger and Mattias Müller-Hannemann, How to Attack the NP-complete Dag Realization Problem in Practice, to appear in Proceedings of SEA 2012, LNCS, Springer
Annabell Berger, A note on the Characterization of Digraph Sequences , arXiv:1112.1215v1 (2011).
Annabell Berger and Matthias Müller-Hannemann
Dag Characterizations of Directed Degree Sequences
2011-6.pdf (300,2 KB) vom 22.06.2011, Technical Report.
Annabell Berger and Matthias Müller-Hannemann, Dag Realizations of Directed Degree Sequences , Proceedings of FCT 2011, Oslo, Norway, LNCS 6914, pp. 264-275, Springer, Heidelberg. Full version: Technical Report 2011/5, Institut für Informatik, MLU Halle-Wittenberg.
Annabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann and Martin Ostrowski, Stochastic Delay Prediction in Large Train Networks, Technical Report 03/11.
Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann and Mathias Schnee
Passenger Flow-Oriented Train Disposition, Technical Report 2011/2, Institut für Informatik, MLU Halle-Wittenberg, in Proceedings of ESA 2011, Saarbrücken, LNCS, Springer, Heidelberg.
A. Berger, M. M. Müller-Hannemann, S. Rechner, and A. Zock
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
Proceedings of WALCOM 2011, LNCS 6552, pp. 77-88, Springer, 2011.
A. Berger and M. Müller-Hannemann
Uniform Sampling of Undirected and Directed Graphs with a Fixed Degree Sequence
extended abstract in Proceedings of WG 2010, LNCS 6410, pp. 220-231, Springer, 2010.
A. Berger, M. Grimmer, and M. Müller-Hannemann
Fully dynamic speed-up techniques for multi-criteria shortest paths searches in time-dependent networks,
Proceedings of SEA 2010, LNCS 6049, pp. 35-46, Springer, 2010.
A. Berger, D. Delling, A. Gebhardt, and M. Müller-Hanneman. Accelerating Time-dependent Multi-Criteria Time-Table Information is Harder Than Expected , proceedings of ATMOS 2009.
Annabell Berger and Matthias Müller-Hannemann.
Subpath-Optimality of Multi-Criteria Shortest Paths in Time- and Event-Dependent Networks, Technical Report 01/2009.
Annabell Berger, Winfried Hochstättler, Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors , Electronic Notes in Discrete Mathematics (2007) 28 69–76
I'm a songwriter.