Goos Kant

24 papers A* 1A 2B 4Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2008 J jnl
Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery.
Interfaces
Goos Kant, Michael Jacks, Corné Aantjes
2002 J jnl
A savings based method for real-life vehicle routing problems.
J. Oper. Res. Soc.
Alexander Poot, Goos Kant, Albert P. M. Wagelmans
1998 J jnl
A better heuristic for orthogonal graph drawings.
Comput. Geom.
Therese Biedl, Goos Kant
1997 J jnl
A More Compact Visibility Representation.
Int. J. Comput. Geom. Appl.
Goos Kant
1997 J jnl
Area Requirement of Visibility Representations of Trees.
Inf. Process. Lett.
Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
1997 J jnl
Convex Grid Drawings of 3-Connected Planar Graphs.
Int. J. Comput. Geom. Appl.
Marek Chrobak, Goos Kant
1997 J jnl
On Triangulating Planar Graphs Under the Four-Connectivity Constraint.
Algorithmica
Therese Biedl, Goos Kant, Michael Kaufmann
1997 J jnl
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems.
Theor. Comput. Sci.
Goos Kant, Xin He
1997 J jnl
Triangulating Planar Graphs while Minimizing the Maximum Degree.
Inf. Comput.
Goos Kant, Hans L. Bodlaender
1996 A conf
2-Visibility Drawings of Planar Graphs.
GD
Ulrich Fößmeier, Goos Kant, Michael Kaufmann
1996 J jnl
Augmenting Outerplanar Graphs.
J. Algorithms
Goos Kant
1996 J jnl
Drawing Planar Graphs Using the Canonical Ordering.
Algorithmica
Goos Kant
1994 A conf
A Better Heuristic for Orthogonal Graph Drawings.
ESA
Therese Biedl, Goos Kant
1994 — conf
On Triangulating Planar Graphs under the Four-Connectivity Constraint.
SWAT
Therese Biedl, Goos Kant, Michael Kaufmann
1993 B conf
A More Compact Visibility Representation.
WG
Goos Kant
1993 J jnl
A new method for planar graph drawings on a grid (abstract).
SIGACT News
Goos Kant
1993 — conf
Area Requirement of Visibility Representations of Trees.
CCCG
Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
1993 B conf
Two Algorithms for Finding Rectangular Duals of Planar Graphs.
WG
Goos Kant, Xin He
1992 A* conf
Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)
FOCS
Goos Kant
1992 B conf
Hexagonal Grid Drawings.
WG
Goos Kant
1992 — conf
Triangulating Planar Graphs While Minimizing the Maximum Degree.
SWAT
Goos Kant, Hans L. Bodlaender
1991 B conf
Planar Graph Augmentation Problems (Extended Abstract).
WADS
Goos Kant, Hans L. Bodlaender
1990 J jnl
On special multiples of integers.
Bull. EATCS
Goos Kant, Jan van Leeuwen
1990 — conf
The File Distribution Problem for Processor Networks.
SWAT
Goos Kant, Jan van Leeuwen