Skip to Main content

Keywords

Co-authors

Researcher identifiers

Social networks

    Export Publications

    Export the displayed publications:

    External widget

    Open access quantity

    93 %

    Number of documents

    152

    Publications of Dimitrios Thilikos


    Journal articles65 documents

    • Julien Baste, Dimitrios M. Thilikos. Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica, Springer Verlag, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩. ⟨hal-03541133⟩
    • Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. A polynomial time algorithm to compute the connected treewidth of a series–parallel graph. Discrete Applied Mathematics, Elsevier, 2022, 312, pp.72-85. ⟨10.1016/j.dam.2021.02.039⟩. ⟨lirmm-03676663⟩
    • Dimitrios M. Thilikos. Compactors for parameterized counting problems. Computer Science Review, Elsevier, 2021, 39, pp.100344. ⟨10.1016/j.cosrev.2020.100344⟩. ⟨hal-03093911⟩
    • Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis. Minor obstructions for apex-pseudoforests. Discrete Mathematics, Elsevier, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩. ⟨hal-03327317⟩
    • Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. Minimum Reload Cost Graph Factors. Theory of Computing Systems, Springer Verlag, 2021, 65 (5), pp.815-838. ⟨10.1007/s00224-020-10012-x⟩. ⟨hal-03327294⟩
    • Isolde Adler, Christophe Paul, Dimitrios M. Thilikos. Connected search for a lazy robber. Journal of Graph Theory, Wiley, 2021, 97 (4), pp.510-552. ⟨10.1002/jgt.22669⟩. ⟨hal-03327307⟩
    • Archontia C Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. A Menger-like property of tree-cut width. Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩. ⟨hal-03094586⟩
    • Dimitrios M. Thilikos, Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Marcin Wrochna. Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2021, 35 (1), pp.105-151. ⟨10.1137/18M1228839⟩. ⟨hal-03327286⟩
    • Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau Valls, Mordechai Shalom, et al.. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks, Wiley, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩. ⟨lirmm-02989889⟩
    • Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. Structure and enumeration of $K_4$- minor-free links and link-diagrams. European Journal of Combinatorics, Elsevier, 2020, 89, pp.103147. ⟨10.1016/j.ejc.2020.103147⟩. ⟨hal-03002619⟩
    • Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. Bidimensionality and Kernels. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩. ⟨hal-03094544⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩. ⟨lirmm-02989921⟩
    • Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory of Computing Systems, Springer Verlag, 2020, 64 (2), pp.251-271. ⟨10.1007/s00224-019-09938-8⟩. ⟨hal-03002648⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theoretical Computer Science, Elsevier, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩. ⟨lirmm-02989928⟩
    • Fedor V. Fomin, Petr A. Golovach, Torstein Strømme, Dimitrios M. Thilikos. Subgraph Complementation. Algorithmica, Springer Verlag, 2020, 82 (7), pp.1859-1880. ⟨10.1007/s00453-020-00677-8⟩. ⟨hal-03002656⟩
    • Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros. Sparse obstructions for minor-covering parameters. Discrete Applied Mathematics, Elsevier, 2020, 278, pp.28-50. ⟨10.1016/j.dam.2019.10.021⟩. ⟨hal-03002639⟩
    • Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos. Edge degeneracy: Algorithmic and structural results. Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩. ⟨hal-03001062⟩
    • Fedor Fomin, Petr Golovach, Dimitrios M. Thilikos. Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩. ⟨hal-03389854v2⟩
    • Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, et al.. Minor-obstructions for apex sub-unicyclic graphs. Discrete Applied Mathematics, Elsevier, 2020, 284, pp.538-555. ⟨10.1016/j.dam.2020.04.019⟩. ⟨hal-03002632⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. Hitting minors on bounded treewidth graphs. III. Lower bounds. Journal of Computer and System Sciences, Elsevier, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩. ⟨lirmm-02989938⟩
    • Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Explicit Linear Kernels for Packing Problems. Algorithmica, Springer Verlag, 2019, 81 (4), pp.1615-1656. ⟨10.1007/s00453-018-0495-5⟩. ⟨lirmm-02342736⟩
    • Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica, Springer Verlag, 2019, 81 (2), pp.557-588. ⟨10.1007/s00453-018-0424-7⟩. ⟨hal-01814167⟩
    • Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos. Preface to special issue on Theory and Applications of Graph Searching. Theoretical Computer Science, Elsevier, 2019, 794, pp.1-2. ⟨10.1016/j.tcs.2019.09.043⟩. ⟨lirmm-02342745⟩
    • Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$. Algorithmica, Springer Verlag, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩. ⟨lirmm-01609998⟩
    • Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. Structure and Enumeration of $K4$-minor-free links and link diagrams. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 68, pp.119-124. ⟨10.1016/j.endm.2018.06.021⟩. ⟨lirmm-01890505⟩
    • Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (1), pp.1-31. ⟨10.1145/3155298⟩. ⟨lirmm-01890563⟩
    • Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica, Springer Verlag, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩. ⟨hal-01690385⟩
    • Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. Structured Connectivity Augmentation. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (4), pp.2612-2635. ⟨10.1137/17M1146233⟩. ⟨lirmm-02342799⟩
    • Jean-Florent Raymond, Dimitrios M. Thilikos. Recent techniques and results on the Erdős-Pósa property. Discrete Applied Mathematics, Elsevier, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩. ⟨lirmm-01486771v2⟩
    • Iyad Kanj, Dimitrios M. Thilikos, Ge Xia. On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Information and Computation, Elsevier, 2017, 257 (139-156), ⟨10.1016/j.ic.2017.11.002⟩. ⟨hal-01689398⟩
    • Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Packing and covering immersion-expansions of planar sub-cubic graphs. European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩. ⟨lirmm-01610005v2⟩
    • Konrad K. Dabrowski, Petr A. Golovach, Pim van 'T Hof, Daniël Paulusma, Dimitrios M. Thilikos. Editing to a planar graph of given degrees. Journal of Computer and System Sciences, Elsevier, 2017, 85, pp.168-182. ⟨10.1016/j.jcss.2016.11.009⟩. ⟨hal-01632341⟩
    • Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. Thilikos. The Parameterized Complexity of Graph Cyclability. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (1), pp.511 - 541. ⟨10.1137/141000014⟩. ⟨hal-01632332⟩
    • Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Sciences, Elsevier, 2017, 86, pp.191-206. ⟨10.1016/j.jcss.2017.01.003⟩. ⟨lirmm-01487567⟩
    • Jean-Florent Raymond, Dimitrios M. Thilikos. Low Polynomial Exclusion of Planar Graph Patterns. Journal of Graph Theory, Wiley, 2017, 84 (1), pp.26-44. ⟨10.1002/jgt.22009⟩. ⟨lirmm-01263767⟩
    • Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, et al.. A polynomial-time algorithm for Outerplanar Diameter Improvement. Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩. ⟨hal-01592242⟩
    • Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, et al.. Irrelevant vertices for the planar Disjoint Paths Problem. Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.815-843. ⟨10.1016/j.jctb.2016.10.001⟩. ⟨hal-01632343⟩
    • Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. Minors in graphs of large θr-girth. European Journal of Combinatorics, Elsevier, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩. ⟨hal-01218519v2⟩
    • Valentin Garnero, Ignasi Sau Valls, Dimitrios M. Thilikos. A linear kernel for planar red–blue dominating set. Discrete Applied Mathematics, Elsevier, 2017, 217, pp.536-547. ⟨10.1016/j.dam.2016.09.045⟩. ⟨lirmm-01481785⟩
    • Dimitrios M. Thilikos, Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos. Acyclic edge coloring through the Lovász Local Lemma. Theoretical Computer Science, Elsevier, 2017, 665, pp.40 - 50. ⟨10.1016/j.tcs.2016.12.011⟩. ⟨hal-01632338⟩
    • Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, et al.. (Meta) Kernelization. Journal of the ACM (JACM), Association for Computing Machinery, 2016, 63 (5), pp.#44. ⟨10.1145/2973749⟩. ⟨lirmm-01483628⟩
    • Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. Contraction Obstructions for Connected Graph Searching. Discrete Applied Mathematics, Elsevier, 2016, 209, pp.27-47. ⟨10.1016/j.dam.2015.07.036⟩. ⟨lirmm-01349860⟩
    • Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An edge variant of the Erdős–Pósa property. Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩. ⟨lirmm-01347430v2⟩
    • Marcin Kamiński, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos. Minimal disconnected cuts in planar graphs. Networks, Wiley, 2016, 68 (4), pp.250-259. ⟨10.1002/net.21696⟩. ⟨lirmm-01483626⟩
    • Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos. Forbidding Kuratowski Graphs as Immersions. Journal of Graph Theory, Wiley, 2015, 78 (1), pp.43-60. ⟨10.1002/jgt.21790⟩. ⟨lirmm-00904533⟩
    • Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Explicit Linear Kernels via Dynamic Programming. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.1864-1894. ⟨10.1137/140968975⟩. ⟨lirmm-01263857⟩
    • Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. Planar Disjoint-Paths Completion. Algorithmica, Springer Verlag, 2015, 76 (2), pp.401-425. ⟨10.1007/s00453-015-0046-2⟩. ⟨lirmm-01370272⟩
    • Nestor Nestoridis, Dimitrios M. Thilikos. Square roots of minor closed graph classes. Discrete Applied Mathematics, Elsevier, 2014, 168, pp.34 - 39. ⟨10.1016/j.dam.2013.05.026⟩. ⟨hal-01083980v2⟩
    • Petr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. Thilikos. Lift-contractions. European Journal of Combinatorics, Elsevier, 2014, 35, pp.286-296. ⟨10.1016/j.ejc.2013.06.026⟩. ⟨hal-01083984⟩
    • Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki. Outerplanar obstructions for matroid pathwidth. Discrete Mathematics, Elsevier, 2014, 315, pp.95-101. ⟨10.1016/j.disc.2013.10.007⟩. ⟨lirmm-01225581⟩
    • Juanjo Rué, Ignasi Sau Valls, Dimitrios M. Thilikos. Dynamic Programming for Graphs on Surfaces. ACM Transactions on Algorithms, Association for Computing Machinery, 2014, 10 (2), pp.8. ⟨10.1145/2556952⟩. ⟨lirmm-01083690⟩
    • Rémy Belmonte, Pim van 'T Hof, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos. Characterizing Graphs of Small Carving-Width. Discrete Applied Mathematics, Elsevier, 2013, pp.Electronic Edition. ⟨10.1016/j.dam.2013.02.036⟩. ⟨lirmm-00804730⟩
    • Petr A. Golovach, Marcin J. Kamiński, Daniël Paulusma, Dimitrios M. Thilikos. Increasing the minimum degree of a graph by contractions. Theoretical Computer Science, Elsevier, 2013, 481, pp.74-84. ⟨10.1016/j.tcs.2013.02.030⟩. ⟨lirmm-00804766⟩
    • Archontia C. Giannopoulou, Dimitrios M. Thilikos. Optimizing the Graph Minors Weak Structure Theorem. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (3), pp.1209-1227. ⟨10.1137/110857027⟩. ⟨lirmm-00904527⟩
    • Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki. Outerplanar obstructions for matroid pathwidth. Discrete Mathematics, Elsevier, 2013, 315-316, pp.95-101. ⟨10.1016/j.disc.2013.10.007⟩. ⟨lirmm-01083516⟩
    • Dimitrios M. Thilikos, Ignasi Sau Valls, Juanjo Rué. Asymptotic enumeration of non-crossing partitions on surfaces. Discrete Mathematics, Elsevier, 2013, pp.635-649. ⟨10.1016/j.disc.2012.12.011⟩. ⟨lirmm-00804780⟩
    • Dimitrios M. Thilikos, Archontia C. Giannopoulou, Paul Hunter. LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discrete Applied Mathematics, Elsevier, 2012, pp.2089-2097. ⟨10.1016/j.dam.2012.03.015⟩. ⟨lirmm-00804777⟩
    • Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowledge and Information Systems (KAIS), Springer, 2012, 35 (2), pp.311 - 343. ⟨10.1007/s10115-012-0539-0⟩. ⟨lirmm-00846768⟩
    • Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, et al.. Connected Graph Searching. Information and Computation, Elsevier, 2012, 219, pp.1-16. ⟨hal-00741948⟩
    • Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau Valls, Dimitrios M. Thilikos. Fast Minor Testing in Planar Graphs. Algorithmica, Springer Verlag, 2012, 64 (1), pp.69-84. ⟨10.1007/s00453-011-9563-9⟩. ⟨lirmm-00904515⟩
    • Hans L. Bodlaender, Fedor V. Fomin, Aries Koster, Dieter Kratsch, Dimitrios M. Thilikos. On exact algorithms for treewidth. ACM Transactions on Algorithms, Association for Computing Machinery, 2012, 9 (1), pp.12:1--12:23. ⟨10.1145/2390176.2390188⟩. ⟨lirmm-00804792⟩
    • Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Catalan structures and dynamic programming in H-minor-free graphs. Journal of Computer and System Sciences, Elsevier, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩. ⟨lirmm-00904498⟩
    • Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau Valls, Dimitrios M. Thilikos. Faster parameterized algorithms for minor containment. Theoretical Computer Science, Elsevier, 2011, 412 (50), pp.7018-7028. ⟨lirmm-00736522⟩
    • Ignasi Sau Valls, Dimitrios M. Thilikos. On self-duality of branchwidth in graphs of bounded genus. Discrete Applied Mathematics, Elsevier, 2011, 159 (17), pp.2184-2186. ⟨10.1016/j.dam.2011.06.028⟩. ⟨lirmm-00736520⟩
    • Ignasi Sau Valls, Dimitrios M. Thilikos. Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Journal of Discrete Algorithms, Elsevier, 2010, 8 (3), pp.330-338. ⟨10.1016/j.jda.2010.02.002⟩. ⟨lirmm-00736490⟩

    Conference papers59 documents

    • Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos. A Constant-Factor Approximation for Weighted Bond Cover. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, Aug 2021, Seattle, United States. ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩. ⟨hal-03390188⟩
    • Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis. Hcore-Init: Neural Network Initialization based on Graph Degeneracy. ICPR 2020 - 25th International Conference on Pattern Recognition, Jan 2021, Milan (Virtual), Italy. pp.5852-5858, ⟨10.1109/ICPR48806.2021.9412940⟩. ⟨hal-03002744v2⟩
    • Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Pisa, Italy. pp.51:1-51:17, ⟨10.4230/LIPIcs.ESA.2020.51⟩. ⟨hal-03002709⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. 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⟩. ⟨lirmm-02991215⟩
    • Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. Hitting topological minor models in planar graphs is fixed parameter tractable. SODA 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⟩. ⟨hal-03003167⟩
    • Ignasi Sau Valls, Giannos Stamoulis, Dimitrios M. Thilikos. An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. 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⟩. ⟨lirmm-02991704⟩
    • Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. A linear fixed parameter tractable algorithm for connected pathwidth. ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩. ⟨hal-03002761⟩
    • Isolde Adler, Christophe Paul, Dimitrios M. Thilikos. Connected Search for a Lazy Robber. FSTTCS 2019 - 39th IARCS Annual 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⟩. ⟨hal-03003243⟩
    • Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. Minimum Reload Cost Graph Factors. SOFSEM, Jan 2019, Nový Smokovec, Slovakia. pp.67-80, ⟨10.1007/978-3-030-10801-4_7⟩. ⟨lirmm-02342817⟩
    • Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS 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⟩. ⟨lirmm-02342775⟩
    • Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. Modification to Planarity is Fixed Parameter Tractable. STACS 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⟩. ⟨lirmm-02342768⟩
    • Petr A. Golovach, Dimitrios M. Thilikos. Clustering to Given Connectivities. IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.18:1-18:17, ⟨10.4230/LIPIcs.IPEC.2019.18⟩. ⟨hal-03003256⟩
    • Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos. Data-Compression for Parametrized Counting Problems on Sparse Graphs. 29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩. ⟨lirmm-02342803⟩
    • Fedor V. Fomin, Petr A. Golovach, Torstein J F Strømme, Dimitrios M. Thilikos. Partial complementation of graphs. SWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13, ⟨10.4230/LIPIcs.SWAT.2018.21⟩. ⟨lirmm-01890534⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. 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⟩. ⟨lirmm-02342806⟩
    • Ioannis Giotis, Lefteris Kirousis, John Livieratos, Kostas I Psaromiligkos, Dimitrios M. Thilikos. Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. International Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom), Jun 2018, Athens, Greece. pp.148-155. ⟨lirmm-01890510⟩
    • Julien Baste, Didem Gözüpek, Ignasi Sau Valls, Mordechai Shalom, Dimitrios M. Thilikos. Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. 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⟩. ⟨hal-01733767⟩
    • Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩. ⟨lirmm-01610076⟩
    • Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. 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⟩. ⟨hal-01733845⟩
    • Julien Baste, Dimitrios M. Thilikos. Contraction-Bidimensionality of Geometric Intersection Graphs. 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩. ⟨lirmm-01890527⟩
    • Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. Structured Connectivity Augmentation. MFCS 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⟩. ⟨lirmm-01890542⟩
    • Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, et al.. FPT Algorithms for Plane Completion Problems. MFCS: Mathematical Foundations of Computer Science, Aug 2016, Kraków, Poland. pp.26:1-26:13, ⟨10.4230/LIPIcs.MFCS.2016.26⟩. ⟨lirmm-01370324⟩
    • Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: obstructions and algorithmic aspects. IPEC: International symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩. ⟨lirmm-01370305⟩
    • Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Packing and Covering Immersion Models of Planar subcubic Graphs. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩. ⟨lirmm-01370310v2⟩
    • Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO: Analytic Algorithmics and Combinatorics, Jan 2015, San Diego, California, United States. ⟨10.1137/1.9781611973761.2⟩. ⟨lirmm-01225505⟩
    • Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩. ⟨hal-01178222⟩
    • Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩. ⟨lirmm-01263999⟩
    • Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey. ⟨lirmm-01370331⟩
    • Konrad K. Dabrowski, Petr A. Golovach, Pim Van'T Hof, Daniël Paulusma, Dimitrios M. Thilikos. Editing to a Planar Graph of Given Degrees. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156, ⟨10.1007/978-3-319-20297-6_10⟩. ⟨lirmm-01225602⟩
    • Marcin J. Kaminski, Daniël Paulusma, Stewart Anthony, Dimitrios M. Thilikos. Minimal Disconnected Cuts in Planar Graphs. FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254, ⟨10.1007/978-3-319-22177-9_19⟩. ⟨lirmm-01225549⟩
    • Dimitrios M. Thilikos. Algorithms and Combinatorics on the Erdős–Pósa property. AGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia. ⟨lirmm-01483655⟩
    • Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩. ⟨hal-01218496⟩
    • Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-cut Decomposition. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩. ⟨lirmm-01264015⟩
    • Dimitrios M. Thilikos. Bidimensionality and Parameterized Algorithms. IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16, ⟨10.4230/LIPIcs.IPEC.2015.1⟩. ⟨lirmm-01370293⟩
    • Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey. ⟨lirmm-01370328⟩
    • Clément Requilé, Dimitrios M. Thilikos, Petr A. Golovach. Variants of Plane Diameter Completion. IPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩. ⟨lirmm-01225566⟩
    • Menelaos Karavelas, Dimitris Zoros, Spyridon Maniatis, Dimitrios M. Thilikos. Geometric Extensions of Cutwidth in any Dimension. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01083698⟩
    • Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. Covering and packing pumpkin models. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01083652⟩
    • Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. Contraction Obstructions for Connected Graph Searching. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01083704⟩
    • Petr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. Thilikos. The Parameterized Complexity of Graph Cyclability. ESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩. ⟨hal-01083993⟩
    • Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. Bidimensionality of Geometric Intersection Graphs. SOFSEM: 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⟩. ⟨lirmm-00904537⟩
    • Rémy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, Dimitrios M. Thilikos. Structure of W_4 -immersion free graphs. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨hal-01084005⟩
    • Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Michalis Vazirgiannis, Dimitrios M. Thilikos. Quantifying trust dynamics in signed graphs, the S-Cores approach. SDM: SIAM Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩. ⟨lirmm-01083529⟩
    • Christos Giatsidis, Fragkiskos Malliaros, Dimitrios M. Thilikos, Michalis Vazirgiannis. CORECLUSTER: A Degeneracy Based Graph Clustering Framework. IAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada. ⟨lirmm-01083536⟩
    • Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Explicit linear kernels via dynamic programming. STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩. ⟨hal-01084007⟩
    • Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An edge variant of the Erdős-Pósa property. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-00904544⟩
    • Jean-Florent Raymond, Dimitrios M. Thilikos. Polynomial Gap Extensions of the Erdős-Pósa Theorem. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩. ⟨lirmm-01083659⟩
    • Valentin Garnero, Ignasi Sau Valls, Dimitrios M. Thilikos. A linear kernel for planar red-blue dominating set. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120. ⟨lirmm-00846771⟩
    • Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos. Excluding Graphs as Immersions in Surface Embedded Graphs. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩. ⟨lirmm-01483644⟩
    • Christos Giatsidis, Michalis Vazirgiannis, Dimitrios M. Thilikos. Evaluating Cooperation in coauthorship graphs with degeneracy. BDA: Bases de Données Avancées, Oct 2013, Nantes, France. ⟨lirmm-00904582⟩
    • Dimitrios M. Thilikos. Theory and Applications of Bidimensionality. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2013, Chengdu, China. ⟨10.1007/978-3-319-03780-6⟩. ⟨lirmm-01483650⟩
    • Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS: Symposium on Theoretical Aspects of Computer Science, Feb 2013, Kiel, Germany. pp.92-103, ⟨10.4230/LIPIcs.STACS.2013.92⟩. ⟨lirmm-00804758⟩
    • Marcin Kaminski, Dimitrios M. Thilikos. Contraction checking in graphs on surfaces. STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193. ⟨hal-00678173⟩
    • Juanjo Rué, Ignasi Sau Valls, Dimitrios M. Thilikos. Dynamic Programming for $H$-minor-free Graphs. COCOON: Computing and Combinatorics Conference, Aug 2012, Sydney, NSW, Australia. pp.86-97, ⟨10.1007/978-3-642-32241-9_8⟩. ⟨lirmm-00736708⟩
    • Juanjo Rué, Ignasi Sau Valls, Dimitrios M. Thilikos. Dynamic programming for graphs on surfaces. ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383. ⟨lirmm-00736703⟩
    • Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau Valls, Dimitrios M. Thilikos. Fast Minor Testing in Planar Graphs. ESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩. ⟨lirmm-00736769⟩
    • Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. Approximating Acyclicity Parameters of Sparse Hypergraphs. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.445-456. ⟨inria-00359709⟩
    • Dimitrios M. Thilikos. On Self-Duality of Branchwidth in Graphs of Bounded Genus. 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2009, Paris, France. pp.19-22. ⟨hal-00795413⟩
    • Dimitrios M. Thilikos. Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. DIMAP workshop on Algorithmic Graph Theory (AGT09), 2009, Warwick, United Kingdom. pp.59-66. ⟨hal-00795284⟩

    Books2 documents

    Book sections7 documents

    • Fedor Fomin, Petr Golovach, Dimitrios M. Thilikos. Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. Graph-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⟩. ⟨hal-03390090⟩
    • Öznur Yaşar Diner, Archontia Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos. Block Elimination Distance. Graph-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⟩. ⟨hal-03389973⟩
    • Dimitrios M. Thilikos. A Retrospective on (Meta) Kernelization. Treewidth, 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⟩. ⟨hal-03002701⟩
    • Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. An Alternate Proof of the Algorithmic Lovász Local Lemma. Extended Abstracts Summer 2015, 6, pp.61-65, 2017, Trends in Mathematics, 978-3-319-51752-0. ⟨10.1007/978-3-319-51753-7_10⟩. ⟨lirmm-01692634⟩
    • Dimitrios M. Thilikos, Fedor V. Fomin. Branchwidth of Graphs. Encyclopedia 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⟩. ⟨lirmm-01483694⟩
    • Fedor V. Fomin, Erik D. Demaine, Mohammed Taghi Hajiaghayi, Dimitrios M. Thilikos. Bidimensionality. Encyclopedia 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⟩. ⟨lirmm-01483707⟩
    • Dimitrios M. Thilikos. Graph Minors and Parameterized Algorithm Design. The 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⟩. ⟨lirmm-01083542⟩

    Directions of work or proceedings7 documents

    • Ignasi Sau Valls, Dimitrios M. Thilikos. Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. LNCS (11789), 2019, 978-3-030-30785-1. ⟨10.1007/978-3-030-30786-8⟩. ⟨lirmm-02342784⟩
    • Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. Forewords: Special issue on Theory and Applications of Graph Searching Problems. France. Theoretical Computer Science, 655 (Part A), 2016, ⟨10.1016/j.tcs.2016.11.001⟩. ⟨lirmm-01483703⟩
    • Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos. Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. France. Discrete Applied Mathematics, 199, pp.1-2, 2016, ⟨10.1016/j.dam.2015.10.004⟩. ⟨lirmm-01483700⟩
    • Dimitrios M. Thilikos. 6th Workshop on Graph Classes, Width Parameters and Optimization (GROW 2013). France. pp.1-20, 2013. ⟨lirmm-00904565⟩
    • Gerhard J. Woeginger, Dimitrios M. Thilikos. Parameterized and Exact Computation. Dimitrios M. Thilikos; Gerhard J. Woeginger. Ljubljana, Slovenia. LNCS (7535), Springer, 2012, 978-3-642-33292-0. ⟨10.1007/978-3-642-33293-7⟩. ⟨lirmm-00904549⟩
    • Dimitrios M. Thilikos, Pierre Fraigniaud, Fedor V. Fomin, Stephan Kreutzer. Foreword: Special Issue on Theory and Applications of Graph Searching Problems. France. 463, Springer, 2012, Theoretical Computer Science, ⟨10.1016/j.tcs.2012.10.006⟩. ⟨lirmm-00804772⟩
    • Fedor V. Fomin, Richard J. Nowakowski, Pawel Pralat, Dimitrios M. Thilikos. 5th Workshop on GRAph Searching, Theory and Applications (GRASTA 2012). France. pp.1-12, 2012. ⟨lirmm-00904556⟩

    Other publications1 document

    • Gregory Gutin, Dimitrios M. Thilikos. Report on NII Shonan Meeting 2013-018. 2014, News and Conference Reports. ⟨lirmm-01084332⟩

    Preprints, Working Papers, ...4 documents

    • Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. Nearly Planar Graphs and {\lambda}-flat Graphs. 2013. ⟨lirmm-00904543⟩
    • Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabhh, et al.. Irrelevant Vertices for the Planar Disjoint Paths Problem. 2013. ⟨lirmm-00904538⟩
    • Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, et al.. (Meta) Kernelization. 2013. ⟨lirmm-00904532⟩
    • Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos. Excluding Graphs as Immersions in Surface Embedded Graphs. 2013. ⟨lirmm-00805139⟩

    Reports7 documents

    • Spyros Angelopoulos, Pierre Fraigniaud, Fedor V. Fomin, Nicolas Nisse, Dimitrios M. Thilikos. 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. ⟨lirmm-01645614⟩
    • Eunjung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. [Research Report] LIRMM. 2015. ⟨lirmm-01225569⟩
    • Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. An alternative proof for the constructive Asymmetric Lovász Local Lemma. [Research Report] LIRMM. 2015. ⟨lirmm-01225560⟩
    • Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. [Research Report] LIRMM. 2015. ⟨lirmm-01225570⟩
    • Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2014. [Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014. ⟨hal-01084230⟩
    • Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, et al.. Connected Graph Searching. [Research Report] RR-7363, INRIA. 2010. ⟨inria-00508888⟩
    • Juanjo Rué, Ignasi Sau Valls, Dimitrios M. Thilikos. Dynamic Programming for Graphs on Surfaces. [Research Report] RR-7166, INRIA. 2009, pp.39. ⟨inria-00443582⟩