dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Matthias Müller-Hannemann Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann: How to Attack the NP-Complete Dag Realization Problem in Practice. SEA 2012: 51-62
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann: How to Attack the NP-complete Dag Realization Problem in Practice CoRR abs/1203.3636: (2012)
2011
68no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Renato Fonseca F. Werneck: Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011 SIAM 2011
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann, Martin Ostrowski: Stochastic Delay Prediction in Large Train Networks. ATMOS 2011: 100-111
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel: The Price of Robustness in Timetable Information. ATMOS 2011: 76-87
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee: Passenger Flow-Oriented Train Disposition. ESA 2011: 227-238
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann: Dag Realizations of Directed Degree Sequences. FCT 2011: 264-275
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock: Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. WALCOM 2011: 77-88
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSiamak Tazari, Matthias Müller-Hannemann: Dealing with large hidden constants: engineering a planar steiner tree PTAS. ACM Journal of Experimental Algorithmics 16: (2011)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann: How to find good night train connections. Networks 57(1): 19-27 (2011)
2010
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Stefan Schirra: Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar] Springer 2010
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Stefan Schirra: Foundations of Algorithm Engineering. Algorithm Engineering 2010: 1-15
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Stefan Schirra: Challenges in Algorithm Engineering. Algorithm Engineering 2010: 446-453
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Martin Grimmer, Matthias Müller-Hannemann: Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. SEA 2010: 35-46
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann: Uniform Sampling of Digraphs with a Fixed Degree Sequence. WG 2010: 220-231
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSebastian Wolf, Stephan Schmidt, Matthias Müller-Hannemann, Steffen Neumann: In silico fragmentation for computer assisted identification of metabolite mass spectra. BMC Bioinformatics 11: 148 (2010)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt: Phase Synchronization in Railway Timetables CoRR abs/1003.4012: (2010)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Siamak Tazari: A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43(4): 395-409 (2010)
2009
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSiamak Tazari, Matthias Müller-Hannemann: Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. ALENEX 2009: 120-131
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS 2009
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Mathias Schnee: Efficient Timetable Information in the Presence of Delays. Robust and Online Large-Scale Optimization 2009: 249-272
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnnabell Berger, Matthias Müller-Hannemann: Uniform sampling of undirected and directed graphs with a fixed degree sequence CoRR abs/0912.0685: (2009)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSiamak 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)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Alexander Sonnikow: Non-approximability of just-in-time scheduling. J. Scheduling 12(5): 555-562 (2009)
2008
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLennart Frede, Matthias Müller-Hannemann, Mathias Schnee: Efficient On-Trip Timetable Information in the Presence of Delays. ATMOS 2008
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYann Disser, Matthias Müller-Hannemann, Mathias Schnee: Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA 2008: 347-361
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSiamak Tazari, Matthias Müller-Hannemann: A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. WG 2008: 360-371
2007
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThorsten Gunkel, Matthias Müller-Hannemann, Mathias Schnee: Improved Search for Night Train Connections. ATMOS 2007
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Siamak Tazari: A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. WADS 2007: 151-162
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Anna Schulze: Hardness and Approximation of Octilinear Steiner Trees. Int. J. Comput. Geometry Appl. 17(3): 231-260 (2007)
2006
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiko 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
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiko 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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiko Jacob, Matthias Müller-Hannemann: ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS 2006
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Anna Schulze: Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. SWAT 2006: 242-254
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSiamak Tazari, Matthias Müller-Hannemann, Karsten Weihe: Workload Balancing in Multi-stage Production Processes. WEA 2006: 49-60
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: On the cardinality of the Pareto set in bicriteria shortest path problems. Annals OR 147(1): 269-286 (2006)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351(3): 425-436 (2006)
2005
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Mathias Schnee: Paying Less for Train Connections with MOTIS. ATMOS 2005
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Anna Schulze: Hardness and Approximation of Octilinear Steiner Trees. ISAAC 2005: 256-265
2004
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Mathias Schnee: Finding All Attractive Train Connections by Multi-criteria Pareto Search. ATMOS 2004: 246-263
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Timetable Information: Models and Algorithms. ATMOS 2004: 67-90
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC 2004: 149-161
2003
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Ute Zimmermann: Slack Optimization of Timing-Critical Nets. ESA 2003: 727-739
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Sven Peyer: Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. WADS 2003: 207-218
2002
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation. Comput. Geom. 22(1-3): 75-97 (2002)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Mathias Schnee, Karsten Weihe: Getting Train Timetables into the Main Storage. Electr. Notes Theor. Comput. Sci. 66(6): 8-17 (2002)
2001
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: Pareto Shortest Paths is Often Feasible in Practice. Algorithm Engineering 2001: 185-198
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCornelia 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)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Shelling Hexahedral Complexes for Mesh Generation. J. Graph Algorithms Appl. 5(5): 59-91 (2001)
2000
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCornelia Kober, Matthias Müller-Hannemann: Hexahedral Mesh Generation for the Simulation of the Human Mandible. IMR 2000: 423-434
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Improving the surface cycle structure for hexahedral mesh generation. Symposium on Computational Geometry 2000: 19-28
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Alexander Schwartz: Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ACM Journal of Experimental Algorithmics 5: 8 (2000)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRolf H. Möhring, Matthias Müller-Hannemann: Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. Algorithmica 26(1): 148-171 (2000)
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias 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)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Alexander Schwartz: Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ALENEX 1999: 18-36
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Drawing Trees, Series-Parallel Digraphs, and Lattices. Drawing Graphs 1999: 46-70
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Kombinatorische Algorithmen zur Netzgenerierung im CAD. GI Jahrestagung 1999: 138-145
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Combinatorics Helps for Hexahedral Mesh Generation in CAD. SODA 1999: 949-950
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarsten 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Alexander Schwartz: Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. ACM Journal of Experimental Algorithmics 4: 7 (1999)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Hexahedral Mesh Generation by Successive Dual Cycle Elimination. Eng. Comput. (Lond.) 15(3): 269-279 (1999)
1998
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Alexander Schwartz: Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. Algorithm Engineering 1998: 86-97
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann: Hexahedral Mesh generation by Successive Dual Cycle Elimination. IMR 1998: 379-393
1997
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA 1997: 364-377
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRolf H. Möhring, Matthias Müller-Hannemann: Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. ISAAC 1997: 263-272
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Müller-Hannemann, Karsten Weihe: Minimum Strictly Convex Quadrangulations of Convex Polygons. Symposium on Computational Geometry 1997: 193-202
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRolf 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe: Using Network Flows for Surface Modeling. SODA 1995: 350-359

