Dimitrios M. Thilikos

Author

National and Kapodistrian University of Athens

Also Known As

D. M. Thilikos, D.M. Thilikos, DIMITRIOS M THILIKOS, Dimitrios M Thilikos, Dimitrios M. Thilikos, Dimitrios Thilikos, Dimitrios M. Thilikos, Dimtirios M. Thilikos, Jean-Florent Raymond, Thilikos, Dimitrios

316

Publications

5.3K

Citations

H-Index

Concepts

All Affiliations

National and Kapodistrian University of Athens University of Bergen Universitat Politècnica de Catalunya Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier Utrecht University

About

Dimitrios M. Thilikos is an author at National and Kapodistrian University of Athens specializing in engineering, graph theory, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	33	53	3.7K
2	Education	14	17	757
3	Business	10	11	788
4	Arts	1	1	16
5	Natural Sciences	1	1	15

Dimitrios M. Thilikos

Publications

4.1K

Citations

H-Index

Page 1

	Year	Citations
An annotated bibliography on guaranteed graph searching Fedor V. Fomin, Dimitrios M. Thilikos Theoretical Computer Science EngineeringGraph TheoryData ScienceInformation RetrievalKnowledge Discovery	2008	323
Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Journal of the ACM Graph MinorEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2005	320
Invitation to fixed-parameter algorithms Dimitrios M. Thilikos Computer Science Review Mathematical ProgrammingEngineeringParameterized ComplexityParameterized AlgorithmFormal Methods	2007	319
Bidimensionality and kernels Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Symposium on Discrete Algorithms Mathematical ProgrammingComputational Complexity TheoryEngineeringComputational ComplexityFunctional Analysis	2010	158
(Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, EngineeringGraph TheoryLinear KernelsAlgebraic Graph TheoryStructural Graph Theory	2009	154
Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, ACM Transactions on Algorithms EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	2005	145
Evaluating Cooperation in Communities with the k-Core Structure Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis Cluster ComputingEngineeringCommunity MiningNetwork AnalysisK-core Structure	2011	120
(Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Journal of the ACM Parameterized ProblemGeometric Graph TheoryEngineeringGraph TheoryParameterized Complexity	2016	113
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up Fedor V. Fomin, Dimitrios M. Thilikos SIAM Journal on Computing Mathematical ProgrammingEngineeringPlanar GraphNetwork AnalysisEducation	2006	110
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Symposium on Discrete Algorithms Mathematical ProgrammingGraph MinorEngineeringGraph TheoryH-minor-free Graphs	2004	107

Page 1