2014

• Martin Lemnian, Ralf Rückert, Steffen Rechner, Christoph Blendinger, and Matthias Müller-Hannemann
  Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays
  in Proceedings of ATMOS 2014, Wroclaw, Poland, September 11, 2014, pages 122-137.
• Clemens Beckstein, Sebastian Böcker, Martin Bogdan, Helge Bruelheide, H. Martin Bücker, Joachim Denzler, Peter Dittrich, Ivo Grosse, Alexander Hinneburg, Birgitta König-Ries, Felicitas Löffler, Manja Marz, Matthias Müller-Hannemann, Marten Winter, and Wolf Zimmermann.
  Explorative analysis of heterogeneous, unstructured, and uncertain data: A computer science perspective on biodiversity research.
  In Proceedings of the 3rd International Conference on Data Management Technologies and Applications, DATA 2014, Vienna, Austria, August 29--31, 2014, pages 251-257.
• Annabell Berger and Steffen Rechner
  Broder's chain is not rapidly mixing,
  arxiv:1404.4249.
• Annabell Berger
  A note on the characterization of digraphic sequences,
  Discrete Mathematics 314 (2014), 38-41.
• Ivo Hedtke, Ioana Lemnian, Matthias Müller-Hannemann and Ivo Große
  On Optimal Read Trimming in Next Generation Sequencing and its Complexity,
  Proceedings of AlCoB 2014, LNBI 8542, pp. 83-94, Springer.
• Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller- Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner and Renato Werneck
  Route Planning in Transportation Networks,
  Technical Report Microsoft Research, MSR-TR-2014-4.
• Marc Goerigk, Marie Schmidt, Anita Schöbel, Martin Knoth, Matthias Müller-Hannemann,
  The price of strict and light robustness in timetable information, Transportation Science, Vol. 48, No. 2, May 2014, pp. 225–242.

2013

• Marc Goerigk, Sascha Heße, Matthias Müller-Hannemann, Marie Schmidt, and Anita Schöbel
  Recoverable Robust Timetable Information, Proceedings of ATMOS 2013. OpenAccess Series in Informatics (OASIcs), vol. 33, pp. 1-14, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
• Stephan Winter and Matthias Müller-Hannemann,
  5th ACM SIGSPATIAL International Workshop on Computational Transportation Science. SIGSPATIAL Special 5(1): 5-6.

2012

• Annabell Berger
  The connection between the number of realizations for degree sequences and majorization, arXiv:1212.5443, submitted to Discrete Mathematics
• Annabell Berger and Matthias Müller-Hannemann
  How to Attack the NP-complete Dag Realization Problem in Practice,
  Proceedings of SEA 2012, LNCS 7276, pages 51-62, Springer
• Moritz Emanuel Beber, Christoph Fretter, Shubham Jain, Nikolaus Sonnenschein, Matthias Müller-Hannemann, and Marc-Thorsten Hütt
  Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks, J. R. Soc. Interface vol. 9, nr. 77, 3426-3435, doi:10.1098/rsif.2012.0490
• Christoph Fretter, Matthias Müller-Hannemann, and Marc-Thorsten Hütt
  Subgraph fluctuations in random graphs,
  Physical Review E 85, 056119
• Steffen Schiele, Markus Möller, Holger Blaar, Detlev Thürkow, and Matthias Müller-Hannemann
  Parallelization strategies to deal with non-localities in the calculation of regional land- surface parameters,
  Computers and Geosciences, vol. 44, pages 1-9, 2012.
• Steffen Schiele, Holger Blaar, Detlev Thürkow, Markus Möller and Matthias Müller-Hannemann
  Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors,
  Mühl, G., Herkersdorf, A. (Eds.) ARCS 2012 Workshops, Lecture Notes in Informatics (Vol. 200), pages 457-468.
• Ivo Hedtke, Sandeep Murthy
  Search and test algorithms for triple product property triples
  Groups - Complexity - Cryptology, Volume 4, Issue 1, pp. 111-133, 2012

2011

