Matthias Müller-Hannemann

Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

2021

Estimating the Robustness of Public Transport Systems Using Machine Learning.

[BibT_eX]

[DOI]

CoRR, 2021

Towards Improved Robustness of Public Transport by a Machine-Learned Oracle.

[BibT_eX]

[DOI]

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

MET: a Java package for fast molecule equivalence testing.

[BibT_eX]

[DOI]

Jördis-Ann Schüler

J. Cheminformatics, 2020

2019

Vehicle Capacity-Aware Rerouting of Passengers in Delay Management.

[BibT_eX]

[DOI]

Sebastian S. Schmidt

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

Optimal Block-Based Trimming for Next Generation Sequencing.

[BibT_eX]

[DOI]

Ivo Hedtke

Ioana M. Lemnian

Ivo Grosse

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Uniform sampling of bipartite graphs with degrees in prescribed intervals.

[BibT_eX]

[DOI]

Linda Strowick

J. Complex Networks, 2018

Robustness as a Third Dimension for Evaluating Public Transport Plans.

[BibT_eX]

[DOI]

Markus Friedrich

Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

2017

PANDA: a software tool for improved train dispatching with focus on passenger flows.

[BibT_eX]

[DOI]

Public Transp., 2017

Dynamic Event-Activity Networks in Public Transportation - Timetable Information and Delay Management.

[BibT_eX]

[DOI]

Datenbank-Spektrum, 2017

Gerbil: a fast and memory-efficient k-mer counter with GPU-support.

[BibT_eX]

[DOI]

Marius Erbert

Algorithms Mol. Biol., 2017

Robustness Tests for Public Transport Planning.

[BibT_eX]

[DOI]

Markus Friedrich

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Daniel Delling

Andrew V. Goldberg

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Sensitivity Analysis and Coupled Decisions in Passenger Flow-Based Train Dispatching.

[BibT_eX]

[DOI]

Martin Lemnian

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015

A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication.

[BibT_eX]

[DOI]

Sarah Hart

Ivo Hedtke

Sandeep Murthy

Groups Complex. Cryptol., 2015

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Daniel Delling

Andrew V. Goldberg

CoRR, 2015

Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

The Price of Strict and Light Robustness in Timetable Information.

[BibT_eX]

[DOI]

Transp. Sci., 2014

Explorative Analysis of Heterogeneous, Unstructured, and Uncertain Data - A Computer Science Perspective on Biodiversity Research.

[BibT_eX]

[DOI]

Martin Winter

Wolf Zimmermann

Proceedings of the DATA 2014, 2014

Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays.

[BibT_eX]

[DOI]

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

On Optimal Read Trimming in Next Generation Sequencing and Its Complexity.

[BibT_eX]

[DOI]

Ivo Hedtke

Ioana M. Lemnian

Ivo Grosse

Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013

5th ACM SIGSPATIAL International Workshop on Computational Transportation Science.

[BibT_eX]

[DOI]

Stephan Winter

ACM SIGSPATIAL Special, 2013

Recoverable Robust Timetable Information.

[BibT_eX]

[DOI]

Marc Goerigk

Sacha Heße

Marie Schmidt

Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

2012

Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters.

[BibT_eX]

[DOI]

Comput. Geosci., 2012

How to Attack the NP-Complete Dag Realization Problem in Practice.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors.

[BibT_eX]

[DOI]

Proceedings of the ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany, 2012

2011

How to find good night train connections.

[BibT_eX]

[DOI]

Thorsten Gunkel

Networks, 2011

Dealing with large hidden constants: engineering a planar steiner tree PTAS.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Introduction to special issue ALENEX'11.

[BibT_eX]

[DOI]

Renato Fonseca F. Werneck

ACM J. Exp. Algorithmics, 2011

Efficient Computation of Time-Dependent Centralities in Air Transportation Networks.

[BibT_eX]

[DOI]

Alexander Zock

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Dag Realizations of Directed Degree Sequences.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Passenger Flow-Oriented Train Disposition.

[BibT_eX]

[DOI]

Christian Blaar

Andreas Gebhardt

Proceedings of the Algorithms - ESA 2011, 2011

The Price of Robustness in Timetable Information.

[BibT_eX]

[DOI]

Marc Goerigk

Martin Knoth

Marie Schmidt

Proceedings of the ATMOS 2011, 2011

Stochastic Delay Prediction in Large Train Networks.

[BibT_eX]

[DOI]

Andreas Gebhardt

Martin Ostrowski

Proceedings of the ATMOS 2011, 2011

2010

Phase Synchronization in Railway Timetables

[BibT_eX]

[DOI]

Christoph Fretter

Lachezar Krumov

Marc-Thorsten Hütt

CoRR, 2010

A near linear time approximation scheme for Steiner tree among obstacles in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2010

In silico fragmentation for computer assisted identification of metabolite mass spectra.

[BibT_eX]

[DOI]

Sebastian Wolf

Stephan Schmidt

Steffen Neumann

BMC Bioinform., 2010

Uniform Sampling of Digraphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks.

[BibT_eX]

[DOI]

Martin Grimmer

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Challenges in Algorithm Engineering.

[BibT_eX]

[DOI]

Stefan Schirra

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

Foundations of Algorithm Engineering.

[BibT_eX]

[DOI]

Stefan Schirra

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry.

[BibT_eX]

[DOI]

Jason Dykes

Alexander Wolff

Proceedings of the Schematization in Cartography, Visualization, and Computational Geometry, 14.11., 2010

2009

Efficient Timetable Information in the Presence of Delays.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Non-approximability of just-in-time scheduling.

[BibT_eX]

[DOI]

Alexander Sonnikow

J. Sched., 2009

Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Uniform sampling of undirected and directed graphs with a fixed degree sequence

[BibT_eX]

[DOI]

CoRR, 2009

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected.

[BibT_eX]

[DOI]

Daniel Delling

Andreas Gebhardt

Proceedings of the ATMOS 2009, 2009

2008

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Multi-criteria Shortest Paths in Time-Dependent Train Networks.

[BibT_eX]

[DOI]

Yann Disser

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Efficient On-Trip Timetable Information in the Presence of Delays.

[BibT_eX]

[DOI]

Lennart Frede

Proceedings of the ATMOS 2008, 2008

2007

Hardness and Approximation of Octilinear Steiner Trees.

[BibT_eX]

[DOI]

Anna Schulze

Int. J. Comput. Geom. Appl., 2007

Engineering Computational Technology.

[BibT_eX]

[DOI]

Anders Eriksson

Kurt Marti

Barry H. V. Topping

Carlos A. Mota Soares

Adv. Eng. Softw., 2007

Improved Search for Night Train Connections.

[BibT_eX]

[DOI]

Thorsten Gunkel

Proceedings of the ATMOS 2007, 2007

2006

Moving policies in cyclic assembly line scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On the cardinality of the Pareto set in bicriteria shortest path problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

Workload Balancing in Multi-stage Production Processes.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.

[BibT_eX]

[DOI]

Anna Schulze

Proceedings of the Algorithm Theory, 2006

ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways.

[BibT_eX]

[DOI]

Riko Jacob

Proceedings of the ATMOS 2006, 2006

ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways.

[BibT_eX]

[DOI]

Riko Jacob

Proceedings of the ATMOS 2006, 2006

2005

Paying Less for Train Connections with MOTIS.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

2004

Timetable Information: Models and Algorithms.

[BibT_eX]

[DOI]

Frank Schulz

Dorothea Wagner

Christos D. Zaroliagis

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

Finding All Attractive Train Connections by Multi-criteria Pareto Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.

[BibT_eX]

[DOI]

Sven Peyer

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Slack Optimization of Timing-Critical Nets.

[BibT_eX]

[DOI]

Ute Zimmermann

Proceedings of the Algorithms, 2003

2002

Getting Train Timetables into the Main Storage.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation.

[BibT_eX]

[DOI]

Comput. Geom., 2002

2001

Shelling Hexahedral Complexes for Mesh Generation.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2001

A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible.

[BibT_eX]

[DOI]

Cornelia Kober

Eng. Comput., 2001

Pareto Shortest Paths is Often Feasible in Practice.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2001

Anisotropic Validation of Hexahedral Meshes for Composite Materials in Biomechanics.

[BibT_eX]

[DOI]

Cornelia Kober

Robert Sader

Hans-Florian Zeilhofer

Proceedings of the 10th International Meshing Roundtable, 2001

2000

Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.

[BibT_eX]

[DOI]

Alexander Schwartz

ACM J. Exp. Algorithmics, 2000

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.

[BibT_eX]

[DOI]

Algorithmica, 2000

Hexahedral Mesh Generation for the Simulation of the Human Mandible.

[BibT_eX]

[DOI]

Cornelia Kober

Proceedings of the 9th International Meshing Roundtable, 2000

Improving the surface cycle structure for hexahedral mesh generation.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.

[BibT_eX]

[DOI]

Alexander Schwartz

ACM J. Exp. Algorithmics, 1999

Hexahedral Mesh Generation by Successive Dual Cycle Elimination.

[BibT_eX]

[DOI]

Eng. Comput., 1999

Combinatorics Helps for Hexahedral Mesh Generation in CAD.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Kombinatorische Algorithmen zur Netzgenerierung im CAD.

[BibT_eX]

[DOI]

Proceedings of the Informatik '99, 1999

Drawing Trees, Series-Parallel Digraphs, and Lattices.

[BibT_eX]

[DOI]

Proceedings of the Drawing Graphs, 1999

Empirical Design of Geometric Algorithms.

[BibT_eX]

[DOI]

Ulrik Brandes

Annegret Liebers

Dorothea Wagner

Thomas Willhalm

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1997

Quadrilateral mesh generation in computer aided design.

[BibT_eX]

[DOI]

PhD thesis, 1997

Mesh refinement via bidirected flows: modeling, complexity, and computational results.

[BibT_eX]

[DOI]

J. ACM, 1997

Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

Minimum Strictly Convex Quadrangulations of Convex Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995

Using Network Flows for Surface Modeling.

[BibT_eX]

[DOI]