← back to search

Dimitrios M. Thilikos

Université de Montpellier · FR
🔎 Find collaborators in Computational Theory and Mathematics · Computer Networks and Communications →
Search 5.9M scientists by topic, h-index, country & funding — free.
Area of research
Computational Theory and Mathematics · Computer Networks and Communications
Research interest
Research interests include Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Graph Labeling and Dimension Problems, and Interconnection Networks and Systems.
h-index
39
citations
5,418
works
314
NIH funding
primary concept
email

Recent publications

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science 2024cited by 3position: contributordoi
A more accurate view of the Flat Wall Theorem
Journal of Graph Theory 2024cited by 2position: contributordoi
Killing a Vortex
Journal of the ACM 2024cited by 0position: contributordoi
Compound Logics for Modification Problems
ACM Transactions on Computational Logic 2024cited by 0position: contributordoi
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
ACM Transactions on Algorithms 2023cited by 0position: contributordoi
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
ACM Transactions on Computation Theory 2022cited by 0position: contributordoi
Connected search for a lazy robber
Journal of Graph Theory 2021cited by 1position: contributordoi
A Retrospective on (Meta) Kernelization
Lecture Notes in Computer Science 2020cited by 1position: contributordoi
Structure and enumeration of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e654" altimg="si10.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-minor-free links and link-diagrams
European Journal of Combinatorics 2020cited by 0position: contributordoi
Minimum Reload Cost Graph Factors
Lecture Notes in Computer Science 2019cited by 1position: contributordoi
(Meta) Kernelization
Journal of the ACM 2016cited by 113position: lastdoi
On exact algorithms for treewidth
ACM Transactions on Algorithms 2012cited by 44position: lastdoi

Grants

No grants ingested yet.

Frequent collaborators

· 10 papers (2019–2024)Giannos Stamoulis · Université Paris Cité5 papers (2022–2024)Petr A. Golovach · University of Bergen3 papers (2022–2024)Fedor V. Fomin · University of Bergen2 papers (2022–2024)Hans L. Bodlaender · Utrecht University2 papers (2012–2016) · 2 papers (2012–2016) · 1 papers (2012–2012)Christophe Paul · Agence Nationale de la Recherche1 papers (2021–2021)Didem Gözüpek · Gebze Technical University1 papers (2019–2019)Nicole Schirrmacher · University of Bremen1 papers (2024–2024)Mordechai Shalom · Tel Hai Academic College1 papers (2019–2019)Alexandre Vigny · University of Warsaw1 papers (2024–2024)Sebastian Siebertz · University of Bremen1 papers (2024–2024)Julien Baste · Society for Industrial and Applied Mathematics1 papers (2019–2019)Ignasi Sau · Elsevier, Inc.1 papers (2024–2024)Isolde Adler · University of Bamberg1 papers (2021–2021)Sebastian Wiederrecht · Institute for Basic Science1 papers (2024–2024) · 1 papers (2016–2016)Daniel Lokshtanov · University of California, Santa Barbara1 papers (2016–2016) · 1 papers (2012–2012)
Looking for a research collaborator?
Search millions of scientists by field, institution, impact, and funding status — see their work, find their email, and reach out directly.
Find collaborators in Computational Theory and Mathematics · Computer Networks and Communications →