• Siamak Tazari and Matthias Müller-Hannemann
  Dealing with large hidden constants: engineering a planar Steiner tree PTAS
  Journal of Experimental Algorithmics (JEA), volume 16, article 3.6
• Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann and Mathias Schnee
  Passe nger Flow-Oriented Train Disposition, Proceedings of ESA 2011, Saarbrücken, LNCS 6942, pp. 227-238, Springer, Heidelberg. Full version: Technical Report 2011/2, Institut für Informatik, MLU Halle-Wittenberg
• 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, Matthias Müller-Hannemann, Steffen Rechner, and Alexander Zock
  Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
  Proceedings of WALCOM 2011, LNCS 6552, pp. 77-88, Springer.
• Lachezar Krumov, Christoph Fretter, Matthias Müller-Hannemann, Karsten Weihe, and Marc-Thorsten Hütt
  Motifs in co- authorship networks and their relation to the impact of scientific publications
  European Physical Journal B, volume 84, no. 4, pp. 535-540
• Annabell Berger, Andreas Gebhardt, Matthias Müller- Hannemann and Martin Ostrowski
  Stochastic Delay Prediction in Large Train Networks,
  Proceedings of ATMOS 2011, OpenAccess Series in Informatics (OASIcs), vol. 20, pp. 100-111, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
  full version available as Technical Report 2011/1, Institut für Informatik, MLU Halle-Wittenberg
• Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Anita Schöbel and Marie Schmidt
  The Price of Robustness in Timetable Information,
  Proceedings of ATMOS 2011, OpenAccess Series in Informatics (OASIcs), vol. 20, pp. 76-87, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
  full version available as Technical Report 2011/3, Institut für Informatik, MLU Halle-Wittenberg
• Annabell Berger and Matthias Müller-Hannemann
  Dag Characterizations of Directed Degree Sequences
  Technical Report 2011/6, Institut für Informatik, MLU Halle-Wittenberg.
• Thorsten Gunkel, Matthias Müller-Hannemann, Mathias Schnee
  How to find good night train connections
  Networks 57, pp. 19-27.

2010

• M. Müller-Hannemann and S. Schirra (eds.)
  Algorithm Engineering - Bridging the Gap between Algorithm Theory and Practice
  LNCS 5971, Springer, 2010.
• C. Fretter, L. Krumov, K.Weihe, M. Müller-Hannemann, and M.-T. Hütt
  Phase synchronization in railway timetables
  Eur. Phys. J. B 77, 281–289 (2010).
• 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.
• S. Wolf, S. Schmidt, M. Müller-Hannemann, and S. Neumann
  In silico fragmentation for computer assisted identification of metabolite mass spectra,
  BMC Bioinformatics 11:148, 2010.
• M. Müller-Hannemann and Siamak Tazari
  A Near Linear Time Approximation Scheme for Steiner Tree among Obstacles in the Plane,
  Computational Geometry:Theory and Applications 43, pp. 395–409 (2010). Extended abstract appeared in WADS 2007.

2009

• A. Berger, D. Delling, A. Gebhardt, and M. Müller-Hanneman
  Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected,
  proceedings of ATMOS 2009.
• M. Müller-Hannemann and M. Schnee
  Efficient Timetable Information in the Presence of Delays,
  in special volume on "Robust and online large-scale optimization", LNCS 5868, pp. 249-272 Springer, 2009.
• S. Tazari and M. Müller-Hanneman
  Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS,
  Proceedings of ALENEX 2009, pp. 120-131, SIAM, Philadelphia, 2009.
• S. Tazari and M. Müller-Hannemann
  Shortest Paths in Linear Time on Minor-Closed Graph Classes with an Application to Steiner Tree Approximation,
  Discrete Applied Mathematics, Volume 157, Issue 4, pp. 673-684, 2009.
• C. Fretter, A. Szejka, and B. Drossel
  Perturbation propagation in random and evolved Boolean networks,
  New J. Phys. 11 (2009) 033005.