Coauthor Index

1Annabell Berger [49] [51] [56] [57] [63] [64] [65] [67] [69] [70]
2Christian Blaar [65]
3Ulrik Brandes [10]
4Daniel Delling [51]
5Yann Disser [45]
6A. Eriksson [41]
7Lennart Frede [46]
8Christoph Fretter [54]
9Andreas Gebhardt [51] [65] [67]
10Marc Goerigk [66]
11Martin Grimmer [57]
12Thorsten Gunkel [43] [61]
13Marc-Thorsten Hütt [54]
14Riko Jacob [37] [38] [39]
15Martin Knoth [66]
16Cornelia Kober [20] [22]
17Lachezar Krumov [54]
18Annegret Liebers [10]
19K. Marti [41]
20Rolf H. Möhring [1] [2] [4] [17]
21Steffen Neumann [55]
22Martin Ostrowski [67]
23Sven Peyer [26]
24Steffen Rechner [63]
25Stefan Schirra [58] [59] [60]
26Marie Schmidt [66]
27Stephan Schmidt [55]
28Mathias Schnee [24] [30] [32] [43] [45] [46] [50] [61] [65]
29Anita Schöbel [66]
30Frank Schulz [29]
31Anna Schulze [31] [36] [40]
32Alexander Schwartz [7] [9] [14] [18]
33C. A. Mota Soares [41]
34Alexander Sonnikow [47]
35Siamak Tazari [35] [42] [44] [48] [52] [53] [62]
36Barry H. V. Topping [41]
37Dorothea Wagner [10] [29]
38Karsten Weihe [1] [2] [3] [5] [10] [16] [23] [24] [28] [33] [34] [35] [54]
39Renato Fonseca F. Werneck [68]
40Thomas Willhalm [10]
41Sebastian Wolf [55]
42Christos D. Zaroliagis [29]
43Ute Zimmermann [27]
44Alexander Zock [63]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page