Accéder directement au contenu

Dimitrios Thilikos

45
Documents

Présentation

Publications

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

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

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

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

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

A polynomial-time algorithm for Outerplanar Diameter Improvement

Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau
Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩
Article dans une revue hal-01592242v1
Image document

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

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

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

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

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

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

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

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 lirmm-00904515v1

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 lirmm-00736522v1

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 lirmm-00736520v1

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 lirmm-00736490v1
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

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

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

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

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

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

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

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

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

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement

Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau
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
Image document

Explicit linear kernels via dynamic programming

Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
STACS: 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
Image document

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

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

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

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