technical reports : K. Yamazaki

select other reports
this selection
reports (2)
| techrep_id |
file |
title / author |
| UU-CS-1997-05 |
ps.gz pdf |
Isomorphism for graphs of bounded distance width Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
| UU-CS-1996-29 |
ps.gz pdf |
It is hard to know when greedy is good for finding independent sets Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki |
BibTeX entries
@TECHREPORT{UUCS199705,
author = {Yamazaki, Koichi and Bodlaender, Hans~L. and Fluiter, Babette~de and Thilikos, Dimitrios~M.},
year = 1997,
title = {Isomorphism for graphs of bounded distance width},
number = {UU-CS-1997-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199629,
author = {Bodlaender, Hans~L. and Thilikos, Dimitrios~M. and Yamazaki, Koichi},
year = 1996,
title = {It is hard to know when greedy is good for finding independent sets},
number = {UU-CS-1996-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.pdf}},
pubcat = {techreport}
}
webmaster@cs.uu.nl,
Sat, 25 May 2013 06:13:53 +0200
←
Departement Informatica, Universiteit Utrecht