[MathSciNet]            [DBLP]                          Curriculum Vitae          Βιογραφικό και Αναλυτικό Σημείωμα         (Μέχρι τις 22 Ιανουαρίου του 2010)      



Summary: [Journals: 38, Chapters in Books: 3, Reviews: 1, Conferences (not appeared yet in Journals) 35, Total: 77]
TypeTitleAuthorsMediaYearArea
 
 
 
 
 
 
 
 
 
 
 
 
(A) Journal Derivation of algorithms for cutwidth and related graph layout parameters Hans L. Bodlaender, Michael Fellows, and Dimitrios M. Thilikos Journal of Computer and System Sciences, Vol. 75, No 4, pp. 231-244  2009 Parameterized Algorithms 
(A) Journal Parameterized complexity of finding regular induced subgraphs Hannes Moser, Dimitrios M. Thilikos Journal of Discrete Algorithms, Vol. 7, No. 2, p.p. 181-190 2009 Parameterized Algorithms 
(A) Journal A note on the subgraphs of the (2× ∞)-grid Josep Díaz, Marcin Kamiński, and Dimitrios M. Thilikos Discrete Mathematics, Available online 2009 Other 
(A) Journal Graph Searching in a Crime Wave David Richerby and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 23, No 1, pp. 349-368 2009 Graph Searching 
(A) Journal Subexponential parameterized algorithms Frederic Dorn, Fedor Fomin, and Dimitrios M. Thilikos Computer Science Review, Vol. 1, No. 3, pp. 29-39 2008 Parameterized Algorithms 
(A) Journal Efficient algorithms for counting parameterized list H colorings Josep Díaz, Maria Serna, and Dimitrios M. Thilikos Journal of Computer and System Sciences, Vol. 74, pp. 919–937 2008 Parameterized Algorithms 
(A) Journal Faster fixed-parameter tractable algorithms for matching and packing problems Naomi Nishimura, Michael R. Fellows, Christian Knauer, Prabhakar Ragde, Frances A. Rosamond Dimitrios M. Thilikos, and Sue Whitesides Algorithmica Vol. 52, No. 2, pp. 167–176  2008  Parameterized Algorithms 
(A) Journal An annotated bibliography on guaranteed graph searching Fedor Fomin, and Dimitrios M. Thilikos Theoretical Computer Science, Vol. 399, No. 3, pp. 236-245 2008 Graph Searching 
(A) Journal On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin and Dimitrios M. Thilikos Journal of Graph Theory, Vol. 55, pp. 42–54 2007 Graph Parameters 
(A) Journal Complexity Issues on Bounded Restrictive H-coloring Josep Díaz, Maria Serna, and Dimitrios M. Thilikos Discrete Mathematics, Vol. 307, No. 16, pp. 2082-2093  2007 Graph Homomorphisms 
(A) Journal Dominating sets in planar graphs: branch-width and exponential speed-up Fedor V. Fomin and Dimitrios M. Thilikos SIAM Journal on Computing, Vol. 36, pp. 281–309 2006 Parameterized Algorithms 
(A) Journal The bidimensional theory of bounded-genus graphs and its algorithmic consequences Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 20, No. 2, pp. 357–371 2006 Parameterized Algorithms 
(A) Journal New upper bounds on the decomposability of planar graphs Fedor V. Fomin and Dimitrios M. Thilikos Journal of Graph Theory, Vol. 51, No. 1 2006 Graph Parameters 
(A) Journal A 3-approximation for the pathwidth of Halin graphs Fedor V. Fomin and Dimitrios M. Thilikos  Journal of Discrete Algorithms, Vol. 4, No. 4, pp. 499–510 2006 Approximation Algorithms 
(A) Journal Cutwidth I: A linear time fixed parameter algorithm  Dimitrios M. Thilikos, Maria J. Serna, and Hans L. Bodlaender Journal of Algorithms, Vol. 56, No. 1, pp 1–24 2005 Parameterized Algorithms 
(A) Journal Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Ha jiaghayi, and Dimitrios M. Thilikos Transactions on Algorithms, Vol. 1, No. 1, Pages: 33–47 2005 Parameterized Algorithms 
(A) Journal Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol 152, No. 1–3, p.p. 229-245 2005 Parameterized Algorithms 
(A) Journal Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Ha jiaghayi, and Dimitrios M. Thilikos Journal of the ACM, Vol 52, No. 6, p.866–893 2005 Parameterized Algorithms 
(A) Journal Parameterized Complexity for Graph Layout problems Maria Serna, and Dimitrios M. Thilikos Bulletin of the EATCS, Vol. 86, pp. 41–65 2005 Parameterized Algorithms 
(A) Journal Cutwidth II: Algorihms for partial w-trees of bounded degree.  Dimitrios M. Thilikos, Maria J. Serna, and Hans L. Bodlaender Journal of Algorithms, Vol. 56, No. 1, pp 24–49 2005 Parameterized Algorithms 
(A) Journal Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors Erik Demaine, Mohammadtaghi Ha jiaghayi, and Dimitrios M. Thilikos Algorithmica, Vol. 41, No 4, pp. 245–267 2005  Parameterized Algorithms 
(A) Journal The restrictive H-coloring problem Josep Díaz, Maria Serna, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 145, No. 2, pp. 297–305 2005 Graph Homomorphisms 
(A) Journal Bidimensional Parameters and Local Treewidth Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Ha jiaghayi, and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 18, No. 3, pp. 501–511 2004 Graph Minors 
(A) Journal Approximation algorithms for classes of graphs excluding single-crossing graphs as minors Erik Demaine, Naomi Nishimura, Mohammadtaghi Hajiaghayi, Prabhakar Ragde, and Dimitrios M. Thilikos Journal of Computer and System Sciences, Vol. 69, No. 2, pp. 166-195  2004 Approximation Algorithms 
(A) Journal On the Monotonicity of Games Generated by Symmetric Submodular Functions Fedor Fomin and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 131, pp. 323–335, No. 2 2003 Graph Searching 
(A) Journal Counting H-colorings of Partial k-trees Josep Díaz, Maria Serna, and Dimitrios M. Thilikos Theoretical Computer Science, Vol. 281, No. 1-2, pp. 291–309 2002 Parameterized Algorithms 
(A) Journal On graph powers for leaf-labeled trees Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos Journal of Algorithms, Vol. 42, No 1, pp. 69–108 2002 Other 
(A) Journal Finding Smallest Supertrees Under Minor Containment Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos  International Journal on Foundations of Computer Science, Vol. 11, No. 3 pp. 445-465 2000 Other 
(A) Journal Algorithms and obstructions for linear-width and related search parameters Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 105, pp. 239-271, No. 1-3 2000 Graph Minors 
(A) Journal On parallel partial solutions and approximation schemes for local consistency in networks of constraints Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, and Dimitrios M. Thilikos Constraints, Vol. 5, No. 3, pp. 251-273 2000 Approximation Algorithms 
(A) Journal Graphs with Branchwidth at most three Hans L. Bodlaender and Dimitrios M. Thilikos Journal of Algorithms, Vol. 32, No. 2, pp. 167-194 1999 Graph Parameters 
(A) Journal Isomorphism for graphs of bounded distance width Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, and Dimitrios M. Thilikos Algorithmica, Vol. 24, No 2, pp. 105–127 1999 Graph Parameters 
(A) Journal On interval routing schemes and treewidth Hans L. Bodlaender, Richard B. Tan, and Dimitrios M. Thilikos, and Jan van Leeuwen Information and Computation, Vol. 139, No 1, pp. 92-109 1997 Other 
(A) Journal It is hard to know when greedy is good for finding independent sets Hans L. Bodlaender, Dimitrios M. Thilikos, and Koichi Yamazaki Information Processing Letters, Vol. 61, No. 2, pp. 101–106 1997 Other 
(A) Journal Fugitive search games on graphs and related parameters Nick D. Dendris, Lefteris M. Kirousis, and Dimitrios M. Thilikos Theoretical Computer Science, Vol. 172, No. 1–2, pp. 233–254 1997 Graph Searching 
(A) Journal Treewidth for graphs with small chordality  Hans L. Bodlaender, Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 79, No. 1-3, pp. 45–61 1997 Graph Parameters 
(A) Journal Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems Dimitrios M. Thilikos, Hans L. Bodlaender Information Processing Letters, Vol. 61, No. 5, pp. 227–232 1997 Approximation Algorithms 
(A) Journal The linkage of a graph Lefteris M. Kirousis and Dimitrios M. Thilikos  SIAM Journal on Computing, Vol. 25, No. 3, pp. 626–647 1996 Graph Parameters 
(B) Chapter in Book Branchwidth of Graphs Fedor V. Fomin and Dimitrios M. Thilikos In Ming-Yang Kao (ed.), Encyclopedia of Algorithms, Springer, p.p. 101–105 2008  Graph Parameters 
(B) Chapter in Book Efficient Algorithms for Parameterized List H-colorings Josep Díaz, Maria Serna, and Dimitrios M. Thilikos In Klazar, M.; Kratochvil, J., Loebl, M., Matoušek, J., Thomas, R., and Valtr, P. (eds.) Topics in Discrete Mathematics Dedicated to Jarik Nešetřil on the occasion of his 60th birthday Series: Algorithms and Combinatorics, Vol. 26 2006 Parameterized Algorithms 
(B) Chapter in Book Recent results on Parameterized H-Coloring Josep Díaz, Maria Serna, and Dimitrios M. Thilikos In Jarik Nešetřil and Peter Winkler (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Morphisms and Statistical Physics. American Mathematical Society, ISBN: 0-8218-3551-3. Vol. 53 2004 Parameterized Algorithms 
(C) Review Invitation to fixed-parameter algorithms Dimitrios M. Thilikos Computer Science Review, Vol. 1, No. 2, pp. 103–104 2007  Parameterized Algorithms 
(D) Conference Bidimensionality and Kernels Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos ACM-SIAM Symposium on Discrete Algorithms (SODA10) 2010 Parameterized Algorithms 
(D) Conference On contracting graphs to fixed pattern graphs Pim van ’t Hof, Marcin Kamiński , Daniël Paulusma, Stefan Szeider and Dimitrios M. Thilikos 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010) 2010 Parameterized Algorithms 
(D) Conference Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs Ignasi Sau, and Dimitrios M. Thilikos.  DIMAP workshop on Algorithmic Graph Theory, AGT 2009. Electronic Notes in Discrete Mathematics, Volume 32, 15 March 2009, Pages 59-66 2009 Parameterized Algorithms 
(D) Conference Parameterizing Cut Sets in a Graph by the Number of Their Components Takehiro Ito, Marcin Kaminski, Daniël Paulusma, and Dimitrios Thilikos The 20th International Symposium on Algorithms and Computation (ISAAC 2009) 2009 Parameterized Algorithms 
(D) Conference (Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos The 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. IEEE Computer Society  2009 Parameterized Algorithms 
(D) Conference Contraction Bidimensionality: the Accurate Picture Fedor V. Fomin, Petr Golovach, and Dimitrios M. Thilikos 17th Annual European Symposium on Algorithms, ESA 2009. Lecture Notes in Computer Science, Springer Verlag  2009 Parameterized Algorithms 
(D) Conference Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. Petr A. Golovach, and Dimitrios M. Thilikos.  International Workshop on Parameterized and Exact Computation, IWPEC 2009, Springer Verlag 2009 Parameterized Algorithms 
(D) Conference Induced Packing of Odd Cycles in a Planar Graph Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, and Dimitrios M. Thilikos The 20th International Symposium on Algorithms and Computation (ISAAC 2009) 2009 Other 
(D) Conference On Self-Duality of Branchwidth in Graphs of Bounded Genus Ignasi Sau, and Dimitrios M. Thilikos 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, CTW 2009 2009 Graph Parameters 
(D) Conference Outerplanar Obstructions for Feedback Vertex Set  Juanjo Rué, Konstantinos S. Stavropoulos, and Dimitrios M. Thilikos European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2009, Electronic Notes on Discrete Mathematics, Elsevier Science Publishers. (To appear) 2009 Graph Minors 
(D) Conference Acyclic obstructions for tree-depth Archontia C. Giannopoulou, and Dimitrios M. Thilikos.  European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2009, Electronic Notes on Discrete Mathematics, Elsevier Science Publishers. (To appear) 2009 Graph Minors 
(D) Conference Approximating Acyclicity Parameters of Sparse Hypergraphs Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Vol. 3, pp. 445-456 2009 Approximation Algorithms 
(D) Conference Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas, and Dimitrios M. Thilikos 34th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2008. Lecture Notes in Computer Science, Springer Verlag, Vol. 5344, pp. 264-274 2008 Parameterized Algorithms 
(D) Conference Catalan Structures and Dynamic Programming in H-minor-free graphs Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos 19th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2008. pp. 631-640. (Also appeaed as: Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Subexponential algorithms for non-local problems on H-minor-free graphs, 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications: Honoring the 60th Birthday of J. Nesetril, CS 2006, July 2006.)  2008 Parameterized Algorithms 
(D) Conference Searching for a visible, lazy fugitive David Richerby and Dimitrios M. Thilikos 34th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2008. Lecture Notes in Computer Science, Springer Verlag, Vol. 5344, pp. 348-359 2008 Graph Searching 
(D) Conference Improving the gap of Erdős-Pósa property for minor-closed graph classes Fedor V. Fomin, Saket Saurabh, and Dimitrios M. Thilikos 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Gargnano, Italy, CTW 2009 2008 Graph Minors 
(D) Conference Fast subexponential algorithm for non-local problems on graphs of bounded genus Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, Lecture Notes in Computer Science, Springer Verlag, Vol. 4059, pp. 172–183  2006 Parameterized Algorithms 
(D) Conference Kernels for the Vertex Cover Problem on the Preferred Attachment Model Josep Diaz, Jordi Petit and Dimitrios M. Thilikos.  5th International Workshop on Experimental Algorithms, WEA 2006, Lecture Notes in Computer Science, Springer Verlag, Vol. 4007, pp. 231–240 2006 Other 
(D) Conference Connected Branch Decomposition and Graph Searching Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos SIAM Conference on Discrete Mathematics, DM 2006, Victoria, BC, Canada, 2006 Graph Searching 
(D) Conference On exact algorithms for treewidth Hans Bodlaender, Fedor V. Fomin, Arie Koster, Dieter Kratsch, and Dimitrios M. Thilikos 14th Annual European Symposium on Algorithms, ESA 2006, Lecture Notes in Computer Science, Springer Verlag, Vol. 4168, pp. 672–683 2006 Exact Algorithms 
(D) Conference  Parameterized Counting Algorithms for General Graph Covering Problems.  Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos 9th International Workshop on Algorithms and Data Structures, WADS 2005, Algorithms and data structures, Lecture Notes in Computer Science, Springer Verlag, Vol. 3608, pp. 99–109 2005 Parameterized Algorithms 
(D) Conference Fast FPT-algorithms for cleaning grids  Josep Diaz and Dimitrios M. Thilikos 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2005, Lecture Notes in Computer Science, Springer Verlag, Vol. 3884, pp. 361–371, 2005. (Also appeared as: Josep Diaz and Dimitrios M. Thilikos. Fast FPT-algorithms for cleaning grids. Workshop on Graphs, Morphisms and Applications, WGMA 2005, Centre de Recerca Matemàtica (CRM). Bellaterra, Spain) 2005 Parameterized Algorithms 
(D) Conference Connected graph gearching in outerplanar graphs Fedor V. Fomin, Dimitrios M. Thilikos, and Ioan Todinca 7th International Colloquium on Graph Theory, ICGT 2005, Hyères, September 2005. (Also appeared in Electronic Notes in Discrete Mathematics, Volume 22, 15 October 2005, Pages 213-216) 2005 Graph Searching 
(D) Conference  Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up Fedor V. Fomin and Dimitrios M. Thilikos 31st International Colloquium on Automata, Languages and Programming, ICALP 2004, Springer Verlag, Vol. 3142, pp. 581–592  2004 Parameterized Algorithms 
(D) Conference Computing Small Search Numbers in Linear Time Hans L. Bodlaender and Dimitrios M. Thilikos International Workshop on Parameterized and Exact Computation, IWPEC 2004, Springer Verlag, Vol. 3162, pp. 37–48 2004 Parameterized Algorithms 
(D) Conference A simple and fast approach for solving problems on planar graphs Fedor V. Fomin and Dimitrios M. Thilikos 21st International Symposium on Theoretical Aspects of Computer Science, STACS 2004, Springer Verlag, Vol. 2996, pp. 56 – 67  2004 Exact Algorithms 
(D) Conference Dominating sets and local treewidth Fedor V. Fomin and Dimitrios M. Thilikos 11th Annual European Symposium on Algorithms, ESA 2003, Springer Verlag, Lecture Notes in Computer Science, Vol. 2832, pp. 221 – 229  2003 Parameterized Algorithms 
(D) Conference Recontamination helps when searching a graph without jumping.  Eulalia Barriere and Dimitrios M. Thilikos.  Combinatorics 2002, Maratea (Potenza – Italy), pp. 27–28  2002 Graph Searching 
(D) Conference H-coloring of large degree graphs Josep Díaz, Jaroslav Nešsetřil, Maria Serna, and Dimitrios M. Thilikos 1st Eurasian Conference on Advances in Information and Communication Technology 2002, EURASIA 2002. Springer Verlag, Lecture Notes in Computer Science, Vol. 2510, pp. 850–857  2002 Graph Homomorphisms 
(D) Conference Stability and non-stability of the FIFO protocol  Josep Díaz, Dimitrios Koukopoulos, Sotiris Nikoletseas, Maria Serna, Paul Spirakis, and Dimitrios M. Thilikos.  13th ACM Symposium on Paral lel Algorithms and Architectures SPAA 2001, pp. 48–52 2001 Other 
(D) Conference Constructive linear time algorithms for small cutwidth and carving-width Dimitrios M. Thilikos, Maria J. Serna, and Hans L. Bodlaender.  11th International Symposium on Algorithms and Computation ISAAC 2000, Springer Verlag, Lecture Notes on Computer Science, Vol. 1969, pp. 192–203 2000 Parameterized Algorithms 
(D) Conference Monotonicity and Inert Fugitive Search Games Yannis C. Stamatiou and Dimitrios M. Thilikos 6th Twente Workshop on Graphs and Combinatorial Optimization CTW 1999, University of Twente, Enschede, 1999. (Also appeared in: Electronic Notes in Discrete Mathematics, Volume 3, May 1999, Page 184) 2000 Graph Searching 
(D) Conference  Quickly Excluding K_2,r from Planar Graphs Dimitrios M. Thilikos. 6th Twente Workshop on Graphs and Combinatorial Optimization CTW 1999, University of Twente, Enschede, 1999. (Also appeared in: Electronic Notes in Discrete Mathematics, Volume 3, May 1999, Pages 189-194) 2000 Graph Minors 
(D) Conference Constructive linear time algorithms for branchwidth Hans L. Bodlaender and Dimitrios M. Thilikos 24th International Col loquium on Automata, Languages, and Programming, ICALP 1997, Springer Verlag, Lecture Notes in Computer Science, Vol. 1256, pp. 627–637 1997 Parameterized Algorithms 
(D) Conference An efficient implementation of material requirements planning by using cache memory Dimitrios Blonis, Sotiris Nikoletseas, Dimitris Sofotasios, Athina Spiliou, Paul Spirakis, Dimitrios M. Thilikos, and Bassilis Triantafillou Advanced Summer Institute 1994 in Computer Integrated Manufacturing and Industrial Automation ASI 1994 1994 Other