Documentation
Français (FR)

Anglais (EN)

Dimitrios Thilikos

24

Documents

Présentation

Publications

1082126

	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
	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
	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
	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
	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
	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
	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
	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
	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
	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

	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
	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 Annual 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
	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
	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
	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
	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
	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
	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
	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
	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

	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