| 1998 |
|---|
| 21 | | Therese C. Biedl,
Goos Kant:
A better heuristic for orthogonal graph drawings.
Comput. Geom. 9(3): 159-180 (1998) |
| 1997 |
|---|
| 20 | | Therese C. Biedl,
Goos Kant,
Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint.
Algorithmica 19(4): 427-446 (1997) |
| 19 | | Goos Kant,
Hans L. Bodlaender:
Triangulating Planar Graphs while Minimizing the Maximum Degree.
Inf. Comput. 135(1): 1-14 (1997) |
| 18 | EE | Goos Kant,
Giuseppe Liotta,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees.
Inf. Process. Lett. 62(2): 81-88 (1997) |
| 17 | | Goos Kant:
A More Compact Visibility Representation.
Int. J. Comput. Geometry Appl. 7(3): 197-210 (1997) |
| 16 | | Marek Chrobak,
Goos Kant:
Convex Grid Drawings of 3-Connected Planar Graphs.
Int. J. Comput. Geometry Appl. 7(3): 211-223 (1997) |
| 15 | EE | Goos Kant,
Xin He:
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems.
Theor. Comput. Sci. 172(1-2): 175-193 (1997) |
| 1996 |
|---|
| 14 | | Ulrich Fößmeier,
Goos Kant,
Michael Kaufmann:
2-Visibility Drawings of Planar Graphs.
Graph Drawing 1996: 155-168 |
| 13 | | Goos Kant:
Drawing Planar Graphs Using the Canonical Ordering.
Algorithmica 16(1): 4-32 (1996) |
| 12 | | Goos Kant:
Augmenting Outerplanar Graphs.
J. Algorithms 21(1): 1-25 (1996) |
| 1994 |
|---|
| 11 | | Therese C. Biedl,
Goos Kant:
A Better Heuristic for Orthogonal Graph Drawings.
ESA 1994: 24-35 |
| 10 | | Therese C. Biedl,
Goos Kant,
Michael Kaufmann:
On Triangulating Planar Graphs under the Four-Connectivity Constraint.
SWAT 1994: 83-94 |
| 1993 |
|---|
| 9 | | Goos Kant,
Giuseppe Liotta,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees.
CCCG 1993: 192-197 |
| 8 | | Goos Kant,
Xin He:
Two Algorithms for Finding Rectangular Duals of Planar Graphs.
WG 1993: 396-410 |
| 7 | | Goos Kant:
A More Compact Visibility Representation.
WG 1993: 411-424 |
| 1992 |
|---|
| 6 | | Goos Kant:
Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)
FOCS 1992: 101-110 |
| 5 | | Goos Kant,
Hans L. Bodlaender:
Triangulating Planar Graphs While Minimizing the Maximum Degree.
SWAT 1992: 258-271 |
| 4 | | Goos Kant:
Hexagonal Grid Drawings.
WG 1992: 263-276 |
| 1991 |
|---|
| 3 | | Goos Kant,
Hans L. Bodlaender:
Planar Graph Augmentation Problems (Extended Abstract).
WADS 1991: 286-298 |
| 1990 |
|---|
| 2 | | Goos Kant,
Jan van Leeuwen:
The File Distribution Problem for Processor Networks.
SWAT 1990: 48-59 |
| 1 | | Goos Kant,
Jan van Leeuwen:
On special multiples of integers.
Bulletin of the EATCS 41: 210-211 (1990) |
