- 7
- 1
- 1
Dimitrios Thilikos
9
Documents
Présentation
Publications
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 9
- 1
- 1
- 1
- 1
- 1
- 9
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 2
- 8
- 6
- 1
- 1
|
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal AlgorithmSIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩
Article dans une revue
lirmm-04171495v1
|
|
Hitting Minors on Bounded Treewidth Graphs. I. General Upper BoundsSIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩
Article dans une revue
lirmm-02989921v1
|
|
Parameterized complexity of finding a spanning tree with minimum reload cost diameterNetworks, 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 algorithmsTheoretical Computer Science, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩
Article dans une revue
lirmm-02989928v1
|
|
Hitting minors on bounded treewidth graphs. III. Lower boundsJournal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩
Article dans une revue
lirmm-02989938v1
|
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundarySODA 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
|
|
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthIPEC 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
|
|
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterIPEC 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
|
|
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthIPEC 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
|