Goos Kant

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2008
j11		Goos Kant, Michael Jacks, Corné Aantjes: Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery. Interfaces 38(1): 40-50 (2008)
	1998
j10		Therese C. Biedl, Goos Kant: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3): 159-180 (1998)
	1997
j9		Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997)
j8		Goos Kant, Hans L. Bodlaender: Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. 135(1): 1-14 (1997)
j7		Goos Kant: A More Compact Visibility Representation. Int. J. Comput. Geometry Appl. 7(3): 197-210 (1997)
j6		Marek Chrobak, Goos Kant: Convex Grid Drawings of 3-Connected Planar Graphs. Int. J. Comput. Geometry Appl. 7(3): 211-223 (1997)
j5		Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997)
j4		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
j3		Goos Kant: Drawing Planar Graphs Using the Canonical Ordering. Algorithmica 16(1): 4-32 (1996)
j2		Goos Kant: Augmenting Outerplanar Graphs. J. Algorithms 21(1): 1-25 (1996)
c11		Ulrich Fößmeier, Goos Kant, Michael Kaufmann: 2-Visibility Drawings of Planar Graphs. Graph Drawing 1996: 155-168
	1994
c10		Therese C. Biedl, Goos Kant: A Better Heuristic for Orthogonal Graph Drawings. ESA 1994: 24-35
c9		Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94
	1993
c8		Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197
c7		Goos Kant, Xin He: Two Algorithms for Finding Rectangular Duals of Planar Graphs. WG 1993: 396-410
c6		Goos Kant: A More Compact Visibility Representation. WG 1993: 411-424
	1992
c5		Goos Kant: Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract). FOCS 1992: 101-110
c4		Goos Kant, Hans L. Bodlaender: Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271
c3		Goos Kant: Hexagonal Grid Drawings. WG 1992: 263-276
	1991
c2		Goos Kant, Hans L. Bodlaender: Planar Graph Augmentation Problems (Extended Abstract). WADS 1991: 286-298
	1990
j1		Goos Kant, Jan van Leeuwen: On special multiples of integers. Bulletin of the EATCS 41: 210-211 (1990)
c1		Goos Kant, Jan van Leeuwen: The File Distribution Problem for Processor Networks. SWAT 1990: 48-59

Coauthor Index

1	Corné Aantjes	[j11]
2	Therese C. Biedl	[j10] [j9] [c10] [c9]
3	Hans L. Bodlaender	[j8] [c4] [c2]
4	Marek Chrobak	[j6]
5	Ulrich Fößmeier	[c11]
6	Xin He	[j4] [c7]
7	Michael Jacks	[j11]
8	Michael Kaufmann	[j9] [c11] [c9]
9	Jan van Leeuwen	[j1] [c1]
10	Giuseppe Liotta	[j5] [c8]
11	Roberto Tamassia	[j5] [c8]
12	Ioannis G. Tollis	[j5] [c8]

Colors in the list of coauthors

Last update Wed May 22 09:20:19 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page