Accéder directement au contenu

Dimitrios Thilikos

24
Documents

Présentation

Publications

51688

The mixed search game against an agile and visible fugitive is monotone

Guillaume Mescoff , Christophe Paul , Dimitrios M. Thilikos
Discrete Mathematics, 2023, 346 (4), pp.113345. ⟨10.1016/j.disc.2023.113345⟩
Article dans une revue hal-04042958v1
Image document

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
SIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩
Article dans une revue lirmm-04171495v1
Image document

k-apices of minor-closed graph classes. I. Bounding the obstructions

Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
Journal of Combinatorial Theory, Series B, 2023, 161, pp.180-227. ⟨10.1016/j.jctb.2023.02.012⟩
Article dans une revue lirmm-04028310v1
Image document

On Strict Brambles

Emmanouil Lardas , Evangelos Protopapas , Dimitrios M. Thilikos , Dimitris Zoros
Graphs and Combinatorics, 2023, 39 (2), pp.24. ⟨10.1007/s00373-023-02618-y⟩
Article dans une revue hal-04042967v1

Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs

Fedor V. Fomin , Petr Golovach , Dimitrios M. Thilikos
Information and Computation, 2023, 293, pp.105049. ⟨10.1016/j.ic.2023.105049⟩
Article dans une revue hal-04265660v1

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

Petr Golovach , Giannos Stamoulis , Dimitrios M. Thilikos
ACM Transactions on Algorithms, 2023, 19 (3), pp.1-29. ⟨10.1145/3583688⟩
Article dans une revue hal-04265667v1
Image document

A polynomial time algorithm to compute the connected treewidth of a series–parallel graph

Guillaume Mescoff , Christophe Paul , Dimitrios M. Thilikos
Discrete Applied Mathematics, 2022, 312, pp.72-85. ⟨10.1016/j.dam.2021.02.039⟩
Article dans une revue lirmm-03676663v1
Image document

Block Elimination Distance

Öznur Yaşar Diner , Archontia Giannopoulou , Giannos Stamoulis , Dimitrios M. Thilikos
Graphs and Combinatorics, 2022, 38 (5), pp.#133. ⟨10.1007/s00373-022-02513-y⟩
Article dans une revue hal-03835914v1
Image document

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms

Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ACM Transactions on Algorithms, 2022, 18 (3), pp.1-30. ⟨10.1145/3519028⟩
Article dans une revue hal-03835923v1

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth

Mamadou Moustapha Kanté , Christophe Paul , Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics, 2022, 36 (1), pp.411-435. ⟨10.1137/20M1369361⟩
Article dans une revue hal-03771145v1
Image document

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL

Fedor Fomin , Petr Golovach , Giannos Stamoulis , Dimitrios M. Thilikos
ACM Transactions on Computation Theory, 2022, 14 (3-4), pp.1-29. ⟨10.1145/3571278⟩
Article dans une revue hal-04043067v1
Image document

Connected search for a lazy robber

Isolde Adler , Christophe Paul , Dimitrios M. Thilikos
Journal of Graph Theory, 2021, 97 (4), pp.510-552. ⟨10.1002/jgt.22669⟩
Article dans une revue hal-03327307v1
Image document

Minor obstructions for apex-pseudoforests

Alexandros Leivaditis , Alexandros Singh , Giannos Stamoulis , Dimitrios M. Thilikos , Konstantinos Tsatsanis
Discrete Mathematics, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩
Article dans une revue hal-03327317v1
Image document

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

Fedor Fomin , Petr Golovach , Dimitrios M. Thilikos
ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩
Article dans une revue hal-03389854v2
Image document

Faster parameterized algorithms for modification problems to minor-closed classes

Laure Morelle , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.93:1-93:19, ⟨10.4230/LIPIcs.ICALP.2023.93⟩
Communication dans un congrès lirmm-04253814v1
Image document

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

Petr Golovach , Giannos Stamoulis , Dimitrios M. Thilikos
SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3684-3699, ⟨10.1137/1.9781611977554.ch141⟩
Communication dans un congrès hal-04043007v1
Image document

Dynamic programming on bipartite tree decompositions

Lars Jaffke , Laure Morelle , Ignasi Sau , Dimitrios M. Thilikos
IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.16:1-16:22, ⟨10.4230/LIPIcs.IPEC.2023.26⟩
Communication dans un congrès lirmm-04253839v1

Excluding Single-Crossing Matching Minors in Bipartite Graphs

Archontia Giannopoulou , Dimitrios M. Thilikos , Sebastian Wiederrecht
SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.2111-2121, ⟨10.1137/1.9781611977554.ch81⟩
Communication dans un congrès hal-04042983v1
Image document

Kernelization for Graph Packing Problems via Rainbow Matching

Stéphane Bessy , Marin Bougeret , Dimitrios M. Thilikos , Sebastian Wiederrecht
SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩
Communication dans un congrès hal-04042995v1
Image document

Compound Logics for Modification Problems

Fedor V. Fomin , Petr A. Golovach , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.1-21, ⟨10.4230/LIPIcs.ICALP.2023.51⟩
Communication dans un congrès lirmm-04253801v1
Image document

Killing a vortex

Dimitrios M. Thilikos , Sebastian Wiederrecht
FOCS 2022 - 63rd IEEE Annual Symposium on Foundations of Computer Science, Oct 2022, Denver, United States. pp.1069-1080, ⟨10.1109/FOCS54457.2022.00104⟩
Communication dans un congrès hal-04043027v1

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

Fedor V. Fomin , Petr A. Golovach , Dimitrios M. Thilikos
LICS 2021 - 36th ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470540⟩
Communication dans un congrès hal-04043100v1