Martin Luther University Halle-Wittenberg

Links

Contact

Datenstrukturen und effiziente Algorithmen
Institut für Informatik

phone: 0345-55 24754 (Sekretariat)
fax: 0345-55 27039 (Sekretariat)

Von-Seckendorff-Platz 1
06120 Halle

Further settings

Login for editors





Publications

You can find publications from previous years on the personal pages of our group members, and current preprints in the new preprint series of the institute.

2012

  • Annabell Berger and Matthias Müller-Hannemann
    How to Attack the NP-complete Dag Realization Problem in Practice,
    to appear in Proceedings of SEA 2012, LNCS, Springer
  • Christoph Fretter, Matthias Müller-Hannemann, and Marc-Thorsten Hütt
    Subgraph fluctuations in random graphs
    accepted for publication in Physical Review E
  • 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,
    accepted for publication in Computers and Geosciences
  • 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.

2011

2010

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)

Up