default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitrios M. Thilikos
- > Home > Persons > Dimitrios M. Thilikos
Publications
- 2024
[c131]Christophe Paul, Evangelos Protopapas
, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. FOCS 2024: 31-52- [c130]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP 2024: 114:1-114:19 - [i84]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR abs/2406.16647 (2024) - [i82]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. CoRR abs/2407.09671 (2024) - 2023
- [j150]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341: 40-54 (2023) - [j149]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. Discret. Math. 346(4): 113345 (2023) - [i79]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Graph Parameters, Universal Obstructions, and WQO. CoRR abs/2304.03688 (2023) - [i77]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Universal Obstructions of Graph Parameters. CoRR abs/2304.14121 (2023) - 2022
- [j141]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. 312: 72-85 (2022) - [j139]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36(1): 411-435 (2022) - [i74]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. CoRR abs/2204.10691 (2022) - 2021
- [j132]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected search for a lazy robber. J. Graph Theory 97(4): 510-552 (2021) - [i57]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-trewidth: Algorithmic and combinatorial properties. CoRR abs/2112.07524 (2021) - 2020
- [j123]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020) - [j119]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. 839: 164-175 (2020) - [c113]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA 2020: 64:1-64:16 - [i56]Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR abs/2004.00547 (2020) - [i54]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR abs/2004.11937 (2020) - [i52]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge Degeneracy: Algorithmic and Structural Results. CoRR abs/2009.03809 (2020) - 2019
- [j117]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels for Packing Problems. Algorithmica 81(4): 1615-1656 (2019) - [c108]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected Search for a Lazy Robber. FSTTCS 2019: 7:1-7:14 - 2018
- [j115]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - 2017
- [j104]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. 86: 191-206 (2017) - [j103]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89: 315-327 (2017) - [c98]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [i43]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - 2016
- [i35]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels for packing problems. CoRR abs/1610.06131 (2016) - 2015
- [j90]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. 29(4): 1864-1894 (2015) - [c90]Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - [c85]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - [c84]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [i29]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - [i28]Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR abs/1509.07404 (2015) - 2014
- [c78]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. STACS 2014: 312-324 - [i24]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR abs/1403.5702 (2014) - 2013
- [i14]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels via dynamic programming. CoRR abs/1312.6585 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-02 01:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
