Dimitrios Thilikos

Présentation

Publications

Article dans une revue (83)

Vertex identification to a forest Laure Morelle,Ignasi Sau,Dimitrios Thilikos Discrete Mathematics, 2026, 349 (1), pp.114699. ⟨10.1016/j.disc.2025.114699⟩ Article dans une revue lirmm-05386273v1
Dynamic programming on bipartite tree decompositions Lars Jaffke,Laure Morelle,Ignasi Sau,Dimitrios Thilikos Journal of Computer and System Sciences, 2026, 156, pp.103722. ⟨10.1016/j.jcss.2025.103722⟩ Article dans une revue lirmm-05386282v1
A constant-factor approximation for weighted bond cover Eun Jung Kim,Euiwoong Lee,Dimitrios M. Thilikos Journal of Computer and System Sciences, 2025, 149, pp.103617. ⟨10.1016/j.jcss.2024.103617⟩ Article dans une revue hal-04986061v1
A more accurate view of the Flat Wall Theorem Ignasi Sau,Giannos Stamoulis,Dimitrios M. Thilikos Journal of Graph Theory, 2024, 107 (2), pp.263-297. ⟨10.1002/jgt.23121⟩ Article dans une revue lirmm-04700544v1
Compound Logics for Modification Problems Fedor V. Fomin,Petr A. Golovach,Ignasi Sau,Giannos Stamoulis,Dimitrios M. Thilikos ACM Transactions on Computational Logic, 2024, Leibniz International Proceedings in Informatics (LIPIcs), 26 (1), pp.1-57. ⟨10.1145/3696451⟩ Article dans une revue lirmm-04825119v1
Killing a Vortex Dimitrios M. Thilikos,Sebastian Wiederrecht Journal of the ACM (JACM), 2024, 71 (4), pp.1-56/27. ⟨10.1145/3664648⟩ Article dans une revue hal-04702086v1
Faster parameterized algorithms for modification problems to minor-closed classes Laure Morelle,Giannos Stamoulis,Ignasi Sau,Dimitrios M. Thilikos TheoretiCS, 2024, 3, ⟨10.46298/theoretics.24.19⟩ Article dans une revue lirmm-04698814v1
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
Edge-treewidth: Algorithmic and combinatorial properties Loïc Magne,Christophe Paul,Abhijat Sharma,Dimitrios M. Thilikos Discrete Applied Mathematics, 2023, 341, pp.40-54. ⟨10.1016/j.dam.2023.07.023⟩ Article dans une revue hal-04702071v1
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
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
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
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
Combing a Linkage in an Annulus Petr A. Golovach,Giannos Stamoulis,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2023, 37 (4), pp.2332-2364. ⟨10.1137/22M150914X⟩ Article dans une revue hal-04702064v1
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
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 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
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
Contraction Bidimensionality of Geometric Intersection Graphs Julien Baste,Dimitrios M. Thilikos Algorithmica, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩ Article dans une revue hal-03541133v1
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
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
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Dimitrios M. Thilikos,Archontia Giannopoulou,Michał Pilipczuk,Jean-Florent Raymond,Marcin Wrochna SIAM Journal on Discrete Mathematics, 2021, 35 (1), pp.105-151. ⟨10.1137/18M1228839⟩ Article dans une revue hal-03327286v1
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
Compactors for parameterized counting problems Dimitrios M. Thilikos Computer Science Review, 2021, 39, pp.100344. ⟨10.1016/j.cosrev.2020.100344⟩ Article dans une revue hal-03093911v1
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
A Menger-like property of tree-cut width Archontia C Giannopoulou,O-Joung Kwon,Jean-Florent Raymond,Dimitrios M. Thilikos Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩ Article dans une revue hal-03094586v1
Minimum Reload Cost Graph Factors Julien Baste,Didem Gözüpek,Mordechai Shalom,Dimitrios M. Thilikos Theory of Computing Systems, 2021, 65 (5), pp.815-838. ⟨10.1007/s00224-020-10012-x⟩ Article dans une revue hal-03327294v1
Sparse obstructions for minor-covering parameters Dimitris Chatzidimitriou,Dimitrios M. Thilikos,Dimitris Zoros Discrete Applied Mathematics, 2020, 278, pp.28-50. ⟨10.1016/j.dam.2019.10.021⟩ Article dans une revue hal-03002639v1
Hitting minors on bounded treewidth graphs. III. Lower bounds Julien Baste,Ignasi Sau,Dimitrios M. Thilikos Journal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩ Article dans une revue lirmm-02989938v1
Minor-obstructions for apex sub-unicyclic graphs Alexandros Leivaditis,Alexandros Singh,Giannos Stamoulis,Dimitrios M. Thilikos,Konstantinos Tsatsaniset al. Discrete Applied Mathematics, 2020, 284, pp.538-555. ⟨10.1016/j.dam.2020.04.019⟩ Article dans une revue hal-03002632v1
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
Bidimensionality and Kernels Fedor Fomin,Daniel Lokshtanov,Saket Saurabh,Dimitrios M. Thilikos SIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩ Article dans une revue hal-03094544v1
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds Julien Baste,Ignasi Sau,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩ Article dans une revue lirmm-02989921v1
Structure and enumeration of $K_4$- minor-free links and link-diagrams Juanjo Rué,Dimitrios M. Thilikos,Vasiliki Velona European Journal of Combinatorics, 2020, 89, pp.103147. ⟨10.1016/j.ejc.2020.103147⟩ Article dans une revue hal-03002619v1
Parameterized complexity of finding a spanning tree with minimum reload cost diameter Julien Baste,Didem Gözüpek,Christophe Paul,Ignasi Sau,Mordechai Shalomet al. Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩ Article dans une revue lirmm-02989889v1
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms Julien Baste,Ignasi Sau,Dimitrios M. Thilikos Theoretical Computer Science, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩ Article dans une revue lirmm-02989928v1
Subgraph Complementation Fedor V. Fomin,Petr A. Golovach,Torstein Strømme,Dimitrios M. Thilikos Algorithmica, 2020, 82 (7), pp.1859-1880. ⟨10.1007/s00453-020-00677-8⟩ Article dans une revue hal-03002656v1
Edge degeneracy: Algorithmic and structural results Stratis Limnios,Christophe Paul,Joanny Perret,Dimitrios M. Thilikos Theoretical Computer Science, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩ Article dans une revue hal-03001062v1
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties Fedor V. Fomin,Petr A. Golovach,Dimitrios M. Thilikos Theory of Computing Systems, 2020, 64 (2), pp.251-271. ⟨10.1007/s00224-019-09938-8⟩ Article dans une revue hal-03002648v1
Explicit Linear Kernels for Packing Problems Valentin Garnero,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos Algorithmica, 2019, 81 (4), pp.1615-1656. ⟨10.1007/s00453-018-0495-5⟩ Article dans une revue lirmm-02342736v1
Cutwidth: Obstructions and Algorithmic Aspects Archontia C. Giannopoulou,Michał Pilipczuk,Jean-Florent Raymond,Dimitrios M. Thilikos,Marcin Wrochna Algorithmica, 2019, 81 (2), pp.557-588. ⟨10.1007/s00453-018-0424-7⟩ Article dans une revue hal-01814167v1
An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$ Dimitris Chatzidimitriou,Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos Algorithmica, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩ Article dans une revue lirmm-01609998v1
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors Fedor V. Fomin,Daniel Lokshtanov,Saket Saurabh,Dimitrios M. Thilikos ACM Transactions on Algorithms, 2018, 14 (1), pp.1-31. ⟨10.1145/3155298⟩ Article dans une revue lirmm-01890563v1
Structure and Enumeration of $K4$-minor-free links and link diagrams Juanjo Rué,Dimitrios M. Thilikos,Vasiliki Velona Electronic Notes in Discrete Mathematics, 2018, 68, pp.119-124. ⟨10.1016/j.endm.2018.06.021⟩ Article dans une revue lirmm-01890505v1
Structured Connectivity Augmentation Fedor V. Fomin,Petr A. Golovach,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2018, 32 (4), pp.2612-2635. ⟨10.1137/17M1146233⟩ Article dans une revue lirmm-02342799v1
An FPT 2-Approximation for Tree-Cut Decomposition Eun Jung Kim,Sang-Il Oum,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos Algorithmica, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩ Article dans une revue hal-01690385v1
A polynomial-time algorithm for Outerplanar Diameter Improvement Nathann Cohen,Daniel Gonçalves,Eun Jung Kim,Christophe Paul,Ignasi Sauet al. Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩ Article dans une revue hal-01592242v1
Low Polynomial Exclusion of Planar Graph Patterns Jean-Florent Raymond,Dimitrios M. Thilikos Journal of Graph Theory, 2017, 84 (1), pp.26-44. ⟨10.1002/jgt.22009⟩ Article dans une revue lirmm-01263767v1
Minors in graphs of large θr-girth Dimitris Chatzidimitriou,Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos European Journal of Combinatorics, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩ Article dans une revue hal-01218519v2
Acyclic edge coloring through the Lovász Local Lemma Dimitrios M. Thilikos,Ioannis Giotis,Lefteris Kirousis,Kostas I. Psaromiligkos Theoretical Computer Science, 2017, 665, pp.40 - 50. ⟨10.1016/j.tcs.2016.12.011⟩ Article dans une revue hal-01632338v1
A linear kernel for planar red–blue dominating set Valentin Garnero,Ignasi Sau,Dimitrios M. Thilikos Discrete Applied Mathematics, 2017, 217, pp.536-547. ⟨10.1016/j.dam.2016.09.045⟩ Article dans une revue lirmm-01481785v1
Packing and covering immersion-expansions of planar sub-cubic graphs Archontia C. Giannopoulou,O-Joung Kwon,Jean-Florent Raymond,Dimitrios M. Thilikos European Journal of Combinatorics, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩ Article dans une revue lirmm-01610005v2
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability Iyad Kanj,Dimitrios M. Thilikos,Ge Xia Information and Computation, 2017, 257 (139-156), ⟨10.1016/j.ic.2017.11.002⟩ Article dans une revue hal-01689398v1
Recent techniques and results on the Erdős-Pósa property Jean-Florent Raymond,Dimitrios M. Thilikos Discrete Applied Mathematics, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩ Article dans une revue lirmm-01486771v2
Parameterized algorithms for min-max multiway cut and list digraph homomorphism Eun Jung Kim,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos Journal of Computer and System Sciences, 2017, 86, pp.191-206. ⟨10.1016/j.jcss.2017.01.003⟩ Article dans une revue lirmm-01487567v1
Irrelevant vertices for the planar Disjoint Paths Problem Isolde Adler,Stavros G. Kolliopoulos,Philipp Klaus Krause,Daniel Lokshtanov,Saket Saurabhet al. Journal of Combinatorial Theory, Series B, 2017, 122, pp.815-843. ⟨10.1016/j.jctb.2016.10.001⟩ Article dans une revue hal-01632343v1
The Parameterized Complexity of Graph Cyclability Petr A. Golovach,Marcin Kamiński,Spyridon Maniatis,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2017, 31 (1), pp.511 - 541. ⟨10.1137/141000014⟩ Article dans une revue hal-01632332v1
Editing to a planar graph of given degrees Konrad K. Dabrowski,Petr A. Golovach,Pim van 'T Hof,Daniël Paulusma,Dimitrios M. Thilikos Journal of Computer and System Sciences, 2017, 85, pp.168-182. ⟨10.1016/j.jcss.2016.11.009⟩ Article dans une revue hal-01632341v1
Minimal disconnected cuts in planar graphs Marcin Kamiński,Daniël Paulusma,Anthony Stewart,Dimitrios M. Thilikos Networks, 2016, 68 (4), pp.250-259. ⟨10.1002/net.21696⟩ Article dans une revue lirmm-01483626v1
(Meta) Kernelization Hans L. Bodlaender,Fedor V. Fomin,Daniel Lokshtanov,Eelko Penninkx,Saket Saurabhet al. Journal of the ACM (JACM), 2016, 63 (5), pp.#44. ⟨10.1145/2973749⟩ Article dans une revue lirmm-01483628v1
An edge variant of the Erdős–Pósa property Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos Discrete Mathematics, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩ Article dans une revue lirmm-01347430v2
Contraction Obstructions for Connected Graph Searching Best Micah J,Arvind Gupta,Dimitrios M. Thilikos,Dimitris Zoros Discrete Applied Mathematics, 2016, 209, pp.27-47. ⟨10.1016/j.dam.2015.07.036⟩ Article dans une revue lirmm-01349860v1
Planar Disjoint-Paths Completion Isolde Adler,Stavros G. Kolliopoulos,Dimitrios M. Thilikos Algorithmica, 2015, 76 (2), pp.401-425. ⟨10.1007/s00453-015-0046-2⟩ Article dans une revue lirmm-01370272v1
Forbidding Kuratowski Graphs as Immersions Archontia C. Giannopoulou,Marcin Kaminski,Dimitrios M. Thilikos Journal of Graph Theory, 2015, 78 (1), pp.43-60. ⟨10.1002/jgt.21790⟩ Article dans une revue lirmm-00904533v1
Explicit Linear Kernels via Dynamic Programming Valentin Garnero,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2015, 29 (4), pp.1864-1894. ⟨10.1137/140968975⟩ Article dans une revue lirmm-01263857v1
Outerplanar obstructions for matroid pathwidth Athanassios Koutsonas,Dimitrios M. Thilikos,Koichi Yamazaki Discrete Mathematics, 2014, 315, pp.95-101. ⟨10.1016/j.disc.2013.10.007⟩ Article dans une revue lirmm-01225581v1
Dynamic Programming for Graphs on Surfaces Juanjo Rué,Ignasi Sau,Dimitrios M. Thilikos ACM Transactions on Algorithms, 2014, 10 (2), pp.1-26/8. ⟨10.1145/2556952⟩ Article dans une revue lirmm-01083690v1
Square roots of minor closed graph classes Nestor Nestoridis,Dimitrios M. Thilikos Discrete Applied Mathematics, 2014, 168, pp.34 - 39. ⟨10.1016/j.dam.2013.05.026⟩ Article dans une revue hal-01083980v2
Lift-contractions Petr A. Golovach,Daniël Paulusma,Marcin Kamiski,Dimitrios M. Thilikos European Journal of Combinatorics, 2014, 35, pp.286-296. ⟨10.1016/j.ejc.2013.06.026⟩ Article dans une revue hal-01083984v1
Outerplanar obstructions for matroid pathwidth Athanassios Koutsonas,Dimitrios M. Thilikos,Koichi Yamazaki Discrete Mathematics, 2013, 315-316, pp.95-101. ⟨10.1016/j.disc.2013.10.007⟩ Article dans une revue lirmm-01083516v1
Asymptotic enumeration of non-crossing partitions on surfaces Dimitrios M. Thilikos,Ignasi Sau,Juanjo Rué Discrete Mathematics, 2013, pp.635-649. ⟨10.1016/j.disc.2012.12.011⟩ Article dans une revue lirmm-00804780v1
Characterizing Graphs of Small Carving-Width Rémy Belmonte,Pim van 'T Hof,Marcin Kamiński,Daniël Paulusma,Dimitrios M. Thilikos Discrete Applied Mathematics, 2013, pp.Electronic Edition. ⟨10.1016/j.dam.2013.02.036⟩ Article dans une revue lirmm-00804730v1
Increasing the minimum degree of a graph by contractions Petr A. Golovach,Marcin J. Kamiński,Daniël Paulusma,Dimitrios M. Thilikos Theoretical Computer Science, 2013, 481, pp.74-84. ⟨10.1016/j.tcs.2013.02.030⟩ Article dans une revue lirmm-00804766v1
Optimizing the Graph Minors Weak Structure Theorem Archontia C. Giannopoulou,Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2013, 27 (3), pp.1209-1227. ⟨10.1137/110857027⟩ Article dans une revue lirmm-00904527v1
Catalan structures and dynamic programming in H-minor-free graphs Frederic Dorn,Fedor V. Fomin,Dimitrios M. Thilikos Journal of Computer and System Sciences, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩ Article dans une revue istex lirmm-00904498v1
On exact algorithms for treewidth Hans L. Bodlaender,Fedor V. Fomin,Aries Koster,Dieter Kratsch,Dimitrios M. Thilikos ACM Transactions on Algorithms, 2012, 9 (1), pp.12:1--12:23. ⟨10.1145/2390176.2390188⟩ Article dans une revue lirmm-00804792v1
D-cores: measuring collaboration of directed graphs based on degeneracy Christos Giatsidis,Dimitrios M. Thilikos,Michalis Vazirgiannis Knowledge and Information Systems (KAIS), 2012, 35 (2), pp.311 - 343. ⟨10.1007/s10115-012-0539-0⟩ Article dans une revue lirmm-00846768v1
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth Dimitrios M. Thilikos,Archontia C. Giannopoulou,Paul Hunter Discrete Applied Mathematics, 2012, pp.2089-2097. ⟨10.1016/j.dam.2012.03.015⟩ Article dans une revue lirmm-00804777v1
Fast Minor Testing in Planar Graphs Isolde Adler,Frederic Dorn,Fedor V. Fomin,Ignasi Sau,Dimitrios M. Thilikos Algorithmica, 2012, 64 (1), pp.69-84. ⟨10.1007/s00453-011-9563-9⟩ Article dans une revue istex lirmm-00904515v1
Connected Graph Searching Lali Barrière,Paola Flocchini,Fedor V. Fomin,Pierre Fraigniaud,Nicolas Nisseet al. Information and Computation, 2012, 219, pp.1-16. ⟨10.1016/j.ic.2012.08.004⟩ Article dans une revue hal-00741948v1
On self-duality of branchwidth in graphs of bounded genus Ignasi Sau,Dimitrios M. Thilikos Discrete Applied Mathematics, 2011, 159 (17), pp.2184-2186. ⟨10.1016/j.dam.2011.06.028⟩ Article dans une revue istex lirmm-00736520v1
Faster parameterized algorithms for minor containment Isolde Adler,Frederic Dorn,Fedor V. Fomin,Ignasi Sau,Dimitrios M. Thilikos Theoretical Computer Science, 2011, 412 (50), pp.7018-7028. ⟨10.1016/j.tcs.2011.09.015⟩ Article dans une revue istex lirmm-00736522v1
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs Ignasi Sau,Dimitrios M. Thilikos Journal of Discrete Algorithms, 2010, 8 (3), pp.330-338. ⟨10.1016/j.jda.2010.02.002⟩ Article dans une revue istex lirmm-00736490v1

Communication dans un congrès (75)

Approximating Branchwidth on Parametric Extensions of Planarity Dimitrios M. Thilikos,Sebastian Wiederrecht WG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.460-474, ⟨10.1007/978-3-031-75409-8_32⟩ Communication dans un congrès hal-04986133v1
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes Ignasi Sau,Giannos Stamoulis,Dimitrios M. Thilikos SODA 2025 - 36th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, United States. pp.403-445, ⟨10.1137/1.9781611978322.12⟩ Communication dans un congrès lirmm-04918933v1
Finding irrelevant vertices in linear time on bounded-genus graphs Petr A. Golovach,Stavros Kolliopoulos,Giannos Stamoulis,Dimitrios M. Thilikos SODA 2025 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, Louisiana, United States. pp.3762-3774, ⟨10.1137/1.9781611978322.126⟩ Communication dans un congrès hal-04986101v1
Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion Laure Morelle,Ignasi Sau,Dimitrios M Thilikos ESA 2025 - 33rd Annual European Symposium on Algorithms, Sep 2025, Warsaw, Poland. pp.7:1-7:18, ⟨10.4230/LIPIcs.ESA.2025.7⟩ Communication dans un congrès lirmm-05562588v1
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes Nicole Schirrmacher,Sebastian Siebertz,Giannos Stamoulis,Dimitrios Thilikos,Alexandre Vigny LICS 2024 - 39th ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-12, ⟨10.1145/3661814.3662089⟩ Communication dans un congrès hal-04625781v1
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional Filippos Christodoulou,Andrea Marino,Ana Silva,Pierluigi Crescenzi,Dimitrios M. Thilikos IWOCA 2024 - 35th International Workshop on Combinatorial Algorithms, Jul 2024, Ischia, Italy. pp.247-258, ⟨10.1007/978-3-031-63021-7_19⟩ Communication dans un congrès lirmm-04702099v1
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces Christophe Paul,Evangelos Protopapas,Dimitrios M. Thilikos,Sebastian Wiederrecht ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallin, Estonia. pp.114:1-114:19, ⟨10.4230/LIPIcs.ICALP.2024.114⟩ Communication dans un congrès lirmm-04702132v1
Obstructions to Erdős-Pósa Dualities for Minors Christophe Paul,Evangelos Protopapas,Dimitrios M. Thilikos,Sebastian Wiederrecht FOCS 2024 - IEEE 65th Annual Symposium on Foundations of Computer Science, Oct 2024, Chicago, United States. pp.31-52, ⟨10.1109/FOCS61266.2024.00013⟩ Communication dans un congrès lirmm-04825442v1
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
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 - 34th 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
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.61:1-61:21, ⟨10.4230/LIPIcs.ICALP.2023.61⟩ Communication dans un congrès lirmm-04253801v1
Excluding Single-Crossing Matching Minors in Bipartite Graphs Archontia Giannopoulou,Dimitrios M. Thilikos,Sebastian Wiederrecht SODA 2023 - 34th 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
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
Kernelization for Graph Packing Problems via Rainbow Matching Stéphane Bessy,Marin Bougeret,Dimitrios M. Thilikos,Sebastian Wiederrecht SODA 2023 - 34th 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
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
Hcore-Init: Neural Network Initialization based on Graph Degeneracy Stratis Limnios,George Dasoulas,Dimitrios M. Thilikos,Michalis Vazirgiannis ICPR 2020 - 25th International Conference on Pattern Recognition, Jan 2021, Milan (Virtual), Italy. pp.5852-5858, ⟨10.1109/ICPR48806.2021.9412940⟩ Communication dans un congrès hal-03002744v2
A Constant-Factor Approximation for Weighted Bond Cover Eun Jung Kim,Euiwoong Lee,Dimitrios M. Thilikos APPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Aug 2021, Seattle, United States. pp.7:1--7:14, ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩ Communication dans un congrès hal-03390188v1
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
Hitting topological minor models in planar graphs is fixed parameter tractable Petr A. Golovach,Giannos Stamoulis,Dimitrios M. Thilikos SODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩ Communication dans un congrès hal-03003167v1
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 SODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩ Communication dans un congrès lirmm-02991215v1
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes Ignasi Sau,Giannos Stamoulis,Dimitrios M. Thilikos ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.95:1-95:20, ⟨10.4230/LIPIcs.ICALP.2020.95⟩ Communication dans un congrès lirmm-02991704v1
A linear fixed parameter tractable algorithm for connected pathwidth Mamadou Moustapha Kanté,Christophe Paul,Dimitrios M. Thilikos ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩ Communication dans un congrès hal-03002761v1
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fedor V. Fomin,Petr A. Golovach,Giannos Stamoulis,Dimitrios M. Thilikos ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Pisa, Italy. pp.51:1-51:17, ⟨10.4230/LIPIcs.ESA.2020.51⟩ Communication dans un congrès hal-03002709v1
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth Julien Baste,Ignasi Sau,Dimitrios M. Thilikos IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩ Communication dans un congrès lirmm-02342806v1
Connected Search for a Lazy Robber Isolde Adler,Christophe Paul,Dimitrios M. Thilikos FSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩ Communication dans un congrès hal-03003243v1
Minimum Reload Cost Graph Factors Julien Baste,Didem Gözüpek,Mordechai Shalom,Dimitrios M. Thilikos SOFSEM 2019 - 45th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2019, Nový Smokovec, Slovakia. pp.67-80, ⟨10.1007/978-3-030-10801-4_7⟩ Communication dans un congrès lirmm-02342817v1
Clustering to Given Connectivities Petr A. Golovach,Dimitrios M. Thilikos IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.18:1-18:17, ⟨10.4230/LIPIcs.IPEC.2019.18⟩ Communication dans un congrès hal-03003256v1
Modification to Planarity is Fixed Parameter Tractable Fedor V. Fomin,Petr A. Golovach,Dimitrios M. Thilikos STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17, ⟨10.4230/LIPIcs.STACS.2019.28⟩ Communication dans un congrès lirmm-02342768v1
Lean Tree-Cut Decompositions: Obstructions and Algorithms Archontia C. Giannopoulou,O-Joung Kwon,Jean-Florent Raymond,Dimitrios M. Thilikos STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩ Communication dans un congrès lirmm-02342775v1
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth Julien Baste,Ignasi Sau,Dimitrios M. Thilikos IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩ Communication dans un congrès hal-01733845v1
Contraction-Bidimensionality of Geometric Intersection Graphs Julien Baste,Dimitrios M. Thilikos IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩ Communication dans un congrès lirmm-01890527v1
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma Ioannis Giotis,Lefteris Kirousis,John Livieratos,Kostas I Psaromiligkos,Dimitrios M. Thilikos International Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom), Jun 2018, Athens, Greece. pp.148-155 Communication dans un congrès lirmm-01890510v1
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Julien Baste,Didem Gözüpek,Ignasi Sau,Mordechai Shalom,Dimitrios M. Thilikos IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩ Communication dans un congrès hal-01733767v1
Data-Compression for Parametrized Counting Problems on Sparse Graphs Eun Jung Kim,Maria Serna,Dimitrios M. Thilikos 29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩ Communication dans un congrès lirmm-02342803v1
Partial complementation of graphs Fedor V. Fomin,Petr A. Golovach,Torstein J F Strømme,Dimitrios M. Thilikos SWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13, ⟨10.4230/LIPIcs.SWAT.2018.21⟩ Communication dans un congrès lirmm-01890534v1
Cutwidth: obstructions and algorithmic aspects Archontia C. Giannopoulou,Michał Pilipczuk,Jean-Florent Raymond,Dimitrios M. Thilikos,Marcin Wrochna IPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩ Communication dans un congrès lirmm-01370305v1
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Archontia C. Giannopoulou,Michal Pilipczuk,Jean-Florent Raymond,Dimitrios M. Thilikos,Marcin Wrochna ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩ Communication dans un congrès lirmm-01610076v1
Structured Connectivity Augmentation Fedor V. Fomin,Petr A. Golovach,Dimitrios M. Thilikos MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13, ⟨10.4230/LIPIcs.MFCS.2017.29⟩ Communication dans un congrès lirmm-01890542v1
An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$ Dimitris Chatzidimitriou,Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩ Communication dans un congrès hal-01218496v1
FPT Algorithms for Plane Completion Problems Dimitris Chatzidimitriou,Archontia C. Giannopoulou,Spyridon Maniatis,Clément Requilé,Dimitrios M. Thilikoset al. MFCS: Mathematical Foundations of Computer Science, Aug 2016, Kraków, Poland. pp.26:1-26:13, ⟨10.4230/LIPIcs.MFCS.2016.26⟩ Communication dans un congrès lirmm-01370324v1
Packing and Covering Immersion Models of Planar subcubic Graphs Archontia C. Giannopoulou,O-Joung Kwon,Jean-Florent Raymond,Dimitrios M. Thilikos WG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩ Communication dans un congrès lirmm-01370310v2
An FPT 2-Approximation for Tree-cut Decomposition Eun Jung Kim,Sang-Il Oum,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩ Communication dans un congrès lirmm-01264015v1
Variants of Plane Diameter Completion Clément Requilé,Dimitrios M. Thilikos,Petr A. Golovach IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩ Communication dans un congrès lirmm-01225566v1
An alternative proof for the constructive Asymmetric Lovász Local Lemma Ioannis Giotis,Lefteris Kirousis,Kostas I. Psaromiligkos,Dimitrios M. Thilikos CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey Communication dans un congrès lirmm-01370328v1
Editing to a Planar Graph of Given Degrees Konrad K. Dabrowski,Petr A. Golovach,Pim Van'T Hof,Daniël Paulusma,Dimitrios M. Thilikos CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156, ⟨10.1007/978-3-319-20297-6_10⟩ Communication dans un congrès lirmm-01225602v1
A Fixed Parameter Algorithm for Plane Subgraph Completion Dimitris Chatzidimitriou,Archontia C. Giannopoulou,Clément Requilé,Dimitrios M. Thilikos,Dimitris Zoros CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey Communication dans un congrès lirmm-01370331v1
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Eun Jung Kim,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩ Communication dans un congrès lirmm-01263999v1
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring Ioannis Giotis,Lefteris Kirousis,Kostas I. Psaromiligkos,Dimitrios M. Thilikos ANALCO: Analytic Algorithmics and Combinatorics, Jan 2015, San Diego, California, United States. ⟨10.1137/1.9781611973761.2⟩ Communication dans un congrès lirmm-01225505v1
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement Nathann Cohen,Daniel Gonçalves,Eun Jung Kim,Christophe Paul,Ignasi Sauet al. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩ Communication dans un congrès hal-01178222v1
Algorithms and Combinatorics on the Erdős–Pósa property Dimitrios M. Thilikos AGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia Communication dans un congrès lirmm-01483655v1
Minimal Disconnected Cuts in Planar Graphs Marcin J. Kaminski,Daniël Paulusma,Stewart Anthony,Dimitrios M. Thilikos FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254, ⟨10.1007/978-3-319-22177-9_19⟩ Communication dans un congrès lirmm-01225549v1
Bidimensionality and Parameterized Algorithms Dimitrios M. Thilikos IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16, ⟨10.4230/LIPIcs.IPEC.2015.1⟩ Communication dans un congrès lirmm-01370293v1
Quantifying trust dynamics in signed graphs, the S-Cores approach Christos Giatsidis,Bogdan Cautis,Silviu Maniu,Michalis Vazirgiannis,Dimitrios M. Thilikos SDM 2014 - 14th SIAM International Conference on Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩ Communication dans un congrès lirmm-01083529v1
CORECLUSTER: A Degeneracy Based Graph Clustering Framework Christos Giatsidis,Fragkiskos Malliaros,Dimitrios M. Thilikos,Michalis Vazirgiannis IAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada Communication dans un congrès lirmm-01083536v1
The Parameterized Complexity of Graph Cyclability Petr A. Golovach,Marcin Kamiski,Spyridon Maniatis,Dimitrios M. Thilikos ESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩ Communication dans un congrès hal-01083993v1
Bidimensionality of Geometric Intersection Graphs Alexander Grigoriev,Athanassios Koutsonas,Dimitrios M. Thilikos SOFSEM: Theory and Practice of Computer Science, Jan 2014, Špindlerův Mlýn, Czech Republic. pp.293-305, ⟨10.1007/978-3-319-04298-5_26⟩ Communication dans un congrès lirmm-00904537v1
Contraction Obstructions for Connected Graph Searching Best Micah J,Arvind Gupta,Dimitrios M. Thilikos,Dimitris Zoros ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01083704v1
Covering and packing pumpkin models Dimitris Chatzidimitriou,Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01083652v1
Geometric Extensions of Cutwidth in any Dimension Menelaos Karavelas,Dimitris Zoros,Spyridon Maniatis,Dimitrios M. Thilikos ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01083698v1
Structure of W_4 -immersion free graphs Rémy Belmonte,Archontia C. Giannopoulou,Daniel Lokshtanov,Dimitrios M. Thilikos ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès hal-01084005v1
Explicit linear kernels via dynamic programming Valentin Garnero,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos STACS 2014 - 31st International Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩ Communication dans un congrès hal-01084007v1
An edge variant of the Erdős-Pósa property Jean-Florent Raymond,Ignasi Sau,Dimitrios M. Thilikos ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-00904544v1
Evaluating Cooperation in coauthorship graphs with degeneracy Christos Giatsidis,Michalis Vazirgiannis,Dimitrios M. Thilikos BDA: Bases de Données Avancées, Oct 2013, Nantes, France Communication dans un congrès lirmm-00904582v1
Polynomial Gap Extensions of the Erdős-Pósa Theorem Jean-Florent Raymond,Dimitrios M. Thilikos EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩ Communication dans un congrès lirmm-01083659v1
Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou,Marcin Kamiński,Dimitrios M. Thilikos WG 2013 - 39th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩ Communication dans un congrès lirmm-01483644v1
Theory and Applications of Bidimensionality Dimitrios M. Thilikos COCOA: Conference on Combinatorial Optimization and Applications, Dec 2013, Chengdu, China. ⟨10.1007/978-3-319-03780-6⟩ Communication dans un congrès lirmm-01483650v1
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs Fedor V. Fomin,Daniel Lokshtanov,Saket Saurabh,Dimitrios M. Thilikos STACS: Symposium on Theoretical Aspects of Computer Science, Feb 2013, Kiel, Germany. pp.92-103, ⟨10.4230/LIPIcs.STACS.2013.92⟩ Communication dans un congrès lirmm-00804758v1
A linear kernel for planar red-blue dominating set Valentin Garnero,Ignasi Sau,Dimitrios M. Thilikos CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120 Communication dans un congrès lirmm-00846771v1
Contraction checking in graphs on surfaces Marcin Kaminski,Dimitrios M. Thilikos STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193 Communication dans un congrès hal-00678173v1
Dynamic Programming for $H$-minor-free Graphs Juanjo Rué,Ignasi Sau,Dimitrios M. Thilikos COCOON: Computing and Combinatorics Conference, Aug 2012, Sydney, NSW, Australia. pp.86-97, ⟨10.1007/978-3-642-32241-9_8⟩ Communication dans un congrès lirmm-00736708v1
Fast Minor Testing in Planar Graphs Isolde Adler,Frederic Dorn,Fedor V. Fomin,Ignasi Sau,Dimitrios M. Thilikos ESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩ Communication dans un congrès lirmm-00736769v1
Dynamic programming for graphs on surfaces Juanjo Rué,Ignasi Sau,Dimitrios M. Thilikos ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383 Communication dans un congrès lirmm-00736703v1
On Self-Duality of Branchwidth in Graphs of Bounded Genus Dimitrios M. Thilikos 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2009, Paris, France. pp.19-22 Communication dans un congrès hal-00795413v1
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs Dimitrios M. Thilikos DIMAP workshop on Algorithmic Graph Theory (AGT09), 2009, Warwick, United Kingdom. pp.59-66 Communication dans un congrès hal-00795284v1
Approximating Acyclicity Parameters of Sparse Hypergraphs Fedor V. Fomin,Petr A. Golovach,Dimitrios M. Thilikos 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.445-456 Communication dans un congrès inria-00359709v1

