Dimitrios M. Thilikos - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 283

2023

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal AlgorithmJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. SICOMP, 52(4):865-912, August 2023. [doi]

Kernelization for Graph Packing Problems via Rainbow MatchingStéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht. soda 2023: 3654-3663 [doi]

Compound Logics for Modification ProblemsFedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. icalp 2023: [doi]

Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphsFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. iandc, 293:105049, August 2023. [doi]

Excluding Single-Crossing Matching Minors in Bipartite GraphsArchontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht. soda 2023: 2111-2121 [doi]

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph ClassesPetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. soda 2023: 3684-3699 [doi]

Combing a Linkage in an AnnulusPetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. siamdm, 37(4):2332-2364, December 2023. [doi]

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter TractablePetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. TALG, 19(3), July 2023. [doi]

Dynamic Programming on Bipartite Tree DecompositionsLars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos. iwpec 2023: [doi]

On Strict BramblesEmmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros. gc, 39(2):24, April 2023. [doi]

Edge-treewidth: Algorithmic and combinatorial propertiesLoïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos. DAM, 341:40-54, December 2023. [doi]

The mixed search game against an agile and visible fugitive is monotoneGuillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. DM, 346(4):113345, April 2023. [doi]

Faster Parameterized Algorithms for Modification Problems to Minor-Closed ClassesLaure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. icalp 2023: [doi]

k-apices of minor-closed graph classes. I. Bounding the obstructionsIgnasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. jctb, 161:180-227, July 2023. [doi]

2022

Contraction Bidimensionality of Geometric Intersection GraphsJulien Baste, Dimitrios M. Thilikos. algorithmica, 84(2):510-531, 2022. [doi]

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOLFedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. toct, 14(3-4):1-29, December 2022. [doi]

Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. tocl, 23(3), 2022. [doi]

A Linear Fixed Parameter Tractable Algorithm for Connected PathwidthMamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. siamdm, 36(1):411-435, 2022. [doi]

A polynomial time algorithm to compute the connected treewidth of a series-parallel graphGuillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. DAM, 312:72-85, 2022. [doi]

k-apices of Minor-closed Graph Classes. II. Parameterized AlgorithmsIgnasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. TALG, 18(3), 2022. [doi]

Killing a vortexDimitrios M. Thilikos, Sebastian Wiederrecht. focs 2022: 1069-1080 [doi]

Block Elimination DistanceÖznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos. gc, 38(5):133, 2022. [doi]

2021

A Constant-Factor Approximation for Weighted Bond CoverEun Jung Kim 0002, Euiwoong Lee, Dimitrios M. Thilikos. approx 2021: [doi]

Connected search for a lazy robberIsolde Adler, Christophe Paul, Dimitrios M. Thilikos. jgt, 97(4):510-552, 2021. [doi]

Minimum Reload Cost Graph FactorsJulien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. mst, 65(5):815-838, 2021. [doi]

Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on GraphsFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. wg 2021: 308-320 [doi]

Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. lics 2021: 1-13 [doi]

A Menger-like property of tree-cut widthArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. jctb, 148:1-22, 2021. [doi]

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. siamdm, 35(1):105-151, 2021. [doi]

Minor obstructions for apex-pseudoforestsAlexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis. DM, 344(10):112529, 2021. [doi]

Compactors for parameterized counting problemsDimitrios M. Thilikos. csr, 39:100344, 2021. [doi]

Block Elimination DistanceÖznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos. wg 2021: 28-38 [doi]

2020

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundaryJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. soda 2020: 951-970 [doi]

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithmsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. TCS, 814:135-152, 2020. [doi]

Hitting minors on bounded treewidth graphs. III. Lower boundsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. jcss, 109:56-77, 2020. [doi]

Hitting Minors on Bounded Treewidth Graphs. I. General Upper BoundsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. siamdm, 34(3):1623-1648, 2020. [doi]

Parameterized complexity of finding a spanning tree with minimum reload cost diameterJulien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. networks, 75(3):259-277, 2020. [doi]

Sparse obstructions for minor-covering parametersDimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros. DAM, 278:28-50, 2020. [doi]

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOLFedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. esa 2020: [doi]

Subgraph ComplementationFedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos. algorithmica, 82(7):1859-1880, 2020. [doi]

On the Parameterized Complexity of Graph Modification to First-Order Logic PropertiesFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. mst, 64(2):251-271, 2020. [doi]

Bidimensionality and KernelsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos. SICOMP, 49(6):1397-1422, 2020. [doi]

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter TractablePetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. soda 2020: 931-950 [doi]

A Linear Fixed Parameter Tractable Algorithm for Connected PathwidthMamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. esa 2020: [doi]

Minor-obstructions for apex sub-unicyclic graphsAlexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona. DAM, 284:538-555, 2020. [doi]

Edge degeneracy: Algorithmic and structural resultsStratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos. TCS, 839:164-175, 2020. [doi]

Hcore-Init: Neural Network Initialization based on Graph DegeneracyStratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis. icpr 2021: 5852-5858 [doi]

Structure and enumeration of K4-minor-free links and link-diagramsJuanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. ejc, 89:103147, 2020. [doi]

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph ClassesIgnasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. icalp 2020: [doi]

A Retrospective on (Meta) KernelizationDimitrios M. Thilikos. BIRTHDAY 2020: 222-246 [doi]

2019

Preface to special issue on Theory and Applications of Graph SearchingSpyros Angelopoulos 0001, Nicolas Nisse, Dimitrios M. Thilikos. TCS, 794:1-2, 2019. [doi]

Connected Search for a Lazy RobberIsolde Adler, Christophe Paul, Dimitrios M. Thilikos. fsttcs 2019: [doi]

Minimum Reload Cost Graph FactorsJulien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. sofsem 2019: 67-80 [doi]

Modification to Planarity is Fixed Parameter TractableFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. STACS 2019: [doi]

Explicit Linear Kernels for Packing ProblemsValentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. algorithmica, 81(4):1615-1656, 2019. [doi]

Lean Tree-Cut Decompositions: Obstructions and AlgorithmsArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. STACS 2019: [doi]

Cutwidth: Obstructions and Algorithmic AspectsArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. algorithmica, 81(2):557-588, 2019. [doi]

Clustering to Given ConnectivitiesPetr A. Golovach, Dimitrios M. Thilikos. iwpec 2019: [doi]

2018

Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemmaIoannis Giotis 0001, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. gascom 2018: 148-155 [doi]

Data-Compression for Parametrized Counting Problems on Sparse GraphsEun Jung Kim 0002, Maria J. Serna, Dimitrios M. Thilikos. isaac 2018: [doi]

An FPT 2-Approximation for Tree-Cut DecompositionEun Jung Kim 0002, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. algorithmica, 80(1):116-135, 2018. [doi]

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. iwpec 2019: [doi]

rDimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. algorithmica, 80(4):1330-1356, 2018. [doi]

Partial Complementation of GraphsFedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos. swat 2018: [doi]

Structured Connectivity AugmentationFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. siamdm, 32(4):2612-2635, 2018. [doi]

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological MinorsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos. TALG, 14(1), 2018. [doi]

4-minor-free links and link diagramsJuanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. endm, 68:119-124, 2018. [doi]

2017

Acyclic edge coloring through the Lovász Local LemmaIoannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. TCS, 665:40-50, 2017. [doi]

Parameterized algorithms for min-max multiway cut and list digraph homomorphismEun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. jcss, 86:191-206, 2017. [doi]

Irrelevant vertices for the planar Disjoint Paths ProblemIsolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. JCT, 122:815-843, 2017. [doi]

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. iwpec 2018: [doi]

Contraction-Bidimensionality of Geometric Intersection GraphsJulien Baste, Dimitrios M. Thilikos. iwpec 2018: [doi]

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterJulien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. iwpec 2018: [doi]

r-girthDimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. ejc, 65:106-121, 2017. [doi]

A polynomial-time algorithm for Outerplanar Diameter ImprovementNathann Cohen, Daniel Gonçalves 0001, Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller. jcss, 89:315-327, 2017. [doi]

Editing to a planar graph of given degreesKonrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos. jcss, 85:168-182, 2017. [doi]

Structured Connectivity AugmentationFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. mfcs 2017: [doi]

A linear kernel for planar red-blue dominating setValentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. DAM, 217:536-547, 2017. [doi]

Packing and covering immersion-expansions of planar sub-cubic graphsArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. ejc, 65:154-167, 2017. [doi]

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. icalp 2017: [doi]

The Parameterized Complexity of Graph CyclabilityPetr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos. siamdm, 31(1):511-541, 2017. [doi]

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiabilityIyad A. Kanj, Dimitrios M. Thilikos, Ge Xia. iandc, 257:139-156, 2017. [doi]

Recent techniques and results on the Erdős-Pósa propertyJean-Florent Raymond, Dimitrios M. Thilikos. DAM, 231:25-43, 2017. [doi]

Low Polynomial Exclusion of Planar Graph PatternsJean-Florent Raymond, Dimitrios M. Thilikos. jgt, 84(1):26-44, 2017. [doi]

2016

Planar Disjoint-Paths CompletionIsolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. algorithmica, 76(2):401-425, 2016. [doi]

Contraction obstructions for connected graph searchingMicah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. DAM, 209:27-47, 2016. [doi]

(Meta) KernelizationHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos. JACM, 63(5):44, 2016. [doi]

FPT Algorithms for Plane Completion ProblemsDimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. mfcs 2016: [doi]

Forewords: Special issue on Theory and Applications of Graph Searching ProblemsFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. TCS, 655:1, 2016. [doi]

Packing and Covering Immersion Models of Planar Subcubic GraphsArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. wg 2016: 74-84 [doi]

Cutwidth: Obstructions and Algorithmic AspectsArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. iwpec 2017: [doi]

Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos. DAM, 199:1-2, 2016. [doi]

Minimal disconnected cuts in planar graphsMarcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos. networks, 68(4):250-259, 2016. [doi]

An edge variant of the Erdős-Pósa propertyJean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. DM, 339(8):2027-2035, 2016. [doi]

2015

On the Algorithmic Lovász Local Lemma and Acyclic Edge ColoringIoannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. analco 2015: 16-25 [doi]

An alternative proof for the constructive Asymmetric Lovász Local LemmaIoannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. colognetwente 2015: 89-92

A Fixed Parameter Algorithm for Plane Subgraph CompletionDimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. colognetwente 2015: 97-100

An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ rDimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. waoa 2015: 122-132 [doi]

Forbidding Kuratowski Graphs as ImmersionsArchontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos. jgt, 78(1):43-60, 2015. [doi]

Bidimensionality and Parameterized Algorithms (Invited Talk)Dimitrios M. Thilikos. iwpec 2015: 1-16 [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Dimitrios M. Thilikos'

Viewing Publication 1 - 100 from 283

2023

2022

2021

2020

2019

2018

2017

2016

2015

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Dimitrios M. Thilikos'

Viewing Publication 1 - 100 from 283

2023

2022

2021

2020

2019

2018

2017

2016

2015

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1