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="Kant, Goos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
2-visibility drawings of planar graphs
Ulrich Föss̈meier
,
Goos Kant
,
Michael Kaufmann
Lecture Notes in Computer Science
1190
, 1997, pp. 155-168
Triangulating planar graphs while minimizing the maximum degree
Goos Kant
,
Hans L. Bodlaender
Information and Computation
135
(1), 1997, pp. 1-14
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Goos Kant
,
Xin He
Theoretical Computer Science
172
(1-2), 1997, pp. 175-193
Area requirement of visibility representation of trees
Goos Kant
,
Giuseppe Liotta
,
Roberto Tamassia
,
Ioannis G. Tollis
Information Processing Letters
62
(2), 1997, pp. 81-88
Augmenting outerplanar graphs
Goos Kant
Journal of Algorithms
21
(1), 1996, pp. 1-25
On triangulating planar graphs under the four-connectivity constraint
Therese Biedl
,
Goos Kant
,
Michael Kaufmann
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 83-94
A better heuristic for orthogonal graph drawings
Therese Biedl
,
Goos Kant
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 24-35
Two algorithms for finding rectangular duals of planar graphs
Goos Kant
,
Xin He
Lecture Notes in Computer Science
790
, 1993, pp. 396-410
Hexagonal grid drawings
Goos Kant
Lecture Notes in Computer Science
657
, 1993, pp. 263-276
A more compact visibility representation
Goos Kant
Lecture Notes in Computer Science
790
, 1993, pp. 411-424
Triangulating planar graphs while minimizing the maximum degree
Goos Kant
,
Hans L. Bodlaender
Lecture Notes in Computer Science
621
, 1992, pp. 258-271
Drawing planar graphs using the
lmc
-ordering
Goos Kant
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 101-110
Planar graph augmentation problems
Goos Kant
,
Hans L. Bodlaender
Lecture Notes in Computer Science
519
, 1991, pp. 286-298
The file distribution problem for processor networks
Goos Kant
,
Jan van Leeuwen
Lecture Notes in Computer Science
447
, 1990, pp. 48-59