Accéder directement au contenu

Dimitrios Thilikos

13
Documents

Présentation

Publications

baste
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

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

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

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

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

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

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

Julien Baste , Didem Gözüpek , Christophe Paul , Ignasi Sau , Mordechai Shalom
Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩
Article dans une revue lirmm-02989889v1
Image document

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

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

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

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

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

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