| 1994 |
|---|
| 9 | EE | Franz Aurenhammer,
Michael Formann,
Ramana M. Idury,
Alejandro A. Schäffer,
Frank Wagner:
Faster Isometric Embedding in Products of Complete Graphs.
Discrete Applied Mathematics 52(1): 17-28 (1994) |
| 1993 |
|---|
| 8 | | Michael Formann:
Weighted Closest Pairs.
STACS 1993: 270-281 |
| 7 | | Michael Formann,
Dorothea Wagner,
Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length.
J. Algorithms 15(2): 267-283 (1993) |
| 6 | | Michael Formann,
Torben Hagerup,
James Haralambides,
Michael Kaufmann,
Frank Thomson Leighton,
Antonios Symvonis,
Emo Welzl,
Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput. 22(5): 1035-1052 (1993) |
| 1991 |
|---|
| 5 | | Michael Formann,
Dorothea Wagner,
Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length.
SODA 1991: 475-482 |
| 4 | EE | Michael Formann,
Frank Wagner:
A Packing Problem with Applications to Lettering of Maps.
Symposium on Computational Geometry 1991: 281-288 |
| 1990 |
|---|
| 3 | | Michael Formann,
Torben Hagerup,
James Haralambides,
Michael Kaufmann,
Frank Thomson Leighton,
Antonios Symvonis,
Emo Welzl,
Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution
FOCS 1990: 86-95 |
| 2 | | Michael Formann,
Frank Wagner:
The VLSI layout in various embedding models.
WG 1990: 130-139 |
| 1 | | Michael Formann,
Gerhard J. Woeginger:
On the reconstruction of simple polygons.
Bulletin of the EATCS 40: 225-230 (1990) |
