Dimitrios Thilikos
Présentation
Publications
Publications
Approximating Branchwidth on Parametric Extensions of PlanarityWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.460-474, ⟨10.1007/978-3-031-75409-8_32⟩ |
|
|
|
Parameterizing the quantification of CMSO: model checking on minor-closed graph classesSODA 2025 - 36th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, United States. pp.403-445, ⟨10.1137/1.9781611978322.12⟩ |
Finding irrelevant vertices in linear time on bounded-genus graphsSODA 2025 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, Louisiana, United States. pp.3762-3774, ⟨10.1137/1.9781611978322.126⟩ |
|
|
|
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph ClassesLICS 2024 - 39th ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-12, ⟨10.1145/3661814.3662089⟩ |
|
|
Making the Interval Membership Width of Temporal Graphs Connected and BidirectionalIWOCA 2024 - 35th International Workshop on Combinatorial Algorithms, Jul 2024, Ischia, Italy. pp.247-258, ⟨10.1007/978-3-031-63021-7_19⟩ |
|
|
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of SurfacesICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallin, Estonia. pp.114:1-114:19, ⟨10.4230/LIPIcs.ICALP.2024.114⟩ |
|
|
Obstructions to Erdős-Pósa Dualities for MinorsFOCS 2024 - IEEE 65th Annual Symposium on Foundations of Computer Science, Oct 2024, Chicago, United States. pp.31-52, ⟨10.1109/FOCS61266.2024.00013⟩ |
|
|
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⟩ |
|
|
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph ClassesSODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3684-3699, ⟨10.1137/1.9781611977554.ch141⟩ |
|
|
Compound Logics for Modification ProblemsICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.61:1-61:21, ⟨10.4230/LIPIcs.ICALP.2023.61⟩ |
|
|
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⟩ |
|
|
Excluding Single-Crossing Matching Minors in Bipartite GraphsSODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.2111-2121, ⟨10.1137/1.9781611977554.ch81⟩ |
|
|
Kernelization for Graph Packing Problems via Rainbow MatchingSODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
A Constant-Factor Approximation for Weighted Bond CoverAPPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Aug 2021, Seattle, United States. pp.7:1--7:14, ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩ |
|
|
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⟩ |
|
|
Hitting topological minor models in planar graphs is fixed parameter tractableSODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩ |
|
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundarySODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Modification to Planarity is Fixed Parameter TractableSTACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17, ⟨10.4230/LIPIcs.STACS.2019.28⟩ |
|
|
Lean Tree-Cut Decompositions: Obstructions and AlgorithmsSTACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩ |
|
|
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⟩ |
|
|
Contraction-Bidimensionality of Geometric Intersection GraphsIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩ |
|
|
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 |
|
|
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⟩ |
|
|
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⟩ |
|
|
Partial complementation of graphsSWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13, ⟨10.4230/LIPIcs.SWAT.2018.21⟩ |
|
|
Cutwidth: obstructions and algorithmic aspectsIPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩ |
|
|
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩ |
|
|
Structured Connectivity AugmentationMFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13, ⟨10.4230/LIPIcs.MFCS.2017.29⟩ |
|
|
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⟩ |
|
|
FPT Algorithms for Plane Completion ProblemsMFCS: Mathematical Foundations of Computer Science, Aug 2016, Kraków, Poland. pp.26:1-26:13, ⟨10.4230/LIPIcs.MFCS.2016.26⟩ |
|
|
Packing and Covering Immersion Models of Planar subcubic GraphsWG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩ |
|
|
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⟩ |
|
|
Editing to a Planar Graph of Given DegreesCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156, ⟨10.1007/978-3-319-20297-6_10⟩ |
|
|
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⟩ |
|
|
A Fixed Parameter Algorithm for Plane Subgraph CompletionCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey |
|
|
Variants of Plane Diameter CompletionIPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩ |
|
|
An alternative proof for the constructive Asymmetric Lovász Local LemmaCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey |
|
|
On the Algorithmic Lovász Local Lemma and Acyclic Edge ColoringANALCO: Analytic Algorithmics and Combinatorics, Jan 2015, San Diego, California, United States. ⟨10.1137/1.9781611973761.2⟩ |
|
|
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⟩ |
|
|
Algorithms and Combinatorics on the Erdős–Pósa propertyAGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia |
|
|
Minimal Disconnected Cuts in Planar GraphsFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254, ⟨10.1007/978-3-319-22177-9_19⟩ |
|
|
Bidimensionality and Parameterized AlgorithmsIPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16, ⟨10.4230/LIPIcs.IPEC.2015.1⟩ |
|
|
Quantifying trust dynamics in signed graphs, the S-Cores approachSDM 2014 - 14th SIAM International Conference on Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩ |
|
|
CORECLUSTER: A Degeneracy Based Graph Clustering FrameworkIAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada |
|
|
The Parameterized Complexity of Graph CyclabilityESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩ |
|
|
Bidimensionality of Geometric Intersection GraphsSOFSEM: Theory and Practice of Computer Science, Jan 2014, Špindlerův Mlýn, Czech Republic. pp.293-305, ⟨10.1007/978-3-319-04298-5_26⟩ |
|
|
Contraction Obstructions for Connected Graph SearchingICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France |
|
|
Geometric Extensions of Cutwidth in any DimensionICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France |
|
|
Covering and packing pumpkin modelsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France |
|
|
Structure of W_4 -immersion free graphsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France |
|
|
Explicit linear kernels via dynamic programmingSTACS 2014 - 31st International Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩ |
|
|
An edge variant of the Erdős-Pósa propertyICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France |
Evaluating Cooperation in coauthorship graphs with degeneracyBDA: Bases de Données Avancées, Oct 2013, Nantes, France |
|
|
|
Polynomial Gap Extensions of the Erdős-Pósa TheoremEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩ |
|
|
Excluding Graphs as Immersions in Surface Embedded GraphsWG 2013 - 39th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩ |
|
|
Theory and Applications of BidimensionalityCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2013, Chengdu, China. ⟨10.1007/978-3-319-03780-6⟩ |
|
|
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphsSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 2013, Kiel, Germany. pp.92-103, ⟨10.4230/LIPIcs.STACS.2013.92⟩ |
|
|
A linear kernel for planar red-blue dominating setCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120 |
|
|
Contraction checking in graphs on surfacesSTACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193 |
|
|
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⟩ |
|
|
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⟩ |
Dynamic programming for graphs on surfacesICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383 |
|
On Self-Duality of Branchwidth in Graphs of Bounded Genus8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2009, Paris, France. pp.19-22 |
|
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar GraphsDIMAP workshop on Algorithmic Graph Theory (AGT09), 2009, Warwick, United Kingdom. pp.59-66 |
|
|
|
Approximating Acyclicity Parameters of Sparse Hypergraphs26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.445-456 |
|
|
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on GraphsGraph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_24⟩ |
|
|
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⟩ |
|
|
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⟩ |
An Alternate Proof of the Algorithmic Lovász Local LemmaExtended Abstracts Summer 2015, 6, pp.61-65, 2017, Trends in Mathematics, 978-3-319-51752-0. ⟨10.1007/978-3-319-51753-7_10⟩ |
|
BidimensionalityEncyclopedia of Algorithms, Springer, pp.203-207, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_47⟩ |
|
Branchwidth of GraphsEncyclopedia of Algorithms, pp.232-237, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_55⟩ |
|
|
|
Graph Minors and Parameterized Algorithm DesignThe Multivariate Algorithmic Revolution and Beyond, LNCS (7370), pp.228-256, 2012, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday - Part II, 978-3-642-30890-1. ⟨10.1007/978-3-642-30891-8_13⟩ |
|
|
Report on NII Shonan Meeting 2013-0182014, News and Conference Reports |
|
|
Universal Obstructions of Graph Parameters2023 |
|
|
The mixed search game against an agile and visible fugitive is monotone2022 |
|
|
Edge-trewidth: Algorithmic and combinatorial properties2021 |
|
|
Nearly Planar Graphs and {\lambda}-flat Graphs2013 |
|
|
Irrelevant Vertices for the Planar Disjoint Paths Problem2013 |
|
|
Excluding Graphs as Immersions in Surface Embedded Graphs2013 |
|
|
(Meta) Kernelization2013 |
|
|
Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017[Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017 |
|
|
An alternative proof for the constructive Asymmetric Lovász Local Lemma[Research Report] LIRMM. 2015 |
|
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism[Research Report] LIRMM. 2015 |
|
|
An FPT 2-Approximation for Tree-Cut Decomposition[Research Report] LIRMM. 2015 |
|
|
Report on GRASTA 2014[Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014 |
|
|
Connected Graph Searching[Research Report] RR-7363, INRIA. 2010 |
|
|
Dynamic Programming for Graphs on Surfaces[Research Report] RR-7166, INRIA. 2009, pp.39 |