home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. G. Kant

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. G. Kant

• contact information
• my technical reports
• former member of group algorithmic systems

some publications

Verweij, B., Aardal, K.I. & Kant, G. (1997). On a routing problem from the airplane manufacturing industry. In Abstract WB 27.3, Conference Record EURO XV/INFORMS XXXIV Joint Int. Conference Barcelona (pp. 133-133). Barcelona.

Verweij, A.M., Aardal, K.I. & Kant, G. (1997). On an integer multicommodity flow problem from the airplane industry. UU-CS 1997-38. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Kant, G. & Bodlaender, H.L. (1997). Triangulating Planar Graphs While Minimizing the Maximum Degree. Information and Computation, 135, 1-14.

Kant, G. (1996). Augmenting outerplanar graphs. Journal of Algorithms, 21, 1-25.

Kant, G. (1996). Drawing planar graphs using the canonical ordering. Algorithmica, 16, 4-32.

Biedl, T. & Kant, G. (1995). A better heuristic for ortogobal graph drawings. UU-CS 1995-04. Utrecht: Utrecht University.

Biedl, T. & Kant, G. (1995). On Triangulating Planar Graphs under the Four-Connectivity Constraint. UU-CS 1995-27. Utrecht: Utrecht University.

Kant, G. (1993). A more compact visibility representation. RUU-CS 93-26. Utrecht.

Kant, G. (1993). Area Requirement of Visibility Representations of Trees. RUU-CS 93-33. Utrecht.

Chrobak, M. & Kant, G. (1993). Convex grid drawings of 3-connected planar graphs. RUU-CS 93-45. Utrecht.

Kant, G. (1992). An O(n2) maximal planarization algorithm based on PQ-trees. RUU-CS 92-03. Utrecht.

Kant, G. (1992). Drawing planar graphs using the canonical ordering. RUU-CS 92-33. Utrecht.

Kant, G. (1992). Hexagonal grid drawings. RUU-CS 92-06. Utrecht.

Kant, G. & Bodlaender, H.L. (1992). Triangslating planar graphs while minimizing the maximum degree. RUU-CS 92-07. Utrecht.

Kant, G. (1992). Two algorithms for finding rectangular duals of planar graphs. RUU-CS 92-41. Utrecht.

Kant, G. (1991). Linear planar augmentation algorithms for outerplanar graphs. RUU-CS 91-47. Utrecht.

Kant, G. & Bodlaender, H.L. (1991). Planar graph augmentation problems. RUU-CS 91-25. Utrecht.

Kant, G. & Leeuwen, J. van (1990). Strong colorings of graphs. RUU-CS 90-15. Utrecht.

Kant, G. & Leeuwen, J. van (1990). The file distribution problem for processor networks. RUU-CS 90-16. Utrecht.