Travelled to:1 × China
1 × Finland
1 × France
1 × Italy
1 × Poland
1 × Switzerland
1 × The Netherlands
Collaborated with:F.V.Fomin H.L.Bodlaender J.Rué I.Sau F.Dorn C.Giatsidis K.Berberich M.Vazirgiannis E.D.Demaine M.T.Hajiaghayi I.Adler S.G.Kolliopoulos P.K.Krause D.Lokshtanov S.Saurabh
Talks about:graph (6) algorithm (4) parameter (2) surfac (2) planar (2) linear (2) subexponenti (1) branchwidth (1) degeneraci (1) exponenti (1)
Person: Dimitrios M. Thilikos
DBLP: Thilikos:Dimitrios_M=
Contributed to:
2012
201120102007200420031997Wrote 7 papers:
- KDD-2012-GiatsidisBTV #collaboration #graph #network #visual notation
- Visual exploration of collaboration networks based on graph degeneracy (CG, KB, DMT, MV), pp. 1512–1515.
- ICALP-v1-2011-AdlerKKLST #bound #graph
- Tight Bounds for Linkages in Planar Graphs (IA, SGK, PKK, DL, SS, DMT), pp. 110–121.
- ICALP-v1-2010-RueST #graph #programming
- Dynamic Programming for Graphs on Surfaces (JR, IS, DMT), pp. 372–383.
- ICALP-2007-DornFT #algorithm
- Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.
- ICALP-2004-FominT #algorithm #exponential #graph #kernel #linear #performance
- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
- ICALP-2003-DemaineFHT #algorithm #graph #parametricity
- Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.
- ICALP-1997-BodlaenderT #algorithm #linear
- Constructive Linear Time Algorithms for Branchwidth (HLB, DMT), pp. 627–637.