| Drawing planar graphs using the canonical ordering G Kant Algorithmica 16, 4-32, 1996 | 429 | 1996 |
| Convex grid drawings of 3-connected planar graphs M Chrobak, G Kant International Journal of Computational Geometry & Applications 7 (03), 211-223, 1997 | 209 | 1997 |
| Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems G Kant, X He Theoretical Computer Science 172 (1-2), 175-193, 1997 | 203 | 1997 |
| A better heuristic for orthogonal graph drawings T Biedl, G Kant Computational Geometry 9 (3), 159-180, 1998 | 193 | 1998 |
| Drawing planar graphs using the lmc-ordering G Kant Department of Computer Science, Utrecht University, 1992 | 130 | 1992 |
| A better heuristic for orthogonal graph drawings T Biedl, G Kant Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994 | 129 | 1994 |
| Coca-Cola Enterprises optimizes vehicle routes for efficient product delivery G Kant, M Jacks, C Aantjes Interfaces 38 (1), 40-50, 2008 | 81 | 2008 |
| Planar graph augmentation problems G Kant, HL Bodlaender Workshop on Algorithms and Data Structures, 286-298, 1991 | 76 | 1991 |
| Two algorithms for finding rectangular duals of planar graphs G Kant, X He International Workshop on Graph-Theoretic Concepts in Computer Science, 396-410, 1993 | 75 | 1993 |
| 2-visibility drawings of planar graphs U Fößmeier, G Kant, M Kaufmann Graph Drawing: Symposium on Graph Drawing, GD'96 Berkeley, California, USA …, 1997 | 73 | 1997 |
| On triangulating planar graphs under the four-connectivity constraint T Biedl, G Kant, M Kaufmann Algorithmica 19, 427-446, 1997 | 65 | 1997 |
| A more compact visibility representation G Kant International Journal of Computational Geometry & Applications 7 (03), 197-210, 1997 | 62 | 1997 |
| An O (n²) maximal planarization algorithm based on PQ-trees G Kant | 58 | 1992 |
| Hexagonal grid drawings G Kant International Workshop on Graph-Theoretic Concepts in Computer Science, 263-276, 1992 | 54 | 1992 |
| Augmenting outerplanar graphs G Kant Journal of Algorithms 21 (1), 1-25, 1996 | 52 | 1996 |
| Area requirement of visibility representations of trees G Kant, G Liotta, R Tamassia, IG Tollis Information processing letters 62 (2), 81-88, 1997 | 41 | 1997 |
| On finding minimal route duration in the vehicle routing problem with multiple time windows C de Jong, G Kant, A Van Vlient Manuscript, Department of Computer Science, Utrecht University, Holland, 1996 | 39 | 1996 |
| A more compact visibility representation G Kant International Workshop on Graph-Theoretic Concepts in Computer Science, 411-424, 1993 | 32 | 1993 |
| Triangulating planar graphs while minimizing the maximum degree G Kant, HL Bodlaender information and computation 135 (1), 1-14, 1997 | 27 | 1997 |
| Triangulating planar graphs while minimizing the maximum degree G Kant, HL Bodlaender Algorithm Theory—SWAT'92: Third Scandinavian Workshop on Algorithm Theory …, 1992 | 24 | 1992 |
