Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="M{\"u}ller-Hannemann, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Passenger flow-oriented train disposition
Annabell Berger
,
Christian Blaar
,
Andreas Gebhardt
,
Matthias Müller-Hannemann
,
Mathias Schnee
Lecture Notes in Computer Science
6942
, 2011, pp. 227-238
How to find good night train connections
Thorsten Gunkel
,
Mathias Schnee
,
Matthias Müller-Hannemann
Networks
57
(1), 2011, pp. 19-27
Uniform sampling of digraphs with a fixed degree sequence
Annabell Berger
,
Matthias Müller-Hannemann
Lecture Notes in Computer Science
6410
, 2010, pp. 220-231
A faster shortest-paths algorithm for minor-closed graph classes
Siamak Tazari
,
Matthias Müller-Hannemann
Lecture Notes in Computer Science
5344
, 2008, pp. 360-371
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Matthias Müller-Hannemann
,
Siamak Tazari
Lecture Notes in Computer Science
4619
, 2007, pp. 151-162
Approximation of octilinear Steiner trees constrained by hard and soft obstacles
Matthias Müller-Hannemann
,
Anna Schulze
Lecture Notes in Computer Science
4059
, 2006, pp. 242-254
Moving policies in cyclic assembly line scheduling
Matthias Müller-Hannemann
,
Karsten Weihe
Theoretical Computer Science
351
(3), 2006, pp. 425-436
Hardness and approximation of octilinear Steiner trees
Matthias Müller-Hannemann
,
Anna Schulze
Lecture Notes in Computer Science
3827
, 2005, pp. 256-265
Approximation of rectilinear Steiner trees with length restrictions on obstacles
Matthias Müller-Hannemann
,
Sven Peyer
Lecture Notes in Computer Science
2748
, 2003, pp. 207-218
Slack optimization of timing-critical nets
Matthias Müller-Hannemann
,
Ute Zimmermann
Lecture Notes in Computer Science
2832
, 2003, pp. 727-739
Pareto shortest paths is often feasible in practice
Matthias Müller-Hannemann
,
Karsten Weihe
Lecture Notes in Computer Science
2141
, 2001, pp. 185-197
Combinatorics helps for hexahedral mesh generation in CAD
Matthias Müller-Hannemann
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 949-950
Implementing weighted
b
-matching algorithms: Towards a flexible software design
Matthias Müller-Hannemann
,
Alexander Schwartz
Proceedings of the 2nd Workshop on Algorithm Engineering, WAE'98 (Saarbrücken, Germany, August 20-22, 1998)
(MPI-I-98-1-019), 1998, pp. 86-97
Complexity and modeling aspects of mesh refinement into quadrilaterals
Rolf H. Möhring
,
Matthias Müller-Hannemann
Lecture Notes in Computer Science
1350
, 1997, pp. 263-272
Improved approximations for minimum cardinality quadrangulations of finite element meshes
Matthias Müller-Hannemann
,
Karsten Weihe
Lecture Notes in Computer Science
1284
, 1997, pp. 364-377
Using network flows for surface modeling
Rolf H. Möhring
,
Matthias Müller-Hannemann
,
Karsten Weihe
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 350-359