|
Search the dblp DataBase
Michael Formann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Michael Formann, Frank Wagner
A Packing Problem with Applications to Lettering of Maps. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:281-288 [Conf]
- 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 [Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:86-95 [Conf]
- Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP] SODA, 1991, pp:475-482 [Conf]
- Michael Formann
Weighted Closest Pairs. [Citation Graph (0, 0)][DBLP] STACS, 1993, pp:270-281 [Conf]
- Michael Formann, Frank Wagner
The VLSI layout in various embedding models. [Citation Graph (0, 0)][DBLP] WG, 1990, pp:130-139 [Conf]
- Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
Faster Isometric Embedding in Products of Complete Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:52, n:1, pp:17-28 [Journal]
- Michael Formann, Gerhard J. Woeginger
On the reconstruction of simple polygons. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1990, v:40, n:, pp:225-230 [Journal]
- Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:15, n:2, pp:267-283 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal]
Search in 0.002secs, Finished in 0.003secs
|