Dimitrios M. Thilikos
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
103
Venues
26
Active years
1994–2026
Best venue rank
A*
Where they publish
- BWG15 papers
- A*SODA14 papers
- A*ICALP13 papers
- AESA13 papers
- ASTACS8 papers
- BISAAC5 papers
- BMFCS5 papers
- A*LICS3 papers
- A*FOCS3 papers
- BSOFSEM3 papers
- BWAOA3 papers
- NationalCSR2 papers
- NationalCOCOON2 papers
- BWADS2 papers
- CIWOCA1 paper
- BICPR1 paper
- BFCT1 paper
- A*AAAI1 paper
- ASDM1 paper
- CCOCOA1 paper
- A*KDD1 paper
- A*ICDM1 paper
- BLATIN1 paper
- BSPAA1 paper
- CCIAC1 paper
- ACP1 paper
Papers
103 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Plane Strong Connectivity Augmentation. | Stphane Bessy, Daniel Gonalves, Amadeus Reinald, Dimitrios M. Thilikos |
| 2026 | ICALP | Colorful Minors. | Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2026 | LICS | Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes. | Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny |
| 2026 | SODA | ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. | Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos |
| 2026 | SODA | Catching Rats in H-minor-free Graphs. | Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2026 | WG | Obstructions for Minor-Closed Classes of Limiting Densities Below 3/2. | Antonios Kominatos, Reem Mahmoud, Dimitrios M. Thilikos |
| 2025 | ESA | Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. | Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
| 2025 | SODA | Finding irrelevant vertices in linear time on bounded-genus graphs. | Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2025 | SODA | Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2024 | FOCS | Obstructions to Erds-Psa Dualities for Minors. | Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | ICALP | Delineating Half-Integrality of the Erdős-Psa Property for Minors: The Case of Surfaces. | Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | IWOCA | Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. | Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos |
| 2024 | LICS | Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. | Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny |
| 2024 | WG | Approximating Branchwidth on Parametric Extensions of Planarity. | Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2023 | ICALP | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ICALP | Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. | Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | SODA | Kernelization for Graph Packing Problems via Rainbow Matching. | Stphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2023 | SODA | Excluding Single-Crossing Matching Minors in Bipartite Graphs. | Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2023 | SODA | Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2022 | FOCS | Killing a vortex. | Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2021 | LICS | Parameterized Complexity of Elimination Distance to First-Order Logic Properties. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2021 | WG | Block Elimination Distance. | znur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2021 | WG | Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2020 | ESA | An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ESA | A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. | Mamadou Moustapha Kant, Christophe Paul, Dimitrios M. Thilikos |
| 2020 | ICALP | An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ICPR | Hcore-Init: Neural Network Initialization based on Graph Degeneracy. | Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis |
| 2020 | SODA | A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
| 2020 | SODA | Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2019 | STACS | Modification to Planarity is Fixed Parameter Tractable. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2019 | STACS | Lean Tree-Cut Decompositions: Obstructions and Algorithms. | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
| 2019 | SOFSEM | Minimum Reload Cost Graph Factors. | Julien Baste, Didem Gzpek, Mordechai Shalom, Dimitrios M. Thilikos |
| 2018 | ISAAC | Data-Compression for Parametrized Counting Problems on Sparse Graphs. | Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos |
| 2017 | ICALP | Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
| 2017 | MFCS | Structured Connectivity Augmentation. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2016 | MFCS | FPT Algorithms for Plane Completion Problems. | Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clment Requil, Dimitrios M. Thilikos, Dimitris Zoros |
| 2016 | WG | Packing and Covering Immersion Models of Planar Subcubic Graphs. | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
| 2015 | CSR | A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. | Nathann Cohen, Daniel Gonalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller |
| 2015 | CSR | Editing to a Planar Graph of Given Degrees. | Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Danil Paulusma, Dimitrios M. Thilikos |
| 2015 | FCT | Minimal Disconnected Cuts in Planar Graphs. | Marcin Kaminski, Danil Paulusma, Anthony Stewart, Dimitrios M. Thilikos |
| 2015 | WAOA | An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. | Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos |
| 2015 | WAOA | An FPT 2-Approximation for Tree-cut Decomposition. | Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2014 | AAAI | CoreCluster: A Degeneracy Based Graph Clustering Framework. | Christos Giatsidis, Fragkiskos D. Malliaros, Dimitrios M. Thilikos, Michalis Vazirgiannis |
| 2014 | ESA | The Parameterized Complexity of Graph Cyclability. | Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos |
| 2014 | STACS | Explicit Linear Kernels via Dynamic Programming. | Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2014 | SDM | Quantifying trust dynamics in signed graphs, the S-Cores approach. | Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Dimitrios M. Thilikos, Michalis Vazirgiannis |
| 2014 | SOFSEM | Bidimensionality of Geometric Intersection Graphs. | Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos |
| 2013 | STACS | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2013 | WG | Excluding Graphs as Immersions in Surface Embedded Graphs. | Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos |
| 2012 | COCOA | Characterizing Graphs of Small Carving-Width. | Rmy Belmonte, Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2012 | COCOON | Dynamic Programming for H-minor-free Graphs. | Juanjo Ru, Ignasi Sau, Dimitrios M. Thilikos |
| 2012 | KDD | Visual exploration of collaboration networks based on graph degeneracy. | Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, Michalis Vazirgiannis |
| 2012 | SODA | Linear kernels for (connected) dominating set on | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2012 | STACS | Contraction checking in graphs on surfaces. | Marcin Kaminski, Dimitrios M. Thilikos |
| 2011 | ESA | Fast Sub-exponential Algorithms and Compactness in Planar Graphs. | Dimitrios M. Thilikos |
| 2011 | ICALP | Tight Bounds for Linkages in Planar Graphs. | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2011 | ICDM | D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. | Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis |
| 2010 | ESA | Fast Minor Testing in Planar Graphs. | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | ESA | Contractions of Planar Graphs in Polynomial Time. | Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2010 | ICALP | Dynamic Programming for Graphs on Surfaces. | Juanjo Ru, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | SODA | Bidimensionality and Kernels. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2010 | SOFSEM | On Contracting Graphs to Fixed Pattern Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
| 2010 | WAOA | Approximation Algorithms for Domination Search. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | ESA | Contraction Bidimensionality: The Accurate Picture. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | FOCS | (Meta) Kernelization. | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| 2009 | ISAAC | Induced Packing of Odd Cycles in a Planar Graph. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | ISAAC | Parameterizing Cut Sets in a Graph by the Number of Their Components. | Takehiro Ito, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | STACS | Approximating Acyclicity Parameters of Sparse Hypergraphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2008 | SODA | Catalan structures and dynamic programming in | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2008 | WG | Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. | Athanassios Koutsonas, Dimitrios M. Thilikos |
| 2008 | WG | Searching for a Visible, Lazy Fugitive. | David Richerby, Dimitrios M. Thilikos |
| 2007 | ICALP | Subexponential Parameterized Algorithms. | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | WG | Graph Searching in a Crime Wave. | David Richerby, Dimitrios M. Thilikos |
| 2006 | ESA | On Exact Algorithms for Treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| 2006 | STACS | Fast FPT-Algorithms for Cleaning Grids. | Josep Daz, Dimitrios M. Thilikos |
| 2005 | WADS | Parameterized Counting Algorithms for General Graph Covering Problems. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2004 | ESA | Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2004 | ESA | Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
| 2004 | ICALP | Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2004 | LATIN | Bidimensional Parameters and Local Treewidth. | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2004 | MFCS | The Bidimensional Theory of Bounded-Genus Graphs. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2004 | SODA | Subexponential parameterized algorithms on graphs of bounded-genus and | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2004 | STACS | A Simple and Fast Approach for Solving Problems on Planar Graphs. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2003 | ESA | Dominating Sets and Local Treewidth. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2003 | ICALP | Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2003 | MFCS | Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| 2003 | SODA | Dominating sets in planar graphs: branch-width and exponential speed-up. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2003 | WG | Searching Is Not Jumping. | Lali Barrire, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos |
| 2002 | ISAAC | Exponential Speedup of Fixed-Parameter Algorithms on K | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2002 | WG | The Complexity of Restrictive H-Coloring. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | COCOON | Counting H-Colorings of Partial k-Trees. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | ESA | A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 2001 | MFCS | (H, C, K)-Coloring: Fast, Easy, and Hard Cases. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | SPAA | Stability and non-stability of the FIFO protocol. | Josep Daz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos |
| 2001 | WADS | Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2001 | WG | On the Monotonicity of Games Generated by Symmetric Submodular Functions. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2000 | ISAAC | Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 1999 | WG | Finding Smallest Supertrees Under Minor Containment. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 1997 | CIAC | Isomorphism for Graphs of Bounded Distance Width. | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
| 1997 | ICALP | Constructive Linear Time Algorithms for Branchwidth. | Hans L. Bodlaender, Dimitrios M. Thilikos |
| 1995 | CP | Partial Arc Consistency. | Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos |
| 1995 | WG | On Interval Routing Schemes and Treewidth. | Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen |
| 1994 | WG | Fugitive-Search Games on Graphs and Related Parameters. | Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos |