Using Network Flows for Surface Modeling. - Rolf H. Möhring; Matthias Müller-Hannemann; Karsten Weihe (SODA, 1995)

Minimum Strictly Convex Quadrangulations of Convex Polygons. - Matthias Müller-Hannemann; Karsten Weihe (SCG, 1997)

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. - Matthias Müller-Hannemann; Karsten Weihe (ESA, 1997)

Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. - Rolf H. Möhring; Matthias Müller-Hannemann (ISAAC, 1997)

Mesh refinement via bidirected flows: modeling, complexity, and computational results. - Rolf H. Möhring; Matthias Müller-Hannemann; Karsten Weihe (J. ACM, 1997)

Quadrilateral mesh generation in computer aided design. - Matthias Müller-Hannemann (Cuvillier, 1997)

Empirical Design of Geometric Algorithms. - Karsten Weihe; Ulrik Brandes; Annegret Liebers; Matthias Müller-Hannemann; Dorothea Wagner; Thomas Willhalm (SCG, 1999)

Drawing Trees, Series-Parallel Digraphs, and Lattices. - Matthias Müller-Hannemann (Drawing Graphs, 1999)

Kombinatorische Algorithmen zur Netzgenerierung im CAD. - Matthias Müller-Hannemann (GI Jahrestagung, 1999)

Combinatorics Helps for Hexahedral Mesh Generation in CAD. - Matthias Müller-Hannemann (SODA, 1999)

Hexahedral Mesh Generation by Successive Dual Cycle Elimination. - Matthias Müller-Hannemann (Eng. Comput., 1999)

Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. - Matthias Müller-Hannemann; Alexander Schwartz (ACM J. Exp. Algorithmics, 1999)

Improving the surface cycle structure for hexahedral mesh generation. - Matthias Müller-Hannemann (SCG, 2000)

Hexahedral Mesh Generation for the Simulation of the Human Mandible. - Cornelia Kober; Matthias Müller-Hannemann (IMR, 2000)

Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. - Rolf H. Möhring; Matthias Müller-Hannemann (Algorithmica, 2000)

High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques. - Matthias Müller-Hannemann (Int. J. Comput. Geom. Appl., 2000)

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. - Matthias Müller-Hannemann; Karsten Weihe (Int. J. Comput. Geom. Appl., 2000)

Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. - Matthias Müller-Hannemann; Alexander Schwartz (ACM J. Exp. Algorithmics, 2000)

Anisotropic Validation of Hexahedral Meshes for Composite Materials in Biomechanics. - Matthias Müller-Hannemann; Cornelia Kober; Robert Sader; Hans-Florian Zeilhofer (IMR, 2001)

Pareto Shortest Paths is Often Feasible in Practice. - Matthias Müller-Hannemann; Karsten Weihe (WAE, 2001)

A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible. - Cornelia Kober; Matthias Müller-Hannemann (Eng. Comput., 2001)

Shelling Hexahedral Complexes for Mesh Generation. - Matthias Müller-Hannemann (J. Graph Algorithms Appl., 2001)

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation. - Matthias Müller-Hannemann (Comput. Geom., 2002)

Getting Train Timetables into the Main Storage. - Matthias Müller-Hannemann; Mathias Schnee; Karsten Weihe (ATMOS, 2002)

Slack Optimization of Timing-Critical Nets. - Matthias Müller-Hannemann; Ute Zimmermann (ESA, 2003)

Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. - Matthias Müller-Hannemann; Sven Peyer (WADS, 2003)

Finding All Attractive Train Connections by Multi-criteria Pareto Search. - Matthias Müller-Hannemann; Mathias Schnee (ATMOS, 2004)

Timetable Information: Models and Algorithms. - Matthias Müller-Hannemann; Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ATMOS, 2004)

Paying Less for Train Connections with MOTIS. - Matthias Müller-Hannemann; Mathias Schnee (ATMOS, 2005)

ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. - Riko Jacob; Matthias Müller-Hannemann (ATMOS, 2006)

ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. - Riko Jacob; Matthias Müller-Hannemann (ATMOS, 2006)

Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. - Matthias Müller-Hannemann; Anna Schulze (SWAT, 2006)

Workload Balancing in Multi-stage Production Processes. - Siamak Tazari; Matthias Müller-Hannemann; Karsten Weihe (WEA, 2006)

On the cardinality of the Pareto set in bicriteria shortest path problems. - Matthias Müller-Hannemann; Karsten Weihe (Ann. Oper. Res., 2006)

Moving policies in cyclic assembly line scheduling. - Matthias Müller-Hannemann; Karsten Weihe (Theor. Comput. Sci., 2006)

Improved Search for Night Train Connections. - Thorsten Gunkel; Matthias Müller-Hannemann; Mathias Schnee (ATMOS, 2007)

Engineering Computational Technology. - Anders Eriksson; Kurt Marti; Matthias Müller-Hannemann; Barry H. V. Topping; Carlos A. Mota Soares (Adv. Eng. Softw., 2007)

Hardness and Approximation of Octilinear Steiner Trees. - Matthias Müller-Hannemann; Anna Schulze (Int. J. Comput. Geom. Appl., 2007)

Efficient On-Trip Timetable Information in the Presence of Delays. - Lennart Frede; Matthias Müller-Hannemann; Mathias Schnee (ATMOS, 2008)

Multi-criteria Shortest Paths in Time-Dependent Train Networks. - Yann Disser; Matthias Müller-Hannemann; Mathias Schnee (WEA, 2008)

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. - Siamak Tazari; Matthias Müller-Hannemann (WG, 2008)

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)

Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. - Siamak Tazari; Matthias Müller-Hannemann (Discret. Appl. Math., 2009)

Non-approximability of just-in-time scheduling. - Matthias Müller-Hannemann; Alexander Sonnikow (J. Sched., 2009)

Efficient Timetable Information in the Presence of Delays. - Matthias Müller-Hannemann; Mathias Schnee (Robust and Online Large-Scale Optimization, 2009)

10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry. - Jason Dykes; Matthias Müller-Hannemann; Alexander Wolff 001 (Schematization in Cartography, Visualization, and Computational Geometry, 2010)

Foundations of Algorithm Engineering. - Matthias Müller-Hannemann; Stefan Schirra (Algorithm Engineering, 2010)

Challenges in Algorithm Engineering. - Matthias Müller-Hannemann; Stefan Schirra (Algorithm Engineering, 2010)

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)

In silico fragmentation for computer assisted identification of metabolite mass spectra. - Sebastian Wolf; Stephan Schmidt; Matthias Müller-Hannemann; Steffen Neumann (BMC Bioinform., 2010)

A near linear time approximation scheme for Steiner tree among obstacles in the plane. - Matthias Müller-Hannemann; Siamak Tazari (Comput. Geom., 2010)

Phase Synchronization in Railway Timetables - Christoph Fretter; Lachezar Krumov; Karsten Weihe; Matthias Müller-Hannemann; Marc-Thorsten Hütt (CoRR, 2010)

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

The Price of Robustness in Timetable Information. - Marc Goerigk; Martin Knoth; Matthias Müller-Hannemann; Marie Schmidt; Anita Schöbel (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)

Introduction to special issue ALENEX'11. - Matthias Müller-Hannemann; Renato Fonseca F. Werneck (ACM J. Exp. Algorithmics, 2011)

Dealing with large hidden constants: engineering a planar steiner tree PTAS. - Siamak Tazari; Matthias Müller-Hannemann (ACM J. Exp. Algorithmics, 2011)

How to find good night train connections. - Thorsten Gunkel; Mathias Schnee; Matthias Müller-Hannemann (Networks, 2011)

Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors. - Steffen Schiele; Holger Blaar; Detlef Thürkow; Markus Möller; Matthias Müller-Hannemann (ARCS Workshops, 2012)

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

Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters. - Steffen Schiele; Markus Möller; Holger Blaar; Detlef Thürkow; Matthias Müller-Hannemann (Comput. Geosci., 2012)

Recoverable Robust Timetable Information. - Marc Goerigk; Sacha Heße; Matthias Müller-Hannemann; Marie Schmidt; Anita Schöbel (ATMOS, 2013)

5th ACM SIGSPATIAL International Workshop on Computational Transportation Science. - Stephan Winter 001; Matthias Müller-Hannemann (ACM SIGSPATIAL Special, 2013)

