- 14
- 11
- 10
- 7
- 3
- 3
- 2
- 1
Dimitrios Thilikos
51
Documents
Présentation
Publications
- 13
- 11
- 9
- 8
- 8
- 7
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 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
- 14
- 11
- 10
- 9
- 9
- 7
- 4
- 3
- 3
- 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
- 51
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 11
- 7
- 10
- 16
- 3
- 4
- 51
- 45
- 22
- 8
- 2
- 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
|
|
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph ClassesSODA 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
|
Excluding Single-Crossing Matching Minors in Bipartite GraphsSODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.2111-2121, ⟨10.1137/1.9781611977554.ch81⟩
Communication dans un congrès
hal-04042983v1
|
|
|
Kernelization for Graph Packing Problems via Rainbow MatchingSODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩
Communication dans un congrès
hal-04042995v1
|
|
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
|
|
Killing a vortexFOCS 2022 - 63rd IEEE Annual Symposium on Foundations of Computer Science, Oct 2022, Denver, United States. pp.1069-1080, ⟨10.1109/FOCS54457.2022.00104⟩
Communication dans un congrès
hal-04043027v1
|
|
Hcore-Init: Neural Network Initialization based on Graph DegeneracyICPR 2020 - 25th International Conference on Pattern Recognition, Jan 2021, Milan (Virtual), Italy. pp.5852-5858, ⟨10.1109/ICPR48806.2021.9412940⟩
Communication dans un congrès
hal-03002744v2
|
Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesLICS 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 tractableSODA 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 FOLESA 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
|
|
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 linear fixed parameter tractable algorithm for connected pathwidthESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩
Communication dans un congrès
hal-03002761v1
|
|
Connected Search for a Lazy RobberFSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩
Communication dans un congrès
hal-03003243v1
|
|
Minimum Reload Cost Graph FactorsSOFSEM 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
|
|
Clustering to Given ConnectivitiesIPEC 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
|
|
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
|
|
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemmaInternational Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom), Jun 2018, Athens, Greece. pp.148-155
Communication dans un congrès
lirmm-01890510v1
|
|
Data-Compression for Parametrized Counting Problems on Sparse Graphs29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩
Communication dans un congrès
lirmm-02342803v1
|
|
Block Elimination DistanceGraph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.28-38, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_3⟩
Chapitre d'ouvrage
hal-03389973v1
|
|
A Retrospective on (Meta) KernelizationTreewidth, Kernels, and Algorithms, 12160, pp.222-246, 2020, Lecture Notes in Computer Science, 978-3-030-42070-3. ⟨10.1007/978-3-030-42071-0_16⟩
Chapitre d'ouvrage
hal-03002701v1
|
Edge-trewidth: Algorithmic and combinatorial properties2021
Pré-publication, Document de travail
lirmm-03867242v1
|