The File Distribution Problem for Processor Networks. - Goos Kant; Jan van Leeuwen (SWAT, 1990)

On special multiples of integers. - Goos Kant; Jan van Leeuwen (Bull. EATCS, 1990)

Planar Graph Augmentation Problems (Extended Abstract). - Goos Kant; Hans L. Bodlaender (WADS, 1991)

Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) - Goos Kant (FOCS, 1992)

Hexagonal Grid Drawings. - Goos Kant (WG, 1992)

Two Algorithms for Finding Rectangular Duals of Planar Graphs. - Goos Kant; Xin He 005 (WG, 1993)

A new method for planar graph drawings on a grid (abstract). - Goos Kant (SIGACT News, 1993)

2-Visibility Drawings of Planar Graphs. - Ulrich Fößmeier; Goos Kant; Michael Kaufmann 001 (GD, 1996)

Drawing Planar Graphs Using the Canonical Ordering. - Goos Kant (Algorithmica, 1996)

Augmenting Outerplanar Graphs. - Goos Kant (J. Algorithms, 1996)

On Triangulating Planar Graphs Under the Four-Connectivity Constraint. - Therese Biedl; Goos Kant; Michael Kaufmann 001 (Algorithmica, 1997)

Triangulating Planar Graphs while Minimizing the Maximum Degree. - Goos Kant; Hans L. Bodlaender (Inf. Comput., 1997)

Convex Grid Drawings of 3-Connected Planar Graphs. - Marek Chrobak; Goos Kant (Int. J. Comput. Geom. Appl., 1997)

A More Compact Visibility Representation. - Goos Kant (Int. J. Comput. Geom. Appl., 1997)

Area Requirement of Visibility Representations of Trees. - Goos Kant; Giuseppe Liotta; Roberto Tamassia; Ioannis G. Tollis (Inf. Process. Lett., 1997)

Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. - Goos Kant; Xin He 005 (Theor. Comput. Sci., 1997)

A better heuristic for orthogonal graph drawings. - Therese Biedl; Goos Kant (Comput. Geom., 1998)

A savings based method for real-life vehicle routing problems. - Alexander Poot; Goos Kant; Albert P. M. Wagelmans (J. Oper. Res. Soc., 2002)

Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery. - Goos Kant; Michael Jacks; Corné Aantjes (Interfaces, 2008)