Ouvrages (7)

Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers Ignasi Sau,Dimitrios M. Thilikos LNCS (11789), 2019, 978-3-030-30785-1. ⟨10.1007/978-3-030-30786-8⟩ Ouvrages lirmm-02342784v1
6th Workshop on Graph Classes, Width Parameters and Optimization (GROW 2013) Dimitrios M. Thilikos , pp.1-20, 2013 Ouvrages lirmm-00904565v1
NII Shonan Meeting on: Parameterized Complexity and the Understanding, Design and Analysis of Heuristics Gregory Gutin,Kazuo Iwama,Dimitrios M. Thilikos , pp.1-13, 2013 Ouvrages lirmm-00904562v1
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Erik D. Demaine,Fedor V. Fomin,Mohammadtaghi Hajiaghayi,Dimitrios M. Thilikos Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 3(3), pp.51-74, 2013, ⟨10.4230/DagRep.3.3.51⟩ Ouvrages lirmm-00904522v1
Foreword: Special Issue on Theory and Applications of Graph Searching Problems Dimitrios M. Thilikos,Pierre Fraigniaud,Fedor V. Fomin,Stephan Kreutzer Springer, 463, 2012, Theoretical Computer Science, ⟨10.1016/j.tcs.2012.10.006⟩ Ouvrages lirmm-00804772v1
Parameterized and Exact Computation 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings Gerhard J. Woeginger,Dimitrios M. Thilikos Dimitrios M. Thilikos; Gerhard J. Woeginger. Springer, 7535, 2012, LNCS, 978-3-642-33292-0. ⟨10.1007/978-3-642-33293-7⟩ Ouvrages lirmm-00904549v1
5th Workshop on GRAph Searching, Theory and Applications (GRASTA 2012) Fedor V. Fomin,Richard J. Nowakowski,Pawel Pralat,Dimitrios M. Thilikos , pp.1-12, 2012 Ouvrages lirmm-00904556v1

