The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthias Müller-Hannemann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthias Müller-Hannemann, Alexander Schwartz
    Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:18-36 [Conf]
  2. Matthias Müller-Hannemann
    Improving the surface cycle structure for hexahedral mesh generation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:19-28 [Conf]
  3. Matthias Müller-Hannemann, Karsten Weihe
    Minimum Strictly Convex Quadrangulations of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:193-202 [Conf]
  4. Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
    Empirical Design of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:86-94 [Conf]
  5. Matthias Müller-Hannemann
    Drawing Trees, Series-Parallel Digraphs, and Lattices. [Citation Graph (0, 0)][DBLP]
    Drawing Graphs, 1999, pp:46-70 [Conf]
  6. Matthias Müller-Hannemann, Karsten Weihe
    Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:364-377 [Conf]
  7. Matthias Müller-Hannemann, Ute Zimmermann
    Slack Optimization of Timing-Critical Nets. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:727-739 [Conf]
  8. Matthias Müller-Hannemann
    Kombinatorische Algorithmen zur Netzgenerierung im CAD. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:138-145 [Conf]
  9. Cornelia Kober, Matthias Müller-Hannemann
    Hexahedral Mesh Generation for the Simulation of the Human Mandible. [Citation Graph (0, 0)][DBLP]
    IMR, 2000, pp:423-434 [Conf]
  10. Matthias Müller-Hannemann
    Hexahedral Mesh generation by Successive Dual Cycle Elimination. [Citation Graph (0, 0)][DBLP]
    IMR, 1998, pp:379-393 [Conf]
  11. Rolf H. Möhring, Matthias Müller-Hannemann
    Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:263-272 [Conf]
  12. Matthias Müller-Hannemann, Anna Schulze
    Hardness and Approximation of Octilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:256-265 [Conf]
  13. Matthias Müller-Hannemann, Karsten Weihe
    Moving Policies in Cyclic Assembly-Line Scheduling. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:149-161 [Conf]
  14. Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
    Using Network Flows for Surface Modeling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:350-359 [Conf]
  15. Matthias Müller-Hannemann
    Combinatorics Helps for Hexahedral Mesh Generation in CAD. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:949-950 [Conf]
  16. Matthias Müller-Hannemann, Anna Schulze
    Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:242-254 [Conf]
  17. Matthias Müller-Hannemann, Sven Peyer
    Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:207-218 [Conf]
  18. Matthias Müller-Hannemann, Alexander Schwartz
    Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:86-97 [Conf]
  19. Matthias Müller-Hannemann, Karsten Weihe
    Pareto Shortest Paths is Often Feasible in Practice. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:185-198 [Conf]
  20. Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
    Workload Balancing in Multi-stage Production Processes. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:49-60 [Conf]
  21. Rolf H. Möhring, Matthias Müller-Hannemann
    Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:148-171 [Journal]
  22. Matthias Müller-Hannemann
    Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:22, n:1-3, pp:75-97 [Journal]
  23. Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe
    Getting Train Timetables into the Main Storage. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
  24. Cornelia Kober, Matthias Müller-Hannemann
    A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2001, v:17, n:3, pp:249-260 [Journal]
  25. Matthias Müller-Hannemann
    Hexahedral Mesh Generation by Successive Dual Cycle Elimination. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 1999, v:15, n:3, pp:269-279 [Journal]
  26. Matthias Müller-Hannemann
    High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:3, pp:285-307 [Journal]
  27. Matthias Müller-Hannemann, Karsten Weihe
    Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:1-40 [Journal]
  28. Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
    Mesh refinement via bidirected flows: modeling, complexity, and computational results. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:395-426 [Journal]
  29. Matthias Müller-Hannemann, Alexander Schwartz
    Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:8- [Journal]
  30. Matthias Müller-Hannemann, Alexander Schwartz
    Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:7- [Journal]
  31. Matthias Müller-Hannemann
    Shelling Hexahedral Complexes for Mesh Generation. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:5, pp:59-91 [Journal]
  32. Matthias Müller-Hannemann, Karsten Weihe
    Moving policies in cyclic assembly line scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:425-436 [Journal]
  33. Matthias Müller-Hannemann, Siamak Tazari
    A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:151-162 [Conf]

  34. Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. [Citation Graph (, )][DBLP]


  35. Foundations of Algorithm Engineering. [Citation Graph (, )][DBLP]


  36. Challenges in Algorithm Engineering. [Citation Graph (, )][DBLP]


  37. Multi-criteria Shortest Paths in Time-Dependent Train Networks. [Citation Graph (, )][DBLP]


  38. Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. [Citation Graph (, )][DBLP]


  39. A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. [Citation Graph (, )][DBLP]


  40. Improved Search for Night Train Connections. [Citation Graph (, )][DBLP]


  41. Efficient On-Trip Timetable Information in the Presence of Delays. [Citation Graph (, )][DBLP]


  42. Finding All Attractive Train Connections by Multi-criteria Pareto Search. [Citation Graph (, )][DBLP]


  43. Timetable Information: Models and Algorithms. [Citation Graph (, )][DBLP]


  44. ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. [Citation Graph (, )][DBLP]


  45. ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. [Citation Graph (, )][DBLP]


  46. Paying Less for Train Connections with MOTIS. [Citation Graph (, )][DBLP]


  47. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. [Citation Graph (, )][DBLP]


  48. In silico fragmentation for computer assisted identification of metabolite mass spectra. [Citation Graph (, )][DBLP]


  49. A near linear time approximation scheme for Steiner tree among obstacles in the plane. [Citation Graph (, )][DBLP]


  50. Uniform sampling of undirected and directed graphs with a fixed degree sequence [Citation Graph (, )][DBLP]


  51. Phase Synchronization in Railway Timetables [Citation Graph (, )][DBLP]


  52. Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002