Dimitrios M. Thilikos

Université de Montpellier — France

Computer Science · Physical Sciences

39h-index5.3kcitations316works0.62yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(263), Complexity and Algorithms in Graphs(150), Graph Labeling and Dimension Problems(66), Interconnection Networks and Systems(52), Limits and Structures in Graph Theory(49)

Publications316 total

\(\mathcal{H}\)-Planarity and Parametric Extensions: when Modulators Act Globally
Society for Industrial and Applied Mathematics eBooks·2026
Dynamic programming on bipartite tree decompositions
Journal of Computer and System Sciences·2025Open Access
Colorful Minors
ArXiv.org·2025Open Access
Making the interval membership width of temporal graphs connected and bidirectional
Journal of Computer and System Sciences·2025Open Access
Excluding Pinched Spheres
arXiv (Cornell University)·2025Open Access
A constant-factor approximation for weighted bond cover
Journal of Computer and System Sciences·2025Open Access
Finding irrelevant vertices in linear time on bounded-genus graphs
Society for Industrial and Applied Mathematics eBooks·2025
Approximating Branchwidth on Parametric Extensions of Planarity
Lecture notes in computer science·2025
Compound Logics for Modification Problems
ACM Transactions on Computational Logic·2024
Preface to special issue on theory and applications of Graph Searching
Theoretical Computer Science·2024
Obstructions to Erdős-Pósa Dualities for Minors
arXiv (Cornell University)·2024Open Access
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
arXiv (Cornell University)·2024Open Access
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
arXiv (Cornell University)·2024Open Access
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
2024· 3 citedOpen Access
Killing a Vortex
Journal of the ACM·2024· 1 citedOpen Access
A more accurate view of the Flat Wall Theorem
Journal of Graph Theory·2024· 6 citedOpen Access
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Lecture notes in computer science·2024· 1 citedOpen Access
Combing a Linkage in an Annulus
SIAM Journal on Discrete Mathematics·2023· 3 citedOpen Access
Edge-treewidth: Algorithmic and combinatorial properties
Discrete Applied Mathematics·2023· 1 citedOpen Access
The Graph Minors Structure Theorem through Bidimensionality
arXiv (Cornell University)·2023· 1 citedOpen Access
page 1 of 16Next →

Frequent Co-authors

Fedor V. Fomin(23), Hans L. Bodlaender(14), Erik D. Demaine(8), Daniel Lokshtanov(5), Saket Saurabh(5), MohammadTaghi Hajiaghayi(4), Christos Giatsidis(4), Michalis Vazirgiannis(4), Marı́a Serna(4), Mohammad Taghi Hajiaghayi(3), Frederic Dorn(3), Arie M. C. A. Koster(3), Dieter Kratsch(3), Eelko Penninkx(2), Petr A. Golovach(2), Naomi Nishimura(2), Prabhakar Ragde(2), Isolde Adler(2), Hannes Moser(1), MohammadTaghi Hajiaghayi(1)