Chapitre d'ouvrage (7)

Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs Fedor Fomin,Petr Golovach,Dimitrios M. Thilikos Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_24⟩ Chapitre d'ouvrage hal-03390090v1
Block Elimination Distance Öznur Yaşar Diner,Archontia Giannopoulou,Giannos Stamoulis,Dimitrios M. Thilikos Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.28-38, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_3⟩ Chapitre d'ouvrage hal-03389973v1
A Retrospective on (Meta) Kernelization Dimitrios M. Thilikos Treewidth, Kernels, and Algorithms, 12160, pp.222-246, 2020, Lecture Notes in Computer Science, 978-3-030-42070-3. ⟨10.1007/978-3-030-42071-0_16⟩ Chapitre d'ouvrage hal-03002701v1
An Alternate Proof of the Algorithmic Lovász Local Lemma Ioannis Giotis,Lefteris Kirousis,Kostas I. Psaromiligkos,Dimitrios M. Thilikos Extended Abstracts Summer 2015, 6, pp.61-65, 2017, Trends in Mathematics, 978-3-319-51752-0. ⟨10.1007/978-3-319-51753-7_10⟩ Chapitre d'ouvrage lirmm-01692634v1
Bidimensionality Fedor V. Fomin,Erik D. Demaine,Mohammed Taghi Hajiaghayi,Dimitrios M. Thilikos Encyclopedia of Algorithms, Springer, pp.203-207, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_47⟩ Chapitre d'ouvrage lirmm-01483707v1
Branchwidth of Graphs Dimitrios M. Thilikos,Fedor V. Fomin Encyclopedia of Algorithms, pp.232-237, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_55⟩ Chapitre d'ouvrage lirmm-01483694v1
Graph Minors and Parameterized Algorithm Design Dimitrios M. Thilikos The Multivariate Algorithmic Revolution and Beyond, LNCS (7370), pp.228-256, 2012, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday - Part II, 978-3-642-30890-1. ⟨10.1007/978-3-642-30891-8_13⟩ Chapitre d'ouvrage lirmm-01083542v1

Autre publication scientifique (1)

Report on NII Shonan Meeting 2013-018 Gregory Gutin,Dimitrios M. Thilikos 2014, News and Conference Reports Autre publication scientifique lirmm-01084332v1

Pré-publication, Document de travail (7)

Universal Obstructions of Graph Parameters Christophe Paul,Evangelos Protopapas,Dimitrios M. Thilikos 2023 Pré-publication, Document de travail (preprint/prepublication) lirmm-04292504v1
The mixed search game against an agile and visible fugitive is monotone Guillaume Mescoff,Christophe Paul,Dimitrios M. Thilikos 2022 Pré-publication, Document de travail (preprint/prepublication) lirmm-03867231v1
Edge-trewidth: Algorithmic and combinatorial properties Loïc Magne,Christophe Paul,Abhijat Sharma,Dimitrios M. Thilikos 2021 Pré-publication, Document de travail (preprint/prepublication) lirmm-03867242v1
Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou,Marcin Kaminski,Dimitrios M. Thilikos 2013 Pré-publication, Document de travail lirmm-00805139v1
Nearly Planar Graphs and {\lambda}-flat Graphs Alexander Grigoriev,Athanassios Koutsonas,Dimitrios M. Thilikos 2013 Pré-publication, Document de travail lirmm-00904543v1
Irrelevant Vertices for the Planar Disjoint Paths Problem Isolde Adler,Stavros G. Kolliopoulos,Philipp Klaus Krause,Daniel Lokshtanov,Saket Saurabhhet al. 2013 Pré-publication, Document de travail lirmm-00904538v1
(Meta) Kernelization Hans L. Bodlaender,Fedor V. Fomin,Daniel Lokshtanov,Eelko Penninkx,Saket Saurabhet al. 2013 Pré-publication, Document de travail lirmm-00904532v1

Rapport (7)

Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017 Spyros Angelopoulos,Pierre Fraigniaud,Fedor V. Fomin,Nicolas Nisse,Dimitrios M. Thilikos [Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017 Rapport (rapport de recherche) lirmm-01645614v1
An alternative proof for the constructive Asymmetric Lovász Local Lemma Ioannis Giotis,Lefteris Kirousis,Kostas I. Psaromiligkos,Dimitrios M. Thilikos [Research Report] LIRMM. 2015 Rapport (rapport de recherche) lirmm-01225560v1
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Eun Jung Kim,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos [Research Report] LIRMM. 2015 Rapport (rapport de recherche) lirmm-01225570v1
An FPT 2-Approximation for Tree-Cut Decomposition Eunjung Kim,Sang-Il Oum,Christophe Paul,Ignasi Sau,Dimitrios M. Thilikos [Research Report] LIRMM. 2015 Rapport (rapport de recherche) lirmm-01225569v1
Report on GRASTA 2014 Fedor V. Fomin,Pierre Fraigniaud,Nicolas Nisse,Dimitrios M. Thilikos [Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014 Rapport (rapport de recherche) hal-01084230v1
Connected Graph Searching Lali Barrière,Paola Flocchini,Fedor V. Fomin,Pierre Fraigniaud,Nicolas Nisseet al. [Research Report] RR-7363, INRIA. 2010 Rapport (rapport de recherche) inria-00508888v1
Dynamic Programming for Graphs on Surfaces Juanjo Rué,Ignasi Sau,Dimitrios M. Thilikos [Research Report] RR-7166, INRIA. 2009, pp.39 Rapport (rapport de recherche) inria-00443582v1