Matthias Müller-Hannemann

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 17

Top Venues

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Valentina Cacchiani, Matthias Müller-Hannemann, Federico Perea Rojas-Marcos
Guest Editorial to the Special Issue Public Transport Optimization: From Theory to Practice. Oper. Res. Forum 5 (3) (2024)
Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, Matthias Müller-Hannemann
Barcode Selection and Layout Optimization in Spatial Transcriptomics. SEA (2024)
Julian Patzner, Ralf Rückert, Matthias Müller-Hannemann
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport. ATMOS (2022)
Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel
Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. ATMOS (2021)
Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel
Estimating the Robustness of Public Transport Systems Using Machine Learning. CoRR (2021)
Jördis-Ann Schüler, Steffen Rechner, Matthias Müller-Hannemann
MET: a Java package for fast molecule equivalence testing. J. Cheminformatics 12 (1) (2020)
Matthias Müller-Hannemann, Ralf Rückert, Sebastian S. Schmidt
Vehicle Capacity-Aware Rerouting of Passengers in Delay Management. ATMOS (2019)
Steffen Rechner, Linda Strowick, Matthias Müller-Hannemann
Uniform sampling of bipartite graphs with degrees in prescribed intervals. J. Complex Networks 6 (6) (2018)
Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel
Robustness as a Third Dimension for Evaluating Public Transport Plans. ATMOS (2018)
Ivo Hedtke, Ioana M. Lemnian, Ivo Grosse, Matthias Müller-Hannemann
Optimal Block-Based Trimming for Next Generation Sequencing. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (2) (2018)
Matthias Müller-Hannemann, Ralf Rückert
Dynamic Event-Activity Networks in Public Transportation - Timetable Information and Delay Management. Datenbank-Spektrum 17 (2) (2017)
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
Gerbil: a fast and memory-efficient k-mer counter with GPU-support. Algorithms Mol. Biol. 12 (1) (2017)
Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel
Robustness Tests for Public Transport Planning. ATMOS (2017)
Ralf Rückert, Martin Lemnian, Christoph Blendinger, Steffen Rechner, Matthias Müller-Hannemann
PANDA: a software tool for improved train dispatching with focus on passenger flows. Public Transp. 9 (1-2) (2017)
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support. CoRR (2016)
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support. WABI (2016)
Martin Lemnian, Matthias Müller-Hannemann, Ralf Rückert
Sensitivity Analysis and Coupled Decisions in Passenger Flow-Based Train Dispatching. ATMOS (2016)
Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann, Sandeep Murthy
A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication. Groups Complex. Cryptol. 7 (1) (2015)
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
Route Planning in Transportation Networks. CoRR (2015)
Marc Goerigk, Marie Schmidt, Anita Schöbel, Martin Knoth, Matthias Müller-Hannemann
The Price of Strict and Light Robustness in Timetable Information. Transp. Sci. 48 (2) (2014)
Martin Lemnian, Ralf Rückert, Steffen Rechner, Christoph Blendinger, Matthias Müller-Hannemann
Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays. ATMOS (2014)
Ivo Hedtke, Ioana M. Lemnian, Matthias Müller-Hannemann, Ivo Grosse
On Optimal Read Trimming in Next Generation Sequencing and Its Complexity. AlCoB (2014)
Clemens Beckstein, Sebastian Böcker, Martin Bogdan, Helge Bruehlheide, 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, Martin Winter, Wolf Zimmermann
Explorative Analysis of Heterogeneous, Unstructured, and Uncertain Data - A Computer Science Perspective on Biodiversity Research. DATA (2014)
Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel
Recoverable Robust Timetable Information. ATMOS (2013)
Stephan Winter, Matthias Müller-Hannemann
5th ACM SIGSPATIAL International Workshop on Computational Transportation Science. ACM SIGSPATIAL Special 5 (1) (2013)
Annabell Berger, Matthias Müller-Hannemann
How to Attack the NP-Complete Dag Realization Problem in Practice. SEA (2012)
Steffen Schiele, Holger Blaar, Detlef Thürkow, Markus Möller, Matthias Müller-Hannemann
Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors. ARCS Workshops (2012)
Annabell Berger, Matthias Müller-Hannemann
How to Attack the NP-complete Dag Realization Problem in Practice CoRR (2012)
Steffen Schiele, Markus Möller, Holger Blaar, Detlef Thürkow, Matthias Müller-Hannemann
Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters. Comput. Geosci. 44 (2012)
Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee
Passenger Flow-Oriented Train Disposition. ESA (2011)
Siamak Tazari, Matthias Müller-Hannemann
Dealing with large hidden constants: engineering a planar steiner tree PTAS. ACM J. Exp. Algorithmics 16 (2011)
Thorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann
How to find good night train connections. Networks 57 (1) (2011)
Matthias Müller-Hannemann, Renato Fonseca F. Werneck
Introduction to special issue ALENEX'11. ACM J. Exp. Algorithmics 17 (1) (2011)
Annabell Berger, Matthias Müller-Hannemann
Dag Realizations of Directed Degree Sequences. FCT (2011)
Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel
The Price of Robustness in Timetable Information. ATMOS (2011)
Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. WALCOM (2011)
Annabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann, Martin Ostrowski
Stochastic Delay Prediction in Large Train Networks. ATMOS (2011)
Matthias Müller-Hannemann, Stefan Schirra
Foundations of Algorithm Engineering. Algorithm Engineering (2010)
Jason Dykes, Matthias Müller-Hannemann, Alexander Wolff
10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry. Schematization in Cartography, Visualization, and Computational Geometry (2010)
Annabell Berger, Matthias Müller-Hannemann
Uniform Sampling of Digraphs with a Fixed Degree Sequence. WG (2010)
Matthias Müller-Hannemann, Siamak Tazari
A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43 (4) (2010)
Sebastian Wolf, Stephan Schmidt, Matthias Müller-Hannemann, Steffen Neumann
In silico fragmentation for computer assisted identification of metabolite mass spectra. BMC Bioinform. 11 (2010)
Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. SEA (2010)
Christoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt
Phase Synchronization in Railway Timetables CoRR (2010)
Matthias Müller-Hannemann, Stefan Schirra
Challenges in Algorithm Engineering. Algorithm Engineering (2010)
Siamak Tazari, Matthias Müller-Hannemann
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. ALENEX (2009)
Matthias Müller-Hannemann, Alexander Sonnikow
Non-approximability of just-in-time scheduling. J. Sched. 12 (5) (2009)
Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS (2009)
Siamak Tazari, Matthias Müller-Hannemann
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discret. Appl. Math. 157 (4) (2009)
Annabell Berger, Matthias Müller-Hannemann
Uniform sampling of undirected and directed graphs with a fixed degree sequence CoRR (2009)
Yann Disser, Matthias Müller-Hannemann, Mathias Schnee
Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA (2008)
Siamak Tazari, Matthias Müller-Hannemann
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. WG (2008)
Lennart Frede, Matthias Müller-Hannemann, Mathias Schnee
Efficient On-Trip Timetable Information in the Presence of Delays. ATMOS (2008)
Thorsten Gunkel, Matthias Müller-Hannemann, Mathias Schnee
Improved Search for Night Train Connections. ATMOS (2007)
Anders Eriksson, Kurt Marti, Matthias Müller-Hannemann, Barry H. V. Topping, Carlos A. Mota Soares
Engineering Computational Technology. Adv. Eng. Softw. 38 (11-12) (2007)
Matthias Müller-Hannemann, Anna Schulze
Hardness and Approximation of Octilinear Steiner Trees. Int. J. Comput. Geom. Appl. 17 (3) (2007)
Matthias Müller-Hannemann, Siamak Tazari
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. WADS (2007)
Matthias Müller-Hannemann, Karsten Weihe
Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351 (3) (2006)
Riko Jacob, Matthias Müller-Hannemann
ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS (2006)
Riko Jacob, Matthias Müller-Hannemann
ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. ATMOS (2006)
Matthias Müller-Hannemann, Karsten Weihe
On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147 (1) (2006)
Matthias Müller-Hannemann, Anna Schulze
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. SWAT (2006)
Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
Workload Balancing in Multi-stage Production Processes. WEA (2006)
Matthias Müller-Hannemann, Mathias Schnee
Paying Less for Train Connections with MOTIS. ATMOS (2005)
Matthias Müller-Hannemann, Anna Schulze
Hardness and Approximation of Octilinear Steiner Trees. ISAAC (2005)
Matthias Müller-Hannemann, Karsten Weihe
Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC (2004)
Matthias Müller-Hannemann, Mathias Schnee
Finding All Attractive Train Connections by Multi-criteria Pareto Search. ATMOS (2004)
Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Timetable Information: Models and Algorithms. ATMOS (2004)
Matthias Müller-Hannemann, Ute Zimmermann
Slack Optimization of Timing-Critical Nets. ESA (2003)
Matthias Müller-Hannemann, Sven Peyer
Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. WADS (2003)
Matthias Müller-Hannemann
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation. Comput. Geom. 22 (1-3) (2002)
Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe
Getting Train Timetables into the Main Storage. Electron. Notes Theor. Comput. Sci. 66 (6) (2002)
Cornelia Kober, Matthias Müller-Hannemann
A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible. Eng. Comput. 17 (3) (2001)
Matthias Müller-Hannemann, Cornelia Kober, Robert Sader, Hans-Florian Zeilhofer
Anisotropic Validation of Hexahedral Meshes for Composite Materials in Biomechanics. IMR (2001)
Matthias Müller-Hannemann, Karsten Weihe
Pareto Shortest Paths is Often Feasible in Practice. WAE (2001)
Matthias Müller-Hannemann
Shelling Hexahedral Complexes for Mesh Generation. J. Graph Algorithms Appl. 5 (5) (2001)
Rolf H. Möhring, Matthias Müller-Hannemann
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. Algorithmica 26 (1) (2000)
Matthias Müller-Hannemann
Improving the surface cycle structure for hexahedral mesh generation. SCG (2000)
Cornelia Kober, Matthias Müller-Hannemann
Hexahedral Mesh Generation for the Simulation of the Human Mandible. IMR (2000)
Matthias Müller-Hannemann, Alexander Schwartz
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ACM J. Exp. Algorithmics 5 (2000)
Matthias Müller-Hannemann
High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques. Int. J. Comput. Geom. Appl. 10 (3) (2000)
Matthias Müller-Hannemann, Karsten Weihe
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Matthias Müller-Hannemann
Drawing Trees, Series-Parallel Digraphs, and Lattices. Drawing Graphs (1999)
Matthias Müller-Hannemann, Alexander Schwartz
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ALENEX (1999)
Matthias Müller-Hannemann
Kombinatorische Algorithmen zur Netzgenerierung im CAD. GI Jahrestagung (1999)
Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
Empirical Design of Geometric Algorithms. SCG (1999)
Matthias Müller-Hannemann
Hexahedral Mesh Generation by Successive Dual Cycle Elimination. Eng. Comput. 15 (3) (1999)
Matthias Müller-Hannemann, Alexander Schwartz
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. ACM J. Exp. Algorithmics 4 (1999)
Matthias Müller-Hannemann
Combinatorics Helps for Hexahedral Mesh Generation in CAD. SODA (1999)
Matthias Müller-Hannemann
Hexahedral Mesh generation by Successive Dual Cycle Elimination. IMR (1998)
Matthias Müller-Hannemann, Alexander Schwartz
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. WAE (1998)
Rolf H. Möhring, Matthias Müller-Hannemann
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. ISAAC (1997)
Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Mesh refinement via bidirected flows: modeling, complexity, and computational results. J. ACM 44 (3) (1997)
Matthias Müller-Hannemann, Karsten Weihe
Minimum Strictly Convex Quadrangulations of Convex Polygons. SCG (1997)
Matthias Müller-Hannemann, Karsten Weihe
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA (1997)
Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Using Network Flows for Surface Modeling. SODA (1995)

Matthias Müller-Hannemann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Müller-Hannemann