 | 2009 |
|---|
| 52 |       | Siamak Tazari,
Matthias Müller-Hannemann:
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS.
ALENEX 2009: 120-131 |
| 51 | | Annabell Berger,
Daniel Delling,
Andreas Gebhardt,
Matthias Müller-Hannemann:
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected.
ATMOS 2009 |
| 50 | | Matthias Müller-Hannemann,
Mathias Schnee:
Efficient Timetable Information in the Presence of Delays.
Robust and Online Large-Scale Optimization 2009: 249-272 |
| 49 | | Annabell Berger,
Matthias Müller-Hannemann:
Uniform sampling of undirected and directed graphs with a fixed degree sequence
CoRR abs/0912.0685: (2009) |
| 48 | | Siamak Tazari,
Matthias Müller-Hannemann:
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.
Discrete Applied Mathematics 157(4): 673-684 (2009) |
| 47 | | Matthias Müller-Hannemann,
Alexander Sonnikow:
Non-approximability of just-in-time scheduling.
J. Scheduling 12(5): 555-562 (2009) |
| 2008 |
|---|
| 46 | | Lennart Frede,
Matthias Müller-Hannemann,
Mathias Schnee:
Efficient On-Trip Timetable Information in the Presence of Delays.
ATMOS 2008 |
| 45 | | Yann Disser,
Matthias Müller-Hannemann,
Mathias Schnee:
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
WEA 2008: 347-361 |
| 44 | | Siamak Tazari,
Matthias Müller-Hannemann:
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.
WG 2008: 360-371 |
| 2007 |
|---|
| 43 | | Thorsten Gunkel,
Matthias Müller-Hannemann,
Mathias Schnee:
Improved Search for Night Train Connections.
ATMOS 2007 |
| 42 | | Matthias Müller-Hannemann,
Siamak Tazari:
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.
WADS 2007: 151-162 |
| 41 | | A. Eriksson,
K. Marti,
Matthias Müller-Hannemann,
Barry H. V. Topping,
C. A. Mota Soares:
Engineering Computational Technology.
Advances in Engineering Software 38(11-12): 723-725 (2007) |
| 40 | | Matthias Müller-Hannemann,
Anna Schulze:
Hardness and Approximation of Octilinear Steiner Trees.
Int. J. Comput. Geometry Appl. 17(3): 231-260 (2007) |
| 2006 |
|---|
| 39 |  | Riko Jacob,
Matthias Müller-Hannemann:
ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, September 14, 2006, ETH Zürich, Zurich, Switzerland, Selected Papers
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 38 | | 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 |
| 37 | | Riko Jacob,
Matthias Müller-Hannemann:
ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways.
ATMOS 2006 |
| 36 | | Matthias Müller-Hannemann,
Anna Schulze:
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
SWAT 2006: 242-254 |
| 35 | | Siamak Tazari,
Matthias Müller-Hannemann,
Karsten Weihe:
Workload Balancing in Multi-stage Production Processes.
WEA 2006: 49-60 |
| 34 | | Matthias Müller-Hannemann,
Karsten Weihe:
On the cardinality of the Pareto set in bicriteria shortest path problems.
Annals OR 147(1): 269-286 (2006) |
| 33 | | Matthias Müller-Hannemann,
Karsten Weihe:
Moving policies in cyclic assembly line scheduling.
Theor. Comput. Sci. 351(3): 425-436 (2006) |
| 2005 |
|---|
| 32 | | Matthias Müller-Hannemann,
Mathias Schnee:
Paying Less for Train Connections with MOTIS.
ATMOS 2005 |
| 31 | | Matthias Müller-Hannemann,
Anna Schulze:
Hardness and Approximation of Octilinear Steiner Trees.
ISAAC 2005: 256-265 |
| 2004 |
|---|
| 30 | | Matthias Müller-Hannemann,
Mathias Schnee:
Finding All Attractive Train Connections by Multi-criteria Pareto Search.
ATMOS 2004: 246-263 |
| 29 | | Matthias Müller-Hannemann,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Timetable Information: Models and Algorithms.
ATMOS 2004: 67-90 |
| 28 | | Matthias Müller-Hannemann,
Karsten Weihe:
Moving Policies in Cyclic Assembly-Line Scheduling.
IWPEC 2004: 149-161 |
| 2003 |
|---|
| 27 | | Matthias Müller-Hannemann,
Ute Zimmermann:
Slack Optimization of Timing-Critical Nets.
ESA 2003: 727-739 |
| 26 | | Matthias Müller-Hannemann,
Sven Peyer:
Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.
WADS 2003: 207-218 |
| 2002 |
|---|
| 25 | | Matthias Müller-Hannemann:
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation.
Comput. Geom. 22(1-3): 75-97 (2002) |
| 24 | | Matthias Müller-Hannemann,
Mathias Schnee,
Karsten Weihe:
Getting Train Timetables into the Main Storage.
Electr. Notes Theor. Comput. Sci. 66(6): (2002) |
| 2001 |
|---|
| 23 | | Matthias Müller-Hannemann,
Karsten Weihe:
Pareto Shortest Paths is Often Feasible in Practice.
Algorithm Engineering 2001: 185-198 |
| 22 | | Cornelia Kober,
Matthias Müller-Hannemann:
A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible.
Eng. Comput. (Lond.) 17(3): 249-260 (2001) |
| 21 | | Matthias Müller-Hannemann:
Shelling Hexahedral Complexes for Mesh Generation.
J. Graph Algorithms Appl. 5(5): 59-91 (2001) |
| 2000 |
|---|
| 20 | | Cornelia Kober,
Matthias Müller-Hannemann:
Hexahedral Mesh Generation for the Simulation of the Human Mandible.
IMR 2000: 423-434 |
| 19 | | Matthias Müller-Hannemann:
Improving the surface cycle structure for hexahedral mesh generation.
Symposium on Computational Geometry 2000: 19-28 |
| 18 | | Matthias Müller-Hannemann,
Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.
ACM Journal of Experimental Algorithmics 5: 8 (2000) |
| 17 | | Rolf H. Möhring,
Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.
Algorithmica 26(1): 148-171 (2000) |
| 16 | | Matthias Müller-Hannemann,
Karsten Weihe:
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes.
Int. J. Comput. Geometry Appl. 10(1): 1-40 (2000) |
| 15 | | Matthias Müller-Hannemann:
High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques.
Int. J. Comput. Geometry Appl. 10(3): 285-307 (2000) |
| 1999 |
|---|
| 14 | | Matthias Müller-Hannemann,
Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.
ALENEX 1999: 18-36 |
| 13 | | Matthias Müller-Hannemann:
Drawing Trees, Series-Parallel Digraphs, and Lattices.
Drawing Graphs 1999: 46-70 |
| 12 | | Matthias Müller-Hannemann:
Kombinatorische Algorithmen zur Netzgenerierung im CAD.
GI Jahrestagung 1999: 138-145 |
| 11 | | Matthias Müller-Hannemann:
Combinatorics Helps for Hexahedral Mesh Generation in CAD.
SODA 1999: 949-950 |
| 10 | | Karsten Weihe,
Ulrik Brandes,
Annegret Liebers,
Matthias Müller-Hannemann,
Dorothea Wagner,
Thomas Willhalm:
Empirical Design of Geometric Algorithms.
Symposium on Computational Geometry 1999: 86-94 |
| 9 | | Matthias Müller-Hannemann,
Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.
ACM Journal of Experimental Algorithmics 4: 7 (1999) |
| 8 | | Matthias Müller-Hannemann:
Hexahedral Mesh Generation by Successive Dual Cycle Elimination.
Eng. Comput. (Lond.) 15(3): 269-279 (1999) |
| 1998 |
|---|
| 7 | | Matthias Müller-Hannemann,
Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.
Algorithm Engineering 1998: 86-97 |
| 6 | | Matthias Müller-Hannemann:
Hexahedral Mesh generation by Successive Dual Cycle Elimination.
IMR 1998: 379-393 |
| 1997 |
|---|
| 5 | | Matthias Müller-Hannemann,
Karsten Weihe:
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes.
ESA 1997: 364-377 |
| 4 | | Rolf H. Möhring,
Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals.
ISAAC 1997: 263-272 |
| 3 | | Matthias Müller-Hannemann,
Karsten Weihe:
Minimum Strictly Convex Quadrangulations of Convex Polygons.
Symposium on Computational Geometry 1997: 193-202 |
| 2 | | Rolf H. Möhring,
Matthias Müller-Hannemann,
Karsten Weihe:
Mesh refinement via bidirected flows: modeling, complexity, and computational results.
J. ACM 44(3): 395-426 (1997) |
| 1995 |
|---|
| 1 | | Rolf H. Möhring,
Matthias Müller-Hannemann,
Karsten Weihe:
Using Network Flows for Surface Modeling.
SODA 1995: 350-359 |