• M. Müller-Hannemann and A. Sonnikow
  Non-Approximability of Just-in-Time Scheduling,
  Journal of Scheduling, volume 12, pages 555-562, 2009.
• Andreas Gebhardt and Johannes Waldmann
  Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems,
  Acta Cybernetica 19 (2009), 295-312.

2008

• R. K. Ahuja, R. Jacob, and M. Müller-Hannemann (guest editors)
  Focused Issue on Rail Transportation, Transportation Science, volume 43, number 4, pp. 405-507, 2008.
• L. Frede, M. Müller-Hannemann, and M. Schnee
  Efficient On-Trip Timetable Information in the Presence of Delays,
  in Proceedings of ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
• S. Tazari and M. Müller-Hannemann
  A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes,
  WG 2008, Lecture Notes in Computer Science 5344, pp.360-371, Springer, 2008.
• Y. Disser, M. Müller-Hannemann, and M. Schnee
  Multi-Criteria Shortest Paths in Time-Dependent Train Networks,
  WEA 2008. 7th International Workshop on Experimental Algorithms, Provincetown, MA, USA, Lecture Notes in Computer Science 5038, pp. 347-361, Springer 2008.
• M. Müller-Hannemann and M. Schnee
  Timetable Information in the Presence of Delays: A realistic Prototype,
  in Proceedings of 2nd ARRIVAL workshop, Rome.

2007

• M. Müller-Hannemann and A. Schulze
  Hardness and Approximation of Octilinear Steiner Trees,
  International Journal of Computational Geometry and Applications (IJCGA), vol. 17 (2007), pp. 231-260.
• M. Müller-Hannemann and S. Tazari
  A Near Linear Time Approximation Scheme for Steiner Tree among Obstacles in the Plane,
  WADS 2007, 10th Workshop on Algorithms and Data Structures, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science 4619, pp. 151-162, Springer.
• M. Müller-Hannemann, F. Schulz, D. Wagner and C. Zaroliagis
  Timetable Information: Models and Algorithms,
  ATMOS 2004, Lecture Notes in Computer Science, vol. 4359, pp. 67-89, Springer, 2007.
• M. Müller-Hannemann and M. Schnee
  Finding All Attractive Train Connections by Multi-Criteria Pareto Search,
  Proceedings of the 4th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004), Bergen, Norway, Lecture Notes in Computer Science, vol. 4359, pp. 246-263, Springer, 2007.
• A. Eriksson, K. Marti, M. Müller-Hannemann, B.H.V. Topping, and C.A. Mota-Soares (eds.)
  Engineering Computational Technology,special issue of Advances in Engineering Software, volume 38, issues 11-12, pp. 723-896, 2007.
• T. Gunkel, M. Müller-Hannemann and M. Schnee
  Improved Search for Night Train Connections,
  in Proceedings of ATMOS 2007, journal version to appear in Networks.

• W. Gropp, E. Lusk and A. Skjellum

MPI - Eine Einführung. Portable  parallele Programmierung mit dem Message Passing Interface. Übersetzung des  englischsprachigen, bei The MIT Press im Jahre 1999 erschienenen Buches "Using  MPI" durch H. Blaar unter der wissenschaftlichen Leitung von P. Molitor Oldenbourg Wissenschaftsverlag München, 2007.

• H. Blaar, J. Keller, C. Keßler,  and B. Wesarg

Emulating a PRAM on a Parallel Computer 21. PARS-Workshop PARS`07, Hamburg, 31.Mai/1.Juni, 2007 (to appear)

• J. Dölle, H. Blaar

Hybride parallele Implementierung von Algorithmen mit MPI und POSIX-Threads  auf Cluster-Systemen, 21. PARS-Workshop PARS`07, Hamburg, 31.Mai/1.Juni, 2007, Short Communication (to appear)

• J. Enghardt, H. Blaar

Objektorientierte Message-Passing-Implementierung eines parallelen  Konvexe-Hülle-Algorithmus, 21. PARS-Workshop PARS`07, Hamburg, 31.Mai/1.Juni, 2007, Short Communication (to appear)

Zum Seitenanfang