On Optimal Read Trimming in Next Generation Sequencing and Its Complexity. - Ivo Hedtke; Ioana M. Lemnian; Matthias Müller-Hannemann; Ivo Grosse (AlCoB, 2014)

Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays. - Martin Lemnian; Ralf Rückert; Steffen Rechner; Christoph Blendinger; Matthias Müller-Hannemann (ATMOS, 2014)

Explorative Analysis of Heterogeneous, Unstructured, and Uncertain Data - A Computer Science Perspective on Biodiversity Research. - 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; et al. (DATA, 2014)

The Price of Strict and Light Robustness in Timetable Information. - Marc Goerigk; Marie Schmidt; Anita Schöbel; Martin Knoth; Matthias Müller-Hannemann (Transp. Sci., 2014)

Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics. - Matthias Müller-Hannemann (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (CoRR, 2015)

A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication. - Sarah Hart 001; Ivo Hedtke; Matthias Müller-Hannemann; Sandeep Murthy (Groups Complex. Cryptol., 2015)

Sensitivity Analysis and Coupled Decisions in Passenger Flow-Based Train Dispatching. - Martin Lemnian; Matthias Müller-Hannemann; Ralf Rückert (ATMOS, 2016)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (Algorithm Engineering, 2016)

Robustness Tests for Public Transport Planning. - Markus Friedrich 002; Matthias Müller-Hannemann; Ralf Rückert; Alexander Schiewe; Anita Schöbel (ATMOS, 2017)

Gerbil: a fast and memory-efficient k-mer counter with GPU-support. - Marius Erbert; Steffen Rechner; Matthias Müller-Hannemann (Algorithms Mol. Biol., 2017)

Dynamic Event-Activity Networks in Public Transportation - Timetable Information and Delay Management. - Matthias Müller-Hannemann; Ralf Rückert (Datenbank-Spektrum, 2017)

PANDA: a software tool for improved train dispatching with focus on passenger flows. - Ralf Rückert; Martin Lemnian; Christoph Blendinger; Steffen Rechner; Matthias Müller-Hannemann (Public Transp., 2017)

Robustness as a Third Dimension for Evaluating Public Transport Plans. - Markus Friedrich 002; Matthias Müller-Hannemann; Ralf Rückert; Alexander Schiewe; Anita Schöbel (ATMOS, 2018)

Uniform sampling of bipartite graphs with degrees in prescribed intervals. - Steffen Rechner; Linda Strowick; Matthias Müller-Hannemann (J. Complex Networks, 2018)

Optimal Block-Based Trimming for Next Generation Sequencing. - Ivo Hedtke; Ioana M. Lemnian; Ivo Grosse; Matthias Müller-Hannemann (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Vehicle Capacity-Aware Rerouting of Passengers in Delay Management. - Matthias Müller-Hannemann; Ralf Rückert; Sebastian S. Schmidt (ATMOS, 2019)

MET: a Java package for fast molecule equivalence testing. - Jördis-Ann Schüler; Steffen Rechner; Matthias Müller-Hannemann (J. Cheminformatics, 2020)

Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. - Matthias Müller-Hannemann; Ralf Rückert; Alexander Schiewe; Anita Schöbel (ATMOS, 2021)

Estimating the Robustness of Public Transport Systems Using Machine Learning. - Matthias Müller-Hannemann; Ralf Rückert; Alexander Schiewe; Anita Schöbel (CoRR, 2021)

Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport. - Julian Patzner; Ralf Rückert; Matthias Müller-Hannemann (ATMOS, 2022)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities. - Julian Patzner; Matthias Müller-Hannemann (ATMOS, 2024)

Barcode Selection and Layout Optimization in Spatial Transcriptomics. - Frederik L. Jatzkowski; Antonia Schmidt; Robert Mank; Steffen Schüler; Matthias Müller-Hannemann (SEA, 2024)

Guest Editorial to the Special Issue Public Transport Optimization: From Theory to Practice. - Valentina Cacchiani; Matthias Müller-Hannemann; Federico Perea Rojas-Marcos (Oper. Res. Forum, 2024)

Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. - Julia Meusel; Matthias Müller-Hannemann; Klaus Reinhardt (SAND, 2025)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. - Julia Meusel; Matthias Müller-Hannemann; Klaus Reinhardt (CoRR, 2025)