Artykuły udostępnione publicznie: - Dimitrios M. ThilikosWięcej informacji
Niedostępny w żadnym miejscu: 1
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
J Baste, I Sau, DM Thilikos
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Upoważnienia: Research Council of Norway, Agence Nationale de la Recherche
Dostępne w jakimś miejscu: 72
(Meta) kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 1-69, 2016
Upoważnienia: Netherlands Organisation for Scientific Research, European Commission
Parameterized complexity of finding regular induced subgraphs
H Moser, DM Thilikos
Journal of Discrete Algorithms 7 (2), 181-190, 2009
Upoważnienia: German Research Foundation
On exact algorithms for treewidth
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
European Symposium on Algorithms, 672-683, 2006
Upoważnienia: German Research Foundation
A note on exact algorithms for vertex ordering problems on graphs
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
Theory of Computing Systems 50 (3), 420-432, 2012
Upoważnienia: German Research Foundation, Government of Spain
On exact algorithms for treewidth
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012
Upoważnienia: German Research Foundation, Government of Spain
Irrelevant vertices for the planar disjoint paths problem
I Adler, SG Kolliopoulos, PK Krause, D Lokshtanov, S Saurabh, ...
Journal of Combinatorial Theory, Series B 122, 815-843, 2017
Upoważnienia: German Research Foundation, European Commission
Dynamic programming for graphs on surfaces
J Rué, I Sau, DM Thilikos
ACM Transactions on Algorithms (TALG) 10 (2), 1-26, 2014
Upoważnienia: European Commission
Cutwidth: Obstructions and algorithmic aspects
AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81, 557-588, 2019
Upoważnienia: European Commission
Increasing the minimum degree of a graph by contractions
PA Golovach, M Kamiński, D Paulusma, DM Thilikos
Theoretical computer science 481, 74-84, 2013
Upoważnienia: UK Engineering and Physical Sciences Research Council
Hitting minors on bounded treewidth graphs. I. General upper bounds
J Baste, I Sau, DM Thilikos
SIAM Journal on Discrete Mathematics 34 (3), 1623-1648, 2020
Upoważnienia: German Research Foundation, Agence Nationale de la Recherche
An FPT-algorithm for recognizing k-apices of minor-closed graph classes
I Sau, G Stamoulis, DM Thilikos
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
Upoważnienia: Research Council of Norway, Agence Nationale de la Recherche
Outerplanar obstructions for a feedback vertex set
J Rué, KS Stavropoulos, DM Thilikos
European Journal of Combinatorics 33 (5), 948-968, 2012
Upoważnienia: Government of Spain
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
SIAM Journal on Computing 49 (6), 1397-1422, 2020
Upoważnienia: Research Council of Norway, Agence Nationale de la Recherche
Kernels for (connected) dominating set on graphs with excluded topological minors
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
ACM Transactions on Algorithms (TALG) 14 (1), 1-31, 2018
Upoważnienia: European Commission
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms
I Sau, G Stamoulis, DM Thilikos
ACM Transactions on Algorithms (TALG) 18 (3), 1-30, 2022
Upoważnienia: German Research Foundation, Agence Nationale de la Recherche
Parameterized complexity of elimination distance to first-order logic properties
FV Fomin, PA Golovach, DM Thilikos
ACM Transactions on Computational Logic (TOCL) 23 (3), 1-35, 2022
Upoważnienia: German Research Foundation, Research Council of Norway, Agence Nationale de …
On the parameterized complexity of graph modification to first-order logic properties
FV Fomin, PA Golovach, DM Thilikos
Theory of Computing Systems 64 (2), 251-271, 2020
Upoważnienia: Research Council of Norway, Agence Nationale de la Recherche
The parameterized complexity of graph cyclability
PA Golovach, M Kaminski, S Maniatis, DM Thilikos
SIAM Journal on Discrete Mathematics 31 (1), 511-541, 2017
Upoważnienia: European Commission
Killing a vortex
DM Thilikos, S Wiederrecht
Journal of the ACM 71 (4), 1-56, 2024
Upoważnienia: Agence Nationale de la Recherche
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy