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

publications by dr. ir. B.L.E. de Fluiter

• 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. ir. B.L.E. de Fluiter

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

some publications

Bodlaender, H.L. & Fluiter, B.L.E. de (1997). A problem on strings with an application to intervalizing colored graphs. Bulletin of the European Association for Theoretical Computer Science, 62, 323-324.

Fluiter, B.L.E. de (1997, March 19). Algorithms for graphs of small treewidth. Utrecht University (Utrecht: Utrecht University). Prom./coprom.: prof. dr. J. van Leeuwen & dr. H.L. Bodlaender.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Intervalizing sandwich graphs. UU-CS 1997-04. 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. & Fluiter, B.L.E. de (1997). Parallel algorithms for series parallel graphs. UU-CS 1997-21. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. In R.H. Mohring (Ed.), Proc 23rd Int. Workshop on Graph Theoretic Concepts in Computer Science (WG'97) (pp. 157-170). Berlin: Springer-Verlag.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. UU-CS 1997-23. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fluiter, B.L.E. de (1997). Reduction algorithms for graphs of small treewidth. UU-CS 1997-24. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics, 71, 55-77.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Parallel algorithms for series parallel graphs. UU-CS 1996-13. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Parallel algorithms for series parallel graphs. In J. Diaz & M. Serna (Eds.), Proceedings 4th Annual European Symposium on Algorithms ESA'96 (pp. 277-289). Berlin: Springer- Verlag.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Reduction algorithms for constructing solutions in graphs with small treewidth. In Jin-Yi Cai & Chak Kuen Wong (Eds.), Proceedings 2nd Annual International Conference on Computing and Combinatorics (COCOON'96) (pp. 199-208). Springer-Verlag.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). Intervalizing k-colored graphs. UU-CS 1995-15. Utrecht: Utrecht University.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). On intervalizing k-colored graphs for DNA physical mapping. UU-CS 1995-20. Utrecht: Utrecht University.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). Reduction algorithms for graphs with small treewidth. UU-CS 1995-37. Utrecht: Utrecht University.