technical reports : dr. A.J.J. Kloks
select other reports
this selection
reports (16)
| techrep_id |
file |
title / author |
| UU-CS-2000-25 |
ps.gz
pdf |
Approximations for Lambda-coloring of graphs
H. L. Bodlaender, T. Kloks, R. B. Tan, J. van Leeuwen |
| 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-93-27 |
ps.gz
pdf |
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
H. L. Bodlaender, T. Kloks |
| RUU-CS-93-12 |
pdf |
Treewidth of Circle Graphs
T. Kloks |
| RUU-CS-93-11 |
pdf |
Minimum Fill-in for Chordal Bipartite Graphs
T. Kloks |
| RUU-CS-92-35 |
pdf |
Only few graphs have bounded treewidth
T. Kloks and H. Bodlaender |
| 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-29 |
pdf |
Approximating treewidth and pathwidth of some classes of perfect graphs
A.J.J. Kloks and H.L. Bodlaender |
| RUU-CS-92-28 |
pdf |
Treewidth of chordal bipartite graphs
A.J.J. Kloks and D. Kratsch |
| RUU-CS-92-13 |
pdf |
On the Treewidth and Pathwidth of Permutation Graphs
T. Kloks and H.L. Bodlaender |
| RUU-CS-92-09 |
pdf |
Testing superperfection of $k-$trees
T. Kloks and H.L. Bodlaender |
| RUU-CS-91-35 |
pdf |
Complexity aspects of 2-dimensional data compression
H.L. Bodlaender and T. Gonzalez and T. Kloks |
| RUU-CS-91-13 |
pdf |
A simple linear time algorithm for triangulating three-colored graphs
H.L. Bodlaender and A.J.. Kloks |
| RUU-CS-91-01 |
pdf |
Approximating treewidth, pathwidth, and minimum elimination tree height
H.L. Bodlaender and J.R. Gilbert and H. Hafsteinsson and T. Kloks |
| RUU-CS-90-11 |
pdf |
Fast algorithms for the Tron game on trees
H. Bodlaender and T. Kloks |
BibTeX entries
@TECHREPORT{UUCS200025,
author = {Bodlaender, H.~L. and Kloks, T. and Tan, R.~B. and Leeuwen, J.~van},
year = 2000,
title = {Approximations for Lambda-coloring of graphs},
number = {UU-CS-2000-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-25.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-25.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{RUUCS9327,
author = {Bodlaender, H.~L. and Kloks, T.},
year = 1993,
title = {Efficient and constructive algorithms for the pathwidth and treewidth of graphs},
number = {RUU-CS-93-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-27.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-27.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9312,
author = {Kloks, T.},
year = 1993,
title = {Treewidth of Circle Graphs},
number = {RUU-CS-93-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9311,
author = {Kloks, T.},
year = 1993,
title = {Minimum Fill-in for Chordal Bipartite Graphs},
number = {RUU-CS-93-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9235,
author = {Kloks, T. and Bodlaender, H.},
year = 1992,
title = {Only few graphs have bounded treewidth},
number = {RUU-CS-92-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-35.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{RUUCS9229,
author = {Kloks, A.J.J. and Bodlaender, H.L.},
year = 1992,
title = {Approximating treewidth and pathwidth of some classes of perfect graphs},
number = {RUU-CS-92-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-29.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{RUUCS9213,
author = {Kloks, T. and Bodlaender, H.L.},
year = 1992,
title = {On the Treewidth and Pathwidth of Permutation Graphs},
number = {RUU-CS-92-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-13.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9209,
author = {Kloks, T. and Bodlaender, H.L.},
year = 1992,
title = {Testing superperfection of $k-$trees},
number = {RUU-CS-92-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-09.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9135,
author = {Bodlaender, H.L. and Gonzalez, T. and Kloks, T.},
year = 1991,
title = {Complexity aspects of 2-dimensional data compression},
number = {RUU-CS-91-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-35.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9113,
author = {Bodlaender, H.L. and Kloks, A.J..},
year = 1991,
title = {A simple linear time algorithm for triangulating three-colored graphs},
number = {RUU-CS-91-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-13.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9101,
author = {Bodlaender, H.L. and Gilbert, J.R. and Hafsteinsson, H. and Kloks, T.},
year = 1991,
title = {Approximating treewidth, pathwidth, and minimum elimination tree height},
number = {RUU-CS-91-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9011,
author = {Bodlaender, H. and Kloks, T.},
year = 1990,
title = {Fast algorithms for the Tron game on trees},
number = {RUU-CS-90-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-11.pdf}},
pubcat = {techreport}
}
webmaster@cs.uu.nl,
Thu, 20 Jun 2013 09:21:41 +0200
←
Departement Informatica, Universiteit Utrecht
