Matthias Müller-Hannemann

From MaRDI portal
Person:820153

Available identifiers

zbMath Open muller-hannemann.matthiasMaRDI QIDQ820153

List of research outcomes





PublicationDate of PublicationType
Robustness as a third-dimension for evaluating public transport plans2024-08-27Paper
Vehicle capacity-aware rerouting of passengers in delay management2024-08-22Paper
Towards improved robustness of public transport by a machine-learned oracle2024-08-13Paper
Robustness tests for public transport planning2024-07-11Paper
Passenger-aware real-time planning of short turns to reduce delays in public transport2024-07-10Paper
Improved approximations for minimum cardinality quadrangulations of finite element meshes2021-12-20Paper
Uniform sampling of bipartite graphs with degrees in prescribed intervals2021-05-07Paper
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS2019-09-11Paper
Improving the surface cycle structure for hexahedral mesh generation2017-09-29Paper
A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication2015-05-12Paper
Dealing with large hidden constants2014-04-01Paper
Recoverable Robust Timetable Information2014-02-24Paper
The price of robustness in timetable information2012-09-28Paper
Paying less for train connections with MOTIS2012-09-28Paper
Accelerating time-dependent multi-criteria timetable information is harder than expected2012-09-28Paper
Stochastic delay prediction in large train networks2012-09-28Paper
Passenger Flow-Oriented Train Disposition2011-09-16Paper
Dag Realizations of Directed Degree Sequences2011-08-19Paper
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks2011-02-20Paper
How to find good night train connections2011-02-17Paper
Uniform Sampling of Digraphs with a Fixed Degree Sequence2010-11-16Paper
Approximation of rectilinear Steiner trees with length restrictions on obstacles.2010-04-20Paper
On the cardinality of the Pareto set in bicriteria shortest path problems2010-03-23Paper
A near linear time approximation scheme for Steiner tree among obstacles in the plane2010-03-16Paper
Efficient Timetable Information in the Presence of Delays2009-12-03Paper
Non-approximability of just-in-time scheduling2009-12-02Paper
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation2009-06-30Paper
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane2009-02-17Paper
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes2009-01-20Paper
Workload Balancing in Multi-stage Production Processes2007-09-14Paper
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles2007-09-07Paper
HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES2007-07-13Paper
Algorithms and Computation2006-11-14Paper
Moving policies in cyclic assembly line scheduling2006-04-06Paper
Parameterized and Exact Computation2005-08-23Paper
A memetic algorithm to schedule planned maintenance for the national grid2005-08-04Paper
Implementing weighted b-matching algorithms2005-08-04Paper
QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES2005-06-10Paper
HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q47855832003-01-05Paper
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation2002-06-24Paper
https://portal.mardi4nfdi.de/entity/Q27640352002-01-22Paper
Shelling hexahedral complexes for mesh generation2002-01-07Paper
On the discrete core of quadrilateral mesh refinement2001-12-12Paper
A case study in hexahedral mesh generation: Simulation of the human mandible2001-12-10Paper
Hexahedral mesh generation by successive dual cycle elimination2001-04-10Paper
Complexity and modeling aspects of mesh refinement into quadrilaterals2000-12-05Paper
https://portal.mardi4nfdi.de/entity/Q42524251999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43702081998-06-04Paper
Mesh refinement via bidirected flows1998-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48860661996-10-21Paper

Research outcomes over time

This page was built for person: Matthias Müller-Hannemann