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

publications by dr. A.J.J. Kloks

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. A.J.J. Kloks

• contact information
• my technical reports
• former member of group algorithmic systems

some publications

Bodlaender, H.L., Kloks, A.J.J., Tan, R.B. & Leeuwen, J. van (2000). Approximations for Lambda-coloring of graphs. UU-CS 2000-25. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Kratsch, D. & Kloks, A.J.J. (1995). Rankings of graphs. UU-CS 1995-03. Utrecht: Utrecht University.

Bodlaender, H.L., Kratsch, D. & Kloks, A.J.J. (1995). Treewidth and minimum fill-in on d-trapezoid graphs. UU-CS 1995-34. Utrecht: Utrecht University.

Bodlaender, H.L. & Kloks, A.J.J. (1993). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. RUU-CS 93-27. Utrecht.

Kloks, A.J.J. (1993). Minimum Fill-in for Chordal Bipartite Graphs. RUU-CS 93-11. Utrecht.

Kloks, A.J.J. (1993). Treewidth of Circle Graphs. RUU-CS 93-12. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Approximating treewidth and pathwidth of some classes of perfect graphs. RUU-CS 92-29. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). On the Treewidth and Pathwidth of Permutation Graphs. RUU-CS 92-13. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Only few graphs have bounded treewidth. RUU-CS 92-35. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Testing superperfection of $k-$trees. RUU-CS 92-09. Utrecht.

Bodlaender, H.L., Kloks, A.J.J. & Kratsch, D. (1992). Treewidth and pathwidth of permutation graphs. RUU-CS 92-30. Utrecht.

Kloks, A.J.J. & Kratsch, D. (1992). Treewidth of chordal bipartite graphs. RUU-CS 92-28. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). A simple linear time algorithm for triangulating three-colored graphs. RUU-CS 91-13. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). Approximating treewidth, pathwidth, and minimum elimination tree height. RUU-CS 91-01. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). Complexity aspects of 2-dimensional data compression. RUU-CS 91-35. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1990). Fast algorithms for the Tron game on trees. RUU-CS 90-11. Utrecht.