- 21
- 12
- 4
- 4
- 4
Dimitrios Thilikos
45
Documents
Présentation
Publications
- 16
- 16
- 16
- 9
- 7
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 45
- 12
- 9
- 7
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 38
- 20
- 6
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 6
- 2
- 3
- 6
- 1
- 7
- 4
- 2
- 2
- 2
- 3
- 1
- 14
- 11
- 6
- 6
- 1
|
Faster parameterized algorithms for modification problems to minor-closed classesICALP 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
|
|
Compound Logics for Modification ProblemsICALP 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
|
|
Dynamic programming on bipartite tree decompositionsIPEC 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
|
|
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph ClassesICALP 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 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
|
|
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
|
|
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
|
An FPT 2-Approximation for Tree-cut DecompositionWAOA 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
|
|
|
An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$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
|
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph HomomorphismIPEC 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 ImprovementCSR: 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
|
|
|
Explicit linear kernels via dynamic programmingSTACS: 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 propertyICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-00904544v1
|
|
|
Covering and packing pumpkin modelsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01083652v1
|
|
A linear kernel for planar red-blue dominating setCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120
Communication dans un congrès
lirmm-00846771v1
|
|
Dynamic Programming for $H$-minor-free GraphsCOCOON: 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 GraphsESA 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 surfacesICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383
Communication dans un congrès
lirmm-00736703v1
|
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised PapersLNCS (11789), 2019, 978-3-030-30785-1. ⟨10.1007/978-3-030-30786-8⟩
Ouvrages
lirmm-02342784v1
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism[Research Report] LIRMM. 2015
Rapport
lirmm-01225570v1
|
|
An FPT 2-Approximation for Tree-Cut Decomposition[Research Report] LIRMM. 2015
Rapport
lirmm-01225569v1
|
|
|
Dynamic Programming for Graphs on Surfaces[Research Report] RR-7166, INRIA. 2009, pp.39
Rapport
inria-00443582v1
|