Matthias Müller-Hannemann

Available identifiers

zbMath Open muller-hannemann.matthiasMaRDI QIDQ820153

List of research outcomes

Publication	Date of Publication	Type
Improved approximations for minimum cardinality quadrangulations of finite element meshes	2021-12-20	Paper
Uniform sampling of bipartite graphs with degrees in prescribed intervals	2021-05-07	Paper
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS	2019-09-11	Paper
Improving the surface cycle structure for hexahedral mesh generation	2017-09-29	Paper
A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication	2015-05-12	Paper
Dealing with large hidden constants	2014-04-01	Paper
Recoverable Robust Timetable Information	2014-02-24	Paper
The Price of Robustness in Timetable Information	2012-09-28	Paper
Stochastic Delay Prediction in Large Train Networks	2012-09-28	Paper
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected	2012-09-28	Paper
Paying Less for Train Connections with MOTIS	2012-09-28	Paper
Passenger Flow-Oriented Train Disposition	2011-09-16	Paper
Dag Realizations of Directed Degree Sequences	2011-08-19	Paper
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks	2011-02-20	Paper
How to find good night train connections	2011-02-17	Paper
Uniform Sampling of Digraphs with a Fixed Degree Sequence	2010-11-16	Paper
Algorithms and Data Structures	2010-04-20	Paper
On the cardinality of the Pareto set in bicriteria shortest path problems	2010-03-23	Paper
A near linear time approximation scheme for Steiner tree among obstacles in the plane	2010-03-16	Paper
Efficient Timetable Information in the Presence of Delays	2009-12-03	Paper
Non-approximability of just-in-time scheduling	2009-12-02	Paper
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation	2009-06-30	Paper
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane	2009-02-17	Paper
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes	2009-01-20	Paper
Workload Balancing in Multi-stage Production Processes	2007-09-14	Paper
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles	2007-09-07	Paper
HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES	2007-07-13	Paper
Algorithms and Computation	2006-11-14	Paper
Moving policies in cyclic assembly line scheduling	2006-04-06	Paper
Parameterized and Exact Computation	2005-08-23	Paper
A memetic algorithm to schedule planned maintenance for the national grid	2005-08-04	Paper
Implementing weighted b-matching algorithms	2005-08-04	Paper
HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES	2005-06-10	Paper
QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES	2005-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4785583	2003-01-05	Paper
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation	2002-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q2764035	2002-01-22	Paper
Shelling Hexahedral Complexes for Mesh Generation	2002-01-07	Paper
On the discrete core of quadrilateral mesh refinement	2001-12-12	Paper
A case study in hexahedral mesh generation: Simulation of the human mandible	2001-12-10	Paper
Hexahedral mesh generation by successive dual cycle elimination	2001-04-10	Paper
Complexity and modeling aspects of mesh refinement into quadrilaterals	2000-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q4252425	1999-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4370208	1998-06-04	Paper
Mesh refinement via bidirected flows	1998-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q4886066	1996-10-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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