Department of Information and Computing Sciences

Departement Informatica contact intern
people education research library calendar archive services jobs

technical reports : prof. dr. D. Kratsch

select other reports

this selection

author prof. dr. D. Kratsch

reports (12)

techrep_id file title / author
UU-CS-2012-001 pdf Exact algorithms for Kayles
Hans L.Bodlaender, Dieter Kratsch and Sjoerd T.Timmer
UU-CS-2011-003 pdf Exact Algorithms for Kayles
Hans L. Bodlaender and Dieter Kratsch
UU-CS-2009-023 pdf A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
UU-CS-2006-032 ps.gz
pdf
On exact algorithms for treewidth
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
UU-CS-2006-015 ps.gz
pdf
An exact algorithm for graph coloring with polynomial memory
Hans L. Bodlaender and Dieter Kratsch
UU-CS-2003-038 ps.gz
pdf
On Algorithms for (P5,Gem)-Free Graphs
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
UU-CS-2000-42 ps.gz
pdf
Kayles and nimbers
H. L. Bodlaender, D. Kratsch
UU-CS-1995-34 ps.gz
pdf
Treewidth and minimum fill-in on d-trapezoid graphs
H. L. Bodlaender, T. Kloks, D. Kratsch, H. Mueller
UU-CS-1995-03 ps.gz
pdf
Rankings of graphs
H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Mueller, Zs. Tuza
RUU-CS-92-30 pdf Treewidth and pathwidth of permutation graphs
H.L. Bodlaender and A.J.J. Kloks and D. Kratsch
RUU-CS-92-28 pdf Treewidth of chordal bipartite graphs
A.J.J. Kloks and D. Kratsch
RUU-CS-91-03 pdf The complexity of coloring games on perfect graphs
H.L. Bodlaender and D. Kratsch

indexed (co) authors

author group
Bodlaender, prof. dr. H.L. all reports Algorithmic Systems all reports
Kloks, dr. A.J.J. all reports Algorithmic Systems all reports
Koster, dr. ir. A.M.C.A. all reports Guests and Others all reports
Kratsch, prof. dr. D. all reports Guests and Others all reports
Thilikos, dr. D.M. all reports Algorithmic Systems all reports
Timmer, MSc S.T. all reports Intelligent Systems all reports

BibTeX entries

@TECHREPORT{UUCS2012001,
author = {L.Bodlaender, Hans and Kratsch, Dieter and T.Timmer, Sjoerd},
year = 2012,
title = {Exact algorithms for Kayles},
number = {UU-CS-2012-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2012/2012-001.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2011003,
author = {Bodlaender, Hans~L. and Kratsch, Dieter},
year = 2011,
title = {Exact Algorithms for Kayles},
number = {UU-CS-2011-003},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2011/2011-003.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009023,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2009,
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
number = {UU-CS-2009-023},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-023.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006032,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2006,
title = {On exact algorithms for treewidth},
number = {UU-CS-2006-032},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-032.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-032.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006015,
author = {Bodlaender, Hans~L. and Kratsch, Dieter},
year = 2006,
title = {An exact algorithm for graph coloring with polynomial memory},
number = {UU-CS-2006-015},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-015.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-015.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003038,
author = {Bodlaender, Hans~L. and Brandstädt, Andreas and Kratsch, Dieter and Rao, Michaël and Spinrad, Jeremy},
year = 2003,
title = {On Algorithms for (P5,Gem)-Free Graphs},
number = {UU-CS-2003-038},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-038.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-038.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200042,
author = {Bodlaender, H.~L. and Kratsch, D.},
year = 2000,
title = {Kayles and nimbers},
number = {UU-CS-2000-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-42.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-42.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199534,
author = {Bodlaender, H.~L. and Kloks, T. and Kratsch, D. and Mueller, H.},
year = 1995,
title = {Treewidth and minimum fill-in on d-trapezoid graphs},
number = {UU-CS-1995-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-34.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199503,
author = {Bodlaender, H.~L. and Deogun, J.~S. and Jansen, K. and Kloks, T. and Kratsch, D. and Mueller, H. and Tuza, Zs.},
year = 1995,
title = {Rankings of graphs},
number = {UU-CS-1995-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-03.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9230,
author = {Bodlaender, H.L. and Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth and pathwidth of permutation graphs},
number = {RUU-CS-92-30},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-30.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9228,
author = {Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth of chordal bipartite graphs},
number = {RUU-CS-92-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-28.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9103,
author = {Bodlaender, H.L. and Kratsch, D.},
year = 1991,
title = {The complexity of coloring games on perfect graphs},
number = {RUU-CS-91-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-03.pdf}},
pubcat = {techreport}
}