Dimitrios M. Thilikos

5.3k total citations
125 papers, 2.1k citations indexed

About

Dimitrios M. Thilikos is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Dimitrios M. Thilikos has authored 125 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 114 papers in Computational Theory and Mathematics, 60 papers in Computer Networks and Communications and 18 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Dimitrios M. Thilikos's work include Advanced Graph Theory Research (112 papers), Complexity and Algorithms in Graphs (60 papers) and Interconnection Networks and Systems (32 papers). Dimitrios M. Thilikos is often cited by papers focused on Advanced Graph Theory Research (112 papers), Complexity and Algorithms in Graphs (60 papers) and Interconnection Networks and Systems (32 papers). Dimitrios M. Thilikos collaborates with scholars based in Greece, France and Norway. Dimitrios M. Thilikos's co-authors include Fedor V. Fomin, Erik D. Demaine, Hans L. Bodlaender, Christos Giatsidis, Michalis Vazirgiannis, MohammadTaghi Hajiaghayi, Saket Saurabh, Daniel Lokshtanov, Petr A. Golovach and Marı́a Serna and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Dimitrios M. Thilikos

114 papers receiving 2.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dimitrios M. Thilikos Greece 25 1.6k 809 336 244 193 125 2.1k
Daniel Lokshtanov Norway 22 2.0k 1.2× 772 1.0× 284 0.8× 333 1.4× 94 0.5× 159 2.4k
Dieter Kratsch France 27 1.9k 1.2× 756 0.9× 234 0.7× 356 1.5× 53 0.3× 132 2.2k
Jayme L. Szwarcfiter Brazil 20 1.2k 0.7× 398 0.5× 153 0.5× 330 1.4× 68 0.4× 187 1.7k
Saket Saurabh India 24 2.3k 1.4× 938 1.2× 329 1.0× 359 1.5× 41 0.2× 258 2.8k
Andrzej Proskurowski United States 18 1.4k 0.8× 704 0.9× 406 1.2× 214 0.9× 35 0.2× 63 1.9k
Michał Pilipczuk Poland 14 1.3k 0.8× 456 0.6× 203 0.6× 217 0.9× 32 0.2× 101 1.5k
Ton Kloks Netherlands 21 1.4k 0.8× 526 0.7× 173 0.5× 204 0.8× 29 0.2× 61 1.6k
Guy Kortsarz United States 25 1.1k 0.7× 1.1k 1.3× 218 0.6× 59 0.2× 99 0.5× 111 1.9k
Josep Dı́az Spain 16 721 0.4× 447 0.6× 344 1.0× 60 0.2× 72 0.4× 85 1.3k
Jeremy Spinrad United States 22 2.2k 1.3× 763 0.9× 344 1.0× 474 1.9× 31 0.2× 65 2.5k

Countries citing papers authored by Dimitrios M. Thilikos

Since Specialization
Citations

This map shows the geographic impact of Dimitrios M. Thilikos's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dimitrios M. Thilikos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dimitrios M. Thilikos more than expected).

Fields of papers citing papers by Dimitrios M. Thilikos

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dimitrios M. Thilikos. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dimitrios M. Thilikos. The network helps show where Dimitrios M. Thilikos may publish in the future.

Co-authorship network of co-authors of Dimitrios M. Thilikos

This figure shows the co-authorship network connecting the top 25 collaborators of Dimitrios M. Thilikos. A scholar is included among the top collaborators of Dimitrios M. Thilikos based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dimitrios M. Thilikos. Dimitrios M. Thilikos is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Siebertz, Sebastian, et al.. (2024). Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. SPIRE - Sciences Po Institutional REpository. 1–12.
2.
Fomin, Fedor V., Petr A. Golovach, & Dimitrios M. Thilikos. (2023). Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Information and Computation. 293. 105049–105049.
3.
Sau, Ignasi, et al.. (2023). k-apices of minor-closed graph classes. I. Bounding the obstructions. Journal of Combinatorial Theory Series B. 161. 180–227. 3 indexed citations
4.
Thilikos, Dimitrios M., et al.. (2023). On Strict Brambles. Graphs and Combinatorics. 39(2).
5.
Fomin, Fedor V., Petr A. Golovach, & Dimitrios M. Thilikos. (2018). On the Parameterized Complexity of Graph Modification to First-Order\n Logic Properties. arXiv (Cornell University). 2 indexed citations
6.
Fomin, Fedor V., et al.. (2018). Partial Complementation of Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
7.
Hunter, Paul, et al.. (2012). LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth. Discrete Applied Mathematics. 160(15). 2089–2097. 4 indexed citations
8.
Ito, Takehiro, Marcin Kamiński, Daniël Paulusma, & Dimitrios M. Thilikos. (2011). Parameterizing cut sets in a graph by the number of their components. Theoretical Computer Science. 412(45). 6340–6350. 3 indexed citations
9.
Rué, Juanjo, et al.. (2011). Outerplanar obstructions for a feedback vertex set. European Journal of Combinatorics. 33(5). 948–968. 5 indexed citations
10.
Dvořák, Zdenĕk, et al.. (2011). Forbidden graphs for tree-depth. European Journal of Combinatorics. 33(5). 969–979. 15 indexed citations
11.
Fomin, Fedor V., Daniel Lokshtanov, Saket Saurabh, & Dimitrios M. Thilikos. (2010). Bidimensionality and kernels. Symposium on Discrete Algorithms. 503–510. 59 indexed citations
12.
Fomin, Fedor V., Saket Saurabh, & Dimitrios M. Thilikos. (2008). Improving the gap of Erdös-Pósa property for minor-closed graph classes.. 2–6. 1 indexed citations
13.
Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2008). Catalan structures and dynamic programming in H-minor-free graphs. Symposium on Discrete Algorithms. 631–640. 26 indexed citations
14.
Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2006). Fast subexponential algorithm for non-local problems on graphs of bounded genus. 3 indexed citations
15.
Serna, Marı́a & Dimitrios M. Thilikos. (2005). Parameterized Complexity for Graph Layout Problems.. Bulletin of the European Association for Theoretical Computer Science. 86. 41–65. 12 indexed citations
16.
Demaine, Erik D., Fedor V. Fomin, MohammadTaghi Hajiaghayi, & Dimitrios M. Thilikos. (2004). Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. Symposium on Discrete Algorithms. 830–839. 48 indexed citations
17.
Fomin, Fedor V. & Dimitrios M. Thilikos. (2003). Dominating sets in planar graphs: branch-width and exponential speed-up. Symposium on Discrete Algorithms. 168–177. 26 indexed citations
18.
Fomin, Fedor V. & Dimitrios M. Thilikos. (2003). On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics. 131(2). 323–335. 24 indexed citations
19.
Thilikos, Dimitrios M., Marı́a Serna, & Hans L. Bodlaender. (2000). A Constructive linear time algorithm for small cutwidth. Data Archiving and Networked Services (DANS). 2 indexed citations
20.
Bodlaender, Hans L. & Dimitrios M. Thilikos. (1995). Treewidth and Small Separators for Graphs with Small Chordality. Utrecht University Repository (Utrecht University). 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Daniel Lokshtanov Breakdown of academic impact, for papers by Dieter Kratsch Breakdown of academic impact, for papers by Jayme L. Szwarcfiter Breakdown of academic impact, for papers by Saket Saurabh Breakdown of academic impact, for papers by Andrzej Proskurowski Breakdown of academic impact, for papers by Michał Pilipczuk Breakdown of academic impact, for papers by Ton Kloks Breakdown of academic impact, for papers by Guy Kortsarz Breakdown of academic impact, for papers by Josep Dı́az Breakdown of academic impact, for papers by Jeremy Spinrad
Rankless by CCL
2026