Dimitrios M. Thilikos

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 168

Top Venues

CoRR

IPEC

Discret. Appl. Math.

SIAM J. Discret. Math.

Publications

Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Obstructions to Erdös-Pósa Dualities for Minors. CoRR (2024)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR (2024)
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA (2024)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS (2024)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a Vortex. J. ACM 71 (4) (2024)
Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Dynamic programming on bipartite tree decompositions. CoRR (2023)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
Graph Parameters, Universal Obstructions, and WQO. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293 (2023)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR (2023)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52 (4) (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19 (3) (2023)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP (2023)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory, Ser. B 161 (2023)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Approximating branchwidth on parametric extensions of planarity. CoRR (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA (2023)
Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Dynamic Programming on Bipartite Tree Decompositions. IPEC (2023)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
The mixed search game against an agile and visible fugitive is monotone. Discret. Math. 346 (4) (2023)
Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341 (2023)
Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros
On Strict Brambles. Graphs Comb. 39 (2) (2023)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Compound Logics for Modification Problems. ICALP (2023)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. SODA (2023)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
Universal Obstructions of Graph Parameters. CoRR (2023)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37 (4) (2023)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR (2022)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a Vortex. CoRR (2022)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR (2022)
Julien Baste, Dimitrios M. Thilikos
Contraction Bidimensionality of Geometric Intersection Graphs. CoRR (2022)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18 (3) (2022)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a vortex. FOCS (2022)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. 312 (2022)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14 (3-4) (2022)
Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros
On Strict Brambles. CoRR (2022)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. Graphs Comb. 38 (5) (2022)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36 (1) (2022)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR (2022)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR (2022)
Julien Baste, Dimitrios M. Thilikos
Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica 84 (2) (2022)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23 (3) (2022)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
The mixed search game against an agile and visible fugitive is monotone. CoRR (2022)
Dimitrios M. Thilikos
Compactors for parameterized counting problems. Comput. Sci. Rev. 39 (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR (2021)
Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM (2021)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR (2021)
Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
A Constant-factor Approximation for Weighted Bond Cover. CoRR (2021)
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis
Minor obstructions for apex-pseudoforests. Discret. Math. 344 (10) (2021)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. CoRR (2021)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35 (1) (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A more accurate view of the Flat Wall Theorem. CoRR (2021)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected search for a lazy robber. J. Graph Theory 97 (4) (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A Compound Logic for Modification Problems: Big Kingdoms Fall from Within. CoRR (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR (2021)
Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
Edge-trewidth: Algorithmic and combinatorial properties. CoRR (2021)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65 (5) (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS (2021)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
A Menger-like property of tree-cut width. J. Comb. Theory, Ser. B 148 (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109 (2020)
Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
Subgraph Complementation. Algorithmica 82 (7) (2020)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814 (2020)
Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros
Sparse obstructions for minor-covering parameters. Discret. Appl. Math. 278 (2020)
Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. 839 (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34 (3) (2020)
Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona
Structure and enumeration of K4-minor-free links and link-diagrams. Eur. J. Comb. 89 (2020)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP (2020)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75 (3) (2020)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA (2020)
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Bidimensionality and Kernels. SIAM J. Comput. 49 (6) (2020)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA (2020)
Dimitrios M. Thilikos
A Retrospective on (Meta) Kernelization. Treewidth, Kernels, and Algorithms (2020)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. 64 (2) (2020)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA (2020)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR (2020)
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona
Minor-obstructions for apex sub-unicyclic graphs. Discret. Appl. Math. 284 (2020)
Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
Edge Degeneracy: Algorithmic and Structural Results. CoRR (2020)
Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR (2020)
Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis
Hcore-Init: Neural Network Initialization based on Graph Degeneracy. CoRR (2020)
Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis
Hcore-Init: Neural Network Initialization based on Graph Degeneracy. ICPR (2020)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit Linear Kernels for Packing Problems. Algorithmica 81 (4) (2019)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected Search for a Lazy Robber. FSTTCS (2019)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Modification to Planarity is Fixed Parameter Tractable. STACS (2019)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR (2019)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR (2019)
Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos
Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. 794 (2019)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81 (2) (2019)
Petr A. Golovach, Dimitrios M. Thilikos
Clustering to Given Connectivities. IPEC (2019)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. SOFSEM (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS (2019)
Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC (2018)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean tree-cut decompositions: obstructions and algorithms. CoRR (2018)
Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
Partial complementation of graphs. CoRR (2018)
Petr A. Golovach, Dimitrios M. Thilikos
Clustering to Given Connectivities. CoRR (2018)

Dimitrios M. Thilikos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dimitrios M. Thilikos