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

publications by dr. D.M. Thilikos

• 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. D.M. Thilikos

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

some publications

Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S. & Thilikos, D.M. (2009). (Meta) Kernelization. onbekend: UU BETA ICS Departement Informatica.

Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S. & Thilikos, D.M. (2009). (Meta) kernelization. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 629-638). IEEE Press.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2009). A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. onbekend: UU BETA ICS Departement Informatica.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2006). On exact algorithms for treewidth. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2006). On exact algorithms for treewidth. In Y. Azar & T. Erlebach (Eds.), Proceedings 14th Annual European Symposium on Algorithms ESA 2006 (pp. 672-683). Springer, Lecture Notes in Computer Science, volume 4168.

Bodlaender, H.L. & Thilikos, D.M. (2004). Computing small search numbers in linear time. In R. Downey, M. Fellows & F. Dehne (Eds.), Proceedings First International Workshop on Parameterized and Exact Computation (pp. 37-48). Berlin: Springer-Verlag.

Bodlaender, H.L., Fellows, M. R. & Thilikos, D.M. (2003). Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. In Proceedings 28nd International Symposium on Mathematical Foundations of Computer Science, MFCS'03, Lecture Notes in Computer Science, volume 2747 (pp. 239-248). Berlin: Springer-Verlag.

Thilikos, D.M., Fellows, M.R. & Bodlaender, H.L. (2002). Derivation of algorithms for cutwidth and related graph layout problems. UU-CS 2002-032. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Serna, M.J. & Thilikos, D.M. (2001). A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth. UU-CS 2001-04. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Thilikos, D.M., Serna, M.J. & Bodlaender, H.L. (2001). A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In F Meyer auf der Heide (Ed.), Proceedings 9th Annual European Symposium on Algorithms ESA 2001 (pp. 380-390). Berlin: Springer-Verlag.

Thilikos, D.M., Serna, M.J. & Bodlaender, H.L. (2000). A constructive linear time algorithm for small cutwidth. UU-CS 2000-24. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Thilikos, D.M. & Bodlaender, H.L. (2000). Constructive linear time algorithms for branchwidth. UU-CS 2000-38. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Thilikos, D.M. (2000). Constructive linear time algorithms for branchwidth. Barcelona, Spain: Departament de Llenguatges Sistemes Informatics.

Bodlaender, H.L., Thilikos, D.M. & Serna, M.J. (2000). Constructive linear time algorithms for small cutwidth and carving-width. In L. Teng & S.H. Teng (Eds.), Proc. 11th International Symposium on Algorithms And Computation ISAAC '00 (pp. 192-203). Springer-Verlag.

Bodlaender, H.L. & Thilikos, D.M. (1999). Graphs with branchwidth at most three. Journal of Algorithms, 32, 167-194.

Yamazaki, K., Bodlaender, H.L., Fluiter, B. de & Thilikos, D.M. (1999). Isomorphism for graphs of bounded distance width. Algorithmica, 24, 105-127.

Bodlaender, H.L. & Thilikos, D.M. (1998). Computing small search numbers in linear time. UU-CS 1998-05. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Thilikos, D.M. (1997). Algorithms and obstructions for linear-width and related search parameters. UU-CS 1997-35. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Thilikos, D.M. (1997). Constructive linear time algorithms for branchwidth. In P. Degano, R. Gorrieri & A. Marchetti-Spaccamela (Eds.), Proceedings 24th Int. Colloquium on Automata, Languages, and Programming (ICALP'97) (pp. 627-637). Berlin: Springer-Verlag.

Thilikos, D.M. & Bodlaender, H.L. (1997). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters, 61, 227-232.

Bodlaender, H.L. & Thilikos, D.M. (1997). Graphs with branchwidth at most three. UU-CS 1997-37. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Yamazaki, K., Bodlaender, H.L., Fluiter, B.L.E. de & Thilikos, D.M. (1997). Isomorphism for graphs of bounded distance width. In G. Bongiovanni, D.P. Bovet & G. Di Battista (Eds.), Proceedings 3rd Italian Conference on Algorithms and Complexity (CIAC'97) (pp. 276-287). Berlin: Springer Verlag.

Yamazaki, T., Bodlaender, H.L., Fluiter, B.L.E. de & Thilikos, D.M. (1997). Isomorphism for graphs of bounded distance width. UU-CS 1997-05. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Thilikos, D.M. & Yamazaki, K. (1997). It is hard to know when greedy is good for finding independent sets. Information Processing Letters, 61, 101-106.

Bodlaender, H.L., Leeuwen, J. van, Tan, R. & Thilikos, D.M. (1997). On interval routing schemes and treewidth. Information and Computation, 139, 91-109.

Bodlaender, H.L. & Thilikos, D.M. (1997). Treewidth for graphs with small chordality. Discrete Applied Mathematics, 79, 45-61.

Thilikos, D.M. & Bodlaender, H.L. (1996). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. UU-CS 1996-30. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Thilikos, D.M. & Yamazaki, T. (1996). It is hard to know when greedy is good for finding independent sets. UU-CS 1996-29. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Leeuwen, J. van, Tan, R.B. & Thilikos, D.M. (1996). On interval routing schemes and treewidth. UU-CS 1996-41. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Thilikos, D.M. (1995). Treewidth and small separators for graphs with small chordality. UU-CS 1995-02. Utrecht: Utrecht University.