list

MathSchiNet   dblp    Google Scholar

Chapters in Books: 5
Book Reviews: 1
Articles in international journals: 91
Papers in Conferences (not yet published to journals): 44

Published papers in total: 141

TypeTitleAuthorsMediaYearArea
(A) Journal Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Eun Jung Kim, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos Journal of Computer Systems and Sciences 2017 Parameterized Algorithms 
(A) Journal When is weighted satisfiability in FPT? Iyad Kanj, Dimitrios M. Thilikos, and Ge Xia Information and Computation 2017 Parameterized Algorithms 
(A) Journal The Parameterized Complexity of Graph Cyclability Petr Golovach, Marcin Kamiński, Spyridon Maniatis, add Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics 2017 Parameterized Algorithms 
(A) Journal Editing to a Planar Graph of Given Degrees Konrad K. Dabrowski, Petr A. Golovach, Pim van ’t Hof, Daniël Paulusma, and Dimitrios M. Thilikos Journal of Computer and System Sciences 2017 Parameterized Algorithms 
(A) Journal On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos Theoretical Computer Science. . Vol. 665, pp. 40–50, February 2017 2017 Other 
(A) Journal Recent techniques and results on the Erdős-Pósa property Jean-Florent Raymond and Dimitrios M. Thilikos Discrete Applied Mathematics 2017 Graph Parameters 
(A) Journal An FPT 2-Approximation for Tree-Cut Decomposition Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos Algorithmica 2017 Approximation Algorithms 
(A) Journal An O(log OPT)-approximation for Covering and Packing minor models of θ_r Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, and Dimitrios M. Thilikos Algorithmica 2017 Approximation Algorithms 
(A) Journal Irrelevant Vertices for the Planar Disjoint Paths Problem Isolde Adler, Stavros Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos Journal of Combinatorial Theory, Series B. To appear. 2016 Parameterized Algorithms 
(A) Journal A linear kernel for planar red-blue dominating set. Valentin Garnero, Ignasi Sau, and Dimitrios M. Thilikos Discrete Applied Mathematics 2016 Parameterized Algorithms 
(A) Journal Coverability and sub-exponential parameterized algorithms in planar graphs Dimitrios M. Thilikos Bulletin of the HMS 2016 Parameterized Algorithms 
(A) Journal Explicit Linear Kernels via Dynamic Programming Valentin Garnero, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics 2016 Parameterized Algorithms 
(A) Journal (Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos Journal of the ACM 2016 Parameterized Algorithms 
(A) Journal Minimal Disconnected Cuts in Planar Graphs Marcin Kaminński, Daniel Paulusma, Anthony Stewart, and Dimitrios M. Thilikos Networks 2016 Other 
(A) Journal An edge variant of the Erdős- Pósa property Jean-Florent Raymond, Ignasi Sau, and Dimitrios M. Thilikos Discrete Mathematics, Discrete Mathematics, Vol. 339(8), pp. 2027–2035 2016 Graph Parameters 
(A) Journal Contraction Obstructions for Connected Graph Searching Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros  Discrete Applied Mathematics, Volume 209, Pages 27–47 2016 Graph Minors 
(A) Journal Planar Disjoint-Paths Completion Isolde Adler, Stavros Kolliopoulos, and Dimitrios M. Thilikos Algorithmica 2015 Parameterized Algorithms 
(A) Journal Low Polynomial Exclusion of Planar Graph Patterns Jean-Florent Raymond and Dimitrios M. Thilikos Journal of Graph theory 2015 Graph Minors 
(A) Journal Forbidding Kuratowski Graphs as Immersions Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos Journal of Graph theory, Vol. 78, pp. 43–60, January 2015 2015 Graph Minors 
(A) Journal Dynamic Programming for Graphs on Surfaces. Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos Transactions on Algorithms, Vol. 10, pp. 1–26, February 2014. 2014 Parameterized Algorithms 
(A) Journal Square Roots of Minor Closed Graph Classes Nestor V. Nestoridis, and Dimitrios M. Thilikos Discrete Applied Mathematics Vol. 168, pp. 34–39, May 2014 2014 Graph Minors 
(A) Journal Outerplanar Obstructions for Matroid Pathwidth Athanassios Koutsonas, Dimitrios M. Thilikos, and Koichi Yamazaki Discrete Mathematics, Vol. 315–316, pp. 95–101 2014 Graph Minors 
(A) Journal Lift Contractions Petr A. Golovach, Marcin Kaminński, Daniël Paulusma, and Dimitrios M. Thilikos European Journal of Combinatorics, Vol. 35,, pp. 286–296 2014 Graph Minors 
(A) Journal Increasing the Minimum Degree of a Graph by Contractions Petr Golovach, Marcin Kaminski, Daniel Paulusma, and Dimitrios M. Thilikos  Theoretical Computer Science Vol. 481, pp. 74–84, April 2013 2013 Parameterized Algorithms 
(A) Journal Asymptotic Enumeration of Non-crossing Partitions on Surfaces Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos  Discrete Mathematics Vol. 313, No. 5, pp. 635-649, March 2013. 2013 Other 
(A) Journal D-cores: Measuring Colla- boration of Directed Graphs Based on Degeneracy Michalis Vazirgiannis, Christos Giatsidis, and and Dimitrios M. Thilikos Knowledge and Information Systems, Vol. 35, pp 311–343, May 2013 2013 Other 
(A) Journal Characterizing Graphs of Small Carving-Width Rémy Belmonte, Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 161, pp. 1888–1893, September 2013 2013 Graph Parameters 
(A) Journal Optimizing the Graph Minors Weak Structure Theorem Archontia C. Giannopoulou and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 27, pp. 1209–1227, July 2013. 2013 Graph Minors 
(A) Journal Containment relations in split graphs Petr A. Golovach, Marcin Kaminński, Dani ël Paulusma, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 160, No. 1-2, pp. 155-163, January 2012 2012 Parameterized Algorithms 
(A) Journal Induced Packing of Odd Cycles in a Planar Graph Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, and Dimitrios M. Thilikos Theoretical Computer Science, Vol. 420, pp. 28–35, February 2012. 2012 Parameterized Algorithms 
(A) Journal On Graph Contractions and Induced Minors Pim van ’t Hof, Marcin Kamiński , Daniël Paulusma, Stefan Szeider and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 160, No. 6, pp. 799–809, April 2012. 2012 Parameterized Algorithms 
(A) Journal Catalan Structures and Dynamic Programming in H-minor-free graphs Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos Journal of Computer and System Sciences Vol. 78, No 5, pp. 1606–1622 2012 Parameterized Algorithms 
(A) Journal LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth Archontia C. Giannopoulou, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 160. No. 15. pp. 2089–2097, October 2012 2012 Graph Searching 
(A) Journal Connected Graph Searching Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, and Dimitrios M. Thilikos Information and Computation, Vol. 219, pp. 1–16, September 2012 2012 Graph Searching 
(A) Journal Outerplanar Obstructions for Feedback Vertex Set  Juanjo Rué, Konstantinos S. Stavropoulos, and Dimitrios M. Thilikos European Journal of Combinatorics, Vol. 33, No. 5, pp. 948--968, July 2012 2012 Graph Minors 
(A) Journal Forbidden graphs for tree-depth Archontia C. Giannopoulou, and Dimitrios M. Thilikos.  European Journal of Combinatorics, Vol. 33, No. 5, pp. 969--979, July 2012 2012 Graph Minors 
(A) Journal On exact algorithms for treewidth Hans Bodlaender, Fedor V. Fomin, Arie Koster, Dieter Kratsch, and Dimitrios M. Thilikos Transactions on Algorithms, Vol. 9, No. 1, Pages: 33 – 47 2012 Exact Algorithms 
(A) Journal A Note on Exact Algorithms for Vertex Ordering Problems on Graphs Hans L. Bodlaender, Fedor V. Fomin, Arie M.C.A. Koster, Dieter Kratsch and Dimitrios M. Thilikos Theory of Computing Systems, Vol. 50, No. 3, pp. 420–432 2012 Exact Algorithms 
(A) Journal  Confronting Intractability via Parameters.  Rodney G. Downey, and Dimitrios Thilikos. Computer Science Review, Vol. 5, No. 4, pp. 279–317, November 2011. 2011 Parameterized Algorithms 
(A) Journal Fast Minor Testing in Planar Graphs Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau and Dimtrios M. Thilikos.  Algorithmica, Vol. 64, No. 1, pp. 69-84 2011 Parameterized Algorithms 
(A) Journal Parameterizing Cut Sets in a Graph by the Number of Their Components Takehiro Ito, Marcin Kaminski, Daniël Paulusma, and Dimitrios Thilikos Theoretical Computer Science, Vol. 412, No. 45, pp. 6340--6350, October 2011 2011 Parameterized Algorithms 
(A) Journal Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas, and Dimitrios M. Thilikos Algorithmica, Vol. 60, No. 4, pp. 987--1003, January 2010 2011 Parameterized Algorithms 
(A) Journal Faster Parameterized Algorithms for Minor Containment Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, and Dimitrios M. Thilikos Theoretical Computer Science, Vol. 412, No. 50, pp. 7018-7028, November 2011 2011 Parameterized Algorithms 
(A) Journal Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. Petr A. Golovach, and Dimitrios M. Thilikos.  Discrete Optimization, Vol. 8, No. 1, p.p. 72–86, February 2011 2011 Parameterized Algorithms 
(A) Journal On disconnected cuts and separators Takehiro Ito, Marcin Kaminski, Daniel Paulusma, and Dimitrios M. Thilikos  Discrete Applied Mathematics, Vol. 159, No. 13, p.p. 1345–1351 2011 Other 
(A) Journal On Self-Duality of Branchwidth in Graphs of Bounded Genus Ignasi Sau, and Dimitrios M. Thilikos Discrete Applied Mathematics, Vol. 159, No. 17, pp. 2184--2186, October 2011 2011 Graph Parameters 
(A) Journal Improving the gap of Erdős-Pósa property for minor-closed graph classes Fedor V. Fomin, Saket Saurabh, and Dimitrios M. Thilikos Journal of Graph Theory. Vol. 66, No. 3, pp. 235--240, March 2011 2011 Graph Minors 
(A) Journal Contraction obstructions for treewidth Fedor V. Fomin, Petr Golovach, and Dimitrios M. Thilikos Journal of Combinatorial Theory, Series B, Vol. 101, No. 13, pp. 302--314, September 2011 2011 Graph Minors 
(A) Journal Contracting planar graphs to contractions of triangulations Marcin Kaminski, Daniel Paulusma, and Dimitrios M. Thilikos Journal of Discrete Algorithms, Vol. 9, No. 3, pp. 299--306, September 2011 2011 Graph Minors 
(A) Journal Approximating Width Parameters of Hypergraphs with Excluded Minors Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 25, No. 3, pp. 1331–1348, September 2012 2011 Approximation Algorithms 
(A) Journal Subexponential parameterized algorithms for degree- constrained subgraph problems on planar graphs Ignasi Sau, and Dimitrios M. Thilikos.  Journal of Discrete Algorithms Vol. 8, pp. 330-338, February 2010 2010 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, Vol. 310, No. 3, pp. 531--536, February 2010 2010 Other 
(A) Journal Rank-width and Tree-width of H- minor-free Graphs Fedor V. Fomin, Sang-il Oum, and Dimitrios M. Thilikos European Journal of Combinatorics, Vol. 31, No. 7, pp. 1617-1628, October 2010 2010 Graph Minors 
(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, June 2009 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, pp. 181--190, June 2009 2009 Parameterized Algorithms 
(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, January 200 2009 Graph Searching 
(A) Journal Searching for a visible, lazy fugitive David Richerby and Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, Vol. 23, No. 1, pp. 349--368, January 2009 2009 Graph Searching 
(A) Journal Subexponential parameterized algorithms Frederic Dorn, Fedor Fomin, and Dimitrios M. Thilikos Computer Science Review, Vol. 2, No. 1, pp. 29--39, April 2008 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, No 5, pp. 919--937, August 2008 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, June 2008. 2008 Graph Searching 
(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, December 2007 2007 Parameterized Algorithms 
(A) Journal On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin and Dimitrios M. Thilikos Journal of Graph Theory, Vol. 55, No. 1, pp. 42–54, May 2007 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, July 2007 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 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 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 Bibimensionality Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, and Dimitrios M. Thilikos In Ming-Yang Kao (ed.), Encyclopedia of Algorithms, Springer, pp. 232–237 2016 Parameterized Algorithms 
(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. 232–237 2016 Graph Parameters 
(B) Chapter in Book  Graph Minors and Parameterized Algorithm Design Dimitrios M. Thilikos In Hans L. Bodlaender, Rod Downey , Fedor V. Fomin and Dániel Marx (ed.), Festschrift, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, Vol. 7370, Springer, pp. 228–256,  2012 Parameterized Algorithms 
(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 FPT Algorithms for Plane Completion Problems Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dim- itrios M. Thilikos , and Dimitris Zoros  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Lecture Notes in Computer Science, Springer Verlag, Krakow (Poland) 2016 Parameterized Algorithms 
(D) Conference Cutwidth: obstructions and algorithmic aspects Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos and Marcin Wrochna  11th International Symposium on Parameterized and Exact Computation (IPEC 2016), LIPIcs–Leibniz International Proceedings in Informatics 2016 Graph Parameters 
(D) Conference Packing and covering immersion models of planar subcubic graphs Archontia C. Giannopoulou, Jean-Florent Raymond, Dimitrios M. Thilikos.  42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2016), Lecture Notes in Computer Science, Springer Verlag, İstanbul, Turkey 2016 Graph Parameters 
(D) Conference Bidimensionality and Parameterized Algorithms Dimitrios M. Thilikos IPEC 2015, 10th International Symposium on Parameterized and Exact Computation  2015 Parameterized Algorithms 
(D) Conference Variants of Plane Diameter Completion Petr Golovach, Clément Requilé, and Dimitrios M. Thilikos IPEC 2015, 13th Workshop on Approximation and Online Algorithms 2015 Parameterized Algorithms 
(D) Conference On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015 2015 Other 
(D) Conference An alternative proof for the constructive Asymmetric Lovász Local Lemma Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos CTW 2015, 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, Istanbul, May 26-28, 2015 2015 Other 
(D) Conference A Polynomial-time Algorithm for Outerplanar Diameter Improvement Nathann Cohen, Daniel Gon ̧calves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos CSR 2015, 10th International Computer Science Symposium in Russia  2015 Other 
(D) Conference Bidimensionality of Geometric Intersection Graphs Alexander Grigoriev, Athanassios Koutsonas, and Dimitrios M. Thilikos  SOFSEM 2013, Lecture Notes in Computer Science, Springer Verlag, Vol. 8327, pp. 293–305 2014 Parameterized Algorithms 
(D) Conference CoreCluster: A Degeneracy Based Graph Clustering Framework, Christos Giatsidis, Fragkiskos D. Malliaros, Dimitrios M. Thilikos, and Michalis Vazirgiannis AAAI 2014, July 27-31, 2014, in Quebec City, Canada 2014 Other 
(D) Conference Quantifying trust dynamics in signed graphs, the S-Cores approach Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Dimitrios M. Thilikos, Dimitrios M. Thilikos, Michalis Vazirgiannis SIAM International Conference on Data Mining, SDM 2014, Philadelphia, Pensylvania 2014 Other 
(D) Conference Geometric Extensions of Cutwidth in any Dimension Menelaos I. Karavelas, Spyridon Maniatis, Dimitrios M. Thilikos, and Dimitris Zoros ICGT 2014, Grenoble, France, June 30–July 4, 2014 2014 Graph Parameters 
(D) Conference Covering and packing pumpkin models Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, and Dimitrios M. Thilikos ICGT 2014, Grenoble, France, June 30–July 4, 2014 2014 Graph Parameters 
(D) Conference Structure of W4-immersion free graphs Rémy Belmonte, Archontia Giannopoulou, Daniel Lokshtanov, and Dimitrios M. Thilikos ICGT 2014, Grenoble, France, June 30–July 4,  2014 Graph Minors 
(D) Conference Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and and Dimitrios M. Thilikos.  30th Symposium on Theoretical Aspects of Computer Science (STACS 2013)  2013 Parameterized Algorithms 
(D) Conference Theory and Applications of Bidimensionality Dimitrios M. Thilikos 7th Annual International Conference on Combinatorial Optimization and Applications COCOA 2013, December 12–14, 2013, Chengdu, China. 2013 Parameterized Algorithms 
(D) Conference Polynomial Gap Extensions of the Erdős–Pósa Theorem Jean-Florent Raymond and Dimitrios M. Thilikos European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, September 9–13, 2013 2013 Parameterized Algorithms 
(D) Conference Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou, Marcin Kamiński, and Dimitrios M. Thilikos 39th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2013, June 19 – 21, 2013. 2013 Other 
(D) Conference Dynamic Programming for H-minor-free Graphs Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos 18th Annual International Computing and Combinatorics Conference, COCOON 2012  2012 Parameterized Algorithms 
(D) Conference Contraction checking in graphs on surfaces Marcin Kaminński and Dimitrios M. Thilikos 29th Symposium on Theoretical Aspects of Computer Science (STACS) 2012 Parameterized Algorithms 
(D) Conference Linear Kernels for (Connected) Dominating Set on H-minor-free graphs  Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and and Dimitrios M. Thilikos.  ACM-SIAM Symposium on Discrete Algorithms, SODA 2012 2012 Parameterized Algorithms 
(D) Conference Visual exploration of collaboration networks based on graph degeneracy Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, Michalis Vazirgiannis 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2012 2012 Other 
(D) Conference On the existence of Pure Nash Equilibria in Strategic Search Games Carme Àlvarez, Amalia Duch, Maria Serna, and Dimitrios M. Thilikos  6th International Symposium on Trustworthy Global Computing, TGC 2011 2011 Other 
(D) Conference Evaluating cooperation in communities with the k-core structure Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Taiwan 2011 Other 
(D) Conference Odd cyclic surface separators in planar graphs Petr A. Golovach, Marcin Kaminński, and Dimitrios M. Thilikos 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, June 2009, CTW 2011, 2011 2011 Other 
(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 Contractions of planar graphs in polynomial time Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos 18th Annual European Symposium on Algorithms ESA 2010 2010 Other 
(D) Conference Approximation algorithms for domination search Fedor V. Fomin, Petr A. Golovach and Dimitrios M. Thilikos 8th Workshop on Approximation and Online Algorithms, WAOA 2010  2010 Approximation Algorithms 
(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  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 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 
Εμφάνιση 141 αντικειμένων
Comments