author dr. D.M. Thilikos

techrep_id file title / author UU-CS-2009-023 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. ThilikosUU-CS-2009-012 (Meta) Kernelization

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. ThilikosUU-CS-2006-032 ps.gz On exact algorithms for treewidth

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. ThilikosUU-CS-2002-032 ps.gz Derivation of algorithms for cutwidth and related graph layout problems

Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. ThilikosUU-CS-2001-04 ps.gz A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth

D. M. Thilikos, M. J. Serna, H. L. BodlaenderUU-CS-2000-38 ps.gz Constructive linear time algorithms for branchwidth

D. M. Thilikos, H. L. BodlaenderUU-CS-2000-24 ps.gz A constructive linear time algorithm for small cutwidth

D. M. Thilikos, M. J. Serna, H. L. BodlaenderUU-CS-1998-05 ps.gz Computing small search numbers in linear time

H. L. Bodlaender, D. M. ThilikosUU-CS-1997-37 ps.gz Graphs with branchwidth at most three

H. L. Bodlaender, D. M. ThilikosUU-CS-1997-35 ps.gz Algorithms and obstructions for linear-width and related search parameters

D. M. ThilikosUU-CS-1997-05 ps.gz Isomorphism for graphs of bounded distance width

Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. ThilikosUU-CS-1996-41 ps.gz On Interval Routing Schemes and Treewidth

H. L. Bodlaender, J. van Leeuwen, R. B. Tan, D. M. ThilikosUU-CS-1996-30 ps.gz Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems

D. M. Thilikos, H. L. BodlaenderUU-CS-1996-29 ps.gz It is hard to know when greedy is good for finding independent sets

Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi YamazakiUU-CS-1995-02 ps.gz Treewidth and small separators for graphs with small chordality

H. L. Bodlaender, D. M. Thilikos

@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{UUCS2009012, author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Lokshtanov, Daniel and Penninkx, Eelko and Saurabh, Saket and Thilikos, Dimitrios~M.}, year = 2009, title = {(Meta) Kernelization}, number = {UU-CS-2009-012}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-012.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{UUCS2002032, author = {Bodlaender, Hans~L. and Fellows, Michael~R. and Thilikos, Dimitrios~M.}, year = 2002, title = {Derivation of algorithms for cutwidth and related graph layout problems}, number = {UU-CS-2002-032}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-032.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-032.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS200104, author = {Thilikos, D.~M. and Serna, M.~J. and Bodlaender, H.~L.}, year = 2001, title = {A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth}, number = {UU-CS-2001-04}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-04.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-04.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS200038, author = {Thilikos, D.~M. and Bodlaender, H.~L.}, year = 2000, title = {Constructive linear time algorithms for branchwidth}, number = {UU-CS-2000-38}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-38.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-38.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS200024, author = {Thilikos, D.~M. and Serna, M.~J. and Bodlaender, H.~L.}, year = 2000, title = {A constructive linear time algorithm for small cutwidth}, number = {UU-CS-2000-24}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-24.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-24.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199805, author = {Bodlaender, H.~L. and Thilikos, D.~M.}, year = 1998, title = {Computing small search numbers in linear time}, number = {UU-CS-1998-05}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-05.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-05.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199737, author = {Bodlaender, H.~L. and Thilikos, D.~M.}, year = 1997, title = {Graphs with branchwidth at most three}, number = {UU-CS-1997-37}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-37.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-37.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199735, author = {Thilikos, D.~M.}, year = 1997, title = {Algorithms and obstructions for linear-width and related search parameters}, number = {UU-CS-1997-35}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-35.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-35.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199705, author = {Yamazaki, Koichi and Bodlaender, Hans~L. and Fluiter, Babette~de and Thilikos, Dimitrios~M.}, year = 1997, title = {Isomorphism for graphs of bounded distance width}, number = {UU-CS-1997-05}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199641, author = {Bodlaender, H.~L. and Leeuwen, J.~van and Tan, R.~B. and Thilikos, D.~M.}, year = 1996, title = {On Interval Routing Schemes and Treewidth}, number = {UU-CS-1996-41}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-41.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-41.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199630, author = {Thilikos, D.~M. and Bodlaender, H.~L.}, year = 1996, title = {Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems}, number = {UU-CS-1996-30}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-30.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-30.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199629, author = {Bodlaender, Hans~L. and Thilikos, Dimitrios~M. and Yamazaki, Koichi}, year = 1996, title = {It is hard to know when greedy is good for finding independent sets}, number = {UU-CS-1996-29}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.pdf}}, pubcat = {techreport} }

@TECHREPORT{UUCS199502, author = {Bodlaender, H.~L. and Thilikos, D.~M.}, year = 1995, title = {Treewidth and small separators for graphs with small chordality}, number = {UU-CS-1995-02}, institution = {Department of Information and Computing Sciences, Utrecht University}, urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-02.ps.gz}}, urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-02.pdf}}, pubcat = {techreport} }