World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
7948
World Ranking
6554
National Ranking
43

Mathematics

D-Index
47
Citations
7906
World Ranking
1288
National Ranking
5

Overview

Dimitrios M. Thilikos is affiliated with the National and Kapodistrian University of Athens in Greece. Their research primarily spans the fields of Computer Science and Mathematics, with a strong focus on Computational Theory and Mathematics. Their body of work encompasses several subfields including Computer Networks and Communications, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, and Geometry and Topology.

The main topics covered in their research include Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Computational Geometry and Mesh Generation, Limits and Structures in Graph Theory, Optimization and Search Problems, Graph Theory and Applications, and Formal Methods in Verification.

Their recent papers include the following:

  • k-apices of minor-closed graph classes. II. Parameterized algorithms (2020) published in arXiv (Cornell University)
  • k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms (2022) published in ACM Transactions on Algorithms
  • Subgraph Complementation (2020) published in Algorithmica
  • k-apices of minor-closed graph classes. I. Bounding the obstructions (2023) published in Journal of Combinatorial Theory Series B
  • Bidimensionality and Kernels (2020) published in SIAM Journal on Computing

The frequent co-authors of Dimitrios M. Thilikos are:

  • Giannos Stamoulis
  • Petr A. Golovach
  • Sebastian Wiederrecht
  • Ignasi Sau
  • Fedor V. Fomin

Major publication venues for their work include:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • Discrete Applied Mathematics
  • Journal of Computer and System Sciences
  • ACM Transactions on Algorithms

Best Publications

  • An annotated bibliography on guaranteed graph searching

    Fedor V. Fomin;Dimitrios M. Thilikos

  • Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

    Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

  • Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

    Fedor V. Fomin;Dimitrios M. Thilikos

  • Bidimensionality and kernels

    Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh;Dimitrios M. Thilikos

  • Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

    Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

  • Fugitive-search games on graphs and related parameters

    Nick D. Dendris;Nick D. Dendris;Lefteris M. Kirousis;Lefteris M. Kirousis;Dimitrios M. Thilikos;Dimitrios M. Thilikos

  • Meta) Kernelization

    Hans L. Bodlaender;Fedor V. Fomin;Daniel Lokshtanov;Eelko Penninkx

  • D-cores: measuring collaboration of directed graphs based on degeneracy

    Christos Giatsidis;Dimitrios M. Thilikos;Michalis Vazirgiannis;Michalis Vazirgiannis;Michalis Vazirgiannis

  • Evaluating Cooperation in Communities with the k-Core Structure

    Christos Giatsidis;Dimitrios M. Thilikos;Michalis Vazirgiannis

  • Parameterized complexity of finding regular induced subgraphs

    Hannes Moser;Dimitrios M. Thilikos

  • Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

    Erik D. Demaine;Fedor V. Fomin;MohammadTaghi Hajiaghayi;Dimitrios M. Thilikos

  • Bidimensional Parameters and Local Treewidth

    Erik D. Demaine;Fedor V. Fomin;Mohammad Taghi Hajiaghayi;Dimitrios M. Thilikos

  • Constructive Linear Time Algorithms for Branchwidth

    Hans L. Bodlaender;Dimitrios M. Thilikos

  • Searching Is Not Jumping

    Lali Barrière;Pierre Fraigniaud;Nicola Santoro;Dimitrios M. Thilikos

  • Meta) Kernelization

    Hans L. Bodlaender;Fedor V. Fomin;Daniel Lokshtanov;Eelko Penninkx

  • On Graph Powers for Leaf-Labeled Trees

    Naomi Nishimura;Prabhakar Ragde;Dimitrios M. Thilikos

  • Treewidth for graphs with small chordality

    Hans L. Bodlaender;Dimitrios M. Thilikos

  • Cutwidth I: a linear time fixed parameter algorithm

    Dimitrios M. Thilikos;Maria Serna;Hans L. Bodlaender

  • Algorithms and obstructions for linear-width and related search parameters

    Dimitrios M. Thilikos

  • Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

    M. R. Fellows;C. Knauer;N. Nishimura;P. Ragde

  • Book review: Invitation to fixed-parameter algorithms

    Dimitrios M. Thilikos

  • Subexponential parameterized algorithms

    Frederic Dorn;Fedor V. Fomin;Dimitrios M. Thilikos

Frequent Co-Authors

Fedor V. Fomin
Fedor V. Fomin University of Bergen
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Daniël Paulusma
Daniël Paulusma Durham University
Christophe Paul
Christophe Paul University of Montpellier
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Michalis Vazirgiannis
Michalis Vazirgiannis École Polytechnique
Michael R. Fellows
Michael R. Fellows Lebanese American University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring complementary online degrees can broaden career opportunities and enhance skill sets. Many professionals turn to business-focused programs to apply mathematical expertise in real-world scenarios.

For example, pursuing one of the cheapest aacsb online dba programs offers a cost-effective path to advanced leadership roles combining data analytics and strategic decision-making.

Finance is another popular option, where an advanced understanding of Mathematics is highly beneficial. Students can choose among the best online masters in finance programs that provide essential skills in quantitative analysis and financial modeling.

For those interested in business management, the fastest online mba programs allow mathematically skilled candidates to quickly transition into leadership and executive roles.

Marketing professionals also benefit from data-driven approaches. The marketing masters programs offer affordable options that emphasize analytics, helping graduates leverage numbers for smarter marketing strategies.

Best Scientists Citing Dimitrios M. Thilikos

Trending Scientists

Recently Published Articles