technical reports : dr. G. Kant

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

technical reports : dr. G. Kant

select other reports

technical report index page
below : list of indexed authors

this selection

author dr. G. Kant

author	dr. G. Kant

reports (15)

techrep_id file title / author

UU-CS-1997-38 ps.gz
pdf On an integer multicommodity flow problem from the airplane industry
A. M. Verweij, K. I. Aardal, G. Kant

UU-CS-1995-27 pdf On Triangulating Planar Graphs under the Four-Connectivity Constraint
T. Biedl and G. Kant and M. Kaufmann

UU-CS-1995-04 ps.gz
pdf A better heuristic for ortogobal graph drawings
T. Biedl, G. Kant

RUU-CS-93-45 ps.gz
pdf Convex grid drawings of 3-connected planar graphs
M. Chrobak, G. Kant

RUU-CS-93-33 pdf Area Requirement of Visibility Representations of Trees
G. Kant, G. Liotta, R. Tamassia, and I.G. Tollis

RUU-CS-93-26 ps.gz
pdf A more compact visibility representation
G. Kant

RUU-CS-92-41 ps.gz
pdf Two algorithms for finding rectangular duals of planar graphs
G. Kant

RUU-CS-92-33 ps.gz
pdf Drawing planar graphs using the lmc-ordering
G. Kant

RUU-CS-92-07 pdf Triangslating planar graphs while minimizing the maximum degree
G. Kant and H.L. Bodlaender

RUU-CS-92-06 pdf Hexagonal grid drawings
G. Kant

RUU-CS-92-03 ps.gz
pdf An O(n²) maximal planarization algorithm based on PQ-trees
G. Kant

RUU-CS-91-47 pdf Linear planar augmentation algorithms for outerplanar graphs
Goos Kant

RUU-CS-91-25 pdf Planar graph augmentation problems
G. Kant and H.L. Bodlaender

RUU-CS-90-16 pdf The file distribution problem for processor networks
G. Kant and J. van Leeuwen

RUU-CS-90-15 pdf Strong colorings of graphs
G. Kant and J. van Leeuwen

techrep_id	file	title / author
UU-CS-1997-38	ps.gz pdf	On an integer multicommodity flow problem from the airplane industry A. M. Verweij, K. I. Aardal, G. Kant
UU-CS-1995-27	pdf	On Triangulating Planar Graphs under the Four-Connectivity Constraint T. Biedl and G. Kant and M. Kaufmann
UU-CS-1995-04	ps.gz pdf	A better heuristic for ortogobal graph drawings T. Biedl, G. Kant
RUU-CS-93-45	ps.gz pdf	Convex grid drawings of 3-connected planar graphs M. Chrobak, G. Kant
RUU-CS-93-33	pdf	Area Requirement of Visibility Representations of Trees G. Kant, G. Liotta, R. Tamassia, and I.G. Tollis
RUU-CS-93-26	ps.gz pdf	A more compact visibility representation G. Kant
RUU-CS-92-41	ps.gz pdf	Two algorithms for finding rectangular duals of planar graphs G. Kant
RUU-CS-92-33	ps.gz pdf	*Drawing planar graphs using the lmc-ordering* G. Kant
RUU-CS-92-07	pdf	Triangslating planar graphs while minimizing the maximum degree G. Kant and H.L. Bodlaender
RUU-CS-92-06	pdf	Hexagonal grid drawings G. Kant
RUU-CS-92-03	ps.gz pdf	An O(n²) maximal planarization algorithm based on PQ-trees G. Kant
RUU-CS-91-47	pdf	Linear planar augmentation algorithms for outerplanar graphs Goos Kant
RUU-CS-91-25	pdf	Planar graph augmentation problems G. Kant and H.L. Bodlaender
RUU-CS-90-16	pdf	The file distribution problem for processor networks G. Kant and J. van Leeuwen
RUU-CS-90-15	pdf	Strong colorings of graphs G. Kant and J. van Leeuwen

indexed (co) authors

author group

Aardal, dr. ir. K.I. all reports algorithmic systems all reports

Bodlaender, dr. H.L. all reports algorithmic systems all reports

Kant, dr. G. all reports algorithmic systems all reports

Leeuwen, prof. dr. (em.) J. van all reports algorithmic systems all reports

Verweij, dr. A.M. all reports algorithmic systems all reports

author	group
Aardal, dr. ir. K.I.	all reports	algorithmic systems	all reports
Bodlaender, dr. H.L.	all reports	algorithmic systems	all reports
Kant, dr. G.	all reports	algorithmic systems	all reports
Leeuwen, prof. dr. (em.) J. van	all reports	algorithmic systems	all reports
Verweij, dr. A.M.	all reports	algorithmic systems	all reports

BibTeX entries

@TECHREPORT{UUCS199738,
author = {Verweij, A.~M. and Aardal, K.~I. and Kant, G.},
year = 1997,
title = {On an integer multicommodity flow problem from the airplane industry},
number = {UU-CS-1997-38},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1997/1997-38.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1997/1997-38.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199527,
author = {Biedl, T. and Kant, G. and Kaufmann, M.},
year = 1995,
title = {On Triangulating Planar Graphs under the Four-Connectivity Constraint},
number = {UU-CS-1995-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1995/1995-27.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199504,
author = {Biedl, T. and Kant, G.},
year = 1995,
title = {A better heuristic for ortogobal graph drawings},
number = {UU-CS-1995-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1995/1995-04.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1995/1995-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9345,
author = {Chrobak, M. and Kant, G.},
year = 1993,
title = {Convex grid drawings of 3-connected planar graphs},
number = {RUU-CS-93-45},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1993/1993-45.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1993/1993-45.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9333,
author = {Kant, G. and Liotta, G. and Tamassia, R. and Tollis, I.G.},
year = 1993,
title = {Area Requirement of Visibility Representations of Trees},
number = {RUU-CS-93-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1993/1993-33.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9326,
author = {Kant, G.},
year = 1993,
title = {A more compact visibility representation},
number = {RUU-CS-93-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1993/1993-26.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1993/1993-26.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9241,
author = {Kant, G.},
year = 1992,
title = {Two algorithms for finding rectangular duals of planar graphs},
number = {RUU-CS-92-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-41.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-41.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9233,
author = {Kant, G.},
year = 1992,
title = {Drawing planar graphs using the lmc-ordering},
number = {RUU-CS-92-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-33.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-33.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9207,
author = {Kant, G. and Bodlaender, H.L.},
year = 1992,
title = {Triangslating planar graphs while minimizing the maximum degree},
number = {RUU-CS-92-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9206,
author = {Kant, G.},
year = 1992,
title = {Hexagonal grid drawings},
number = {RUU-CS-92-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9203,
author = {Kant, G.},
year = 1992,
title = {An O(n²) maximal planarization algorithm based on PQ-trees},
number = {RUU-CS-92-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-03.ps.gz}},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1992/1992-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9147,
author = {Kant, Goos},
year = 1991,
title = {Linear planar augmentation algorithms for outerplanar graphs},
number = {RUU-CS-91-47},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1991/1991-47.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9125,
author = {Kant, G. and Bodlaender, H.L.},
year = 1991,
title = {Planar graph augmentation problems},
number = {RUU-CS-91-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1991/1991-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9016,
author = {Kant, G. and Leeuwen, J.~van},
year = 1990,
title = {The file distribution problem for processor networks},
number = {RUU-CS-90-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1990/1990-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9015,
author = {Kant, G. and Leeuwen, J.~van},
year = 1990,
title = {Strong colorings of graphs},
number = {RUU-CS-90-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.computingscience.nl/research/techreps/repo/CS-1990/1990-15.pdf}},
pubcat = {techreport}
}

webmaster@cs.uu.nl, Tue, 22 May 2012 12:38:21 +0200 ← Departement Informatica, Universiteit Utrecht