Font size: Αα Αα Αα hide gadgets
You are here: Teachers » Dimitrios M. Thilikos

Dimitrios M. Thilikos

Photo of Thilikos

Dimitrios M. Thilikos

Member of the special inter-departmental committee
Member of the special inter-departmental committee
Member of the special inter-departmental committee
Email: sedthilk░| át-sign |░thilikos { periοd } info
Phone number: +30 2107276481
Office: Dept. Math. UoA, 303

courses given

Course Semester
Λ2. 2016-2017, fall semester
Λ2. 2015-2016, fall semester
Λ05Δ. 2014-2015, spring semester
Λ13Γ. 2013-2014, spring semester
Λ07Ν. 2012-2013, spring semester
Λ13Ν. 2012-2013, spring semester
Λ05Δ. 2012-2013, fall semester
Λ12Β. 2012-2013, fall semester
Λ05Δ. 2009-2010, fall semester
Λ07Ν. 2008-2009, spring semester
Λ2. 2008-2009, fall semester
Λ05Δ. 2008-2009, fall semester
Λ07Ν. 2007-2008, spring semester
Λ05Δ. 2007-2008, fall semester
Λ07Ν. 2006-2007, spring semester
Λ05Δ. 2006-2007, fall semester
Λ05Γ. 2005-2006, spring semester
17 courses.

seminars given

date title
2014/02/28 Optimal Erdős-Pósa proterties for θ_r minor models
2012/01/13 Graph minor theory: from combinatorics to algorithms
2010/03/30 Kernelization and meta-algorithmic techniques
2009/12/04 Bidimensionality, contractions and applications in parametrized complexity
2007/06/08 Graph searching in a crime wave (joint work with D. Richerby)
2006/04/14 Using submodular functions to generate with parameters: the issues of monotonicity and connectivity
2004/10/15 Wagner's conjecture and its proof: A short description of the theory of minor graphs, II
2004/10/08 Wagner's conjecture and its proof: A short description of the theory of minor graphs, I
2003/10/31 The theory of minor graphs and its use in the design of subexponential parametric algorithms
2003/06/20 Retreat is futile when you want to take over the world
10 seminars.

MSc theses supervised

title student defense
Παραμετρικοί Αλγόριθμοι και Μητροειδή η χρήση των συνόλων αντιπροσώπευσης Maria Petropanagiotaki 2016-11-04
An Alternative Proof for the NP-completeness of the Grid Subgraph Problem Dimitrios Chatzidimitriou 2016-10-04
Αποσυνθέσεις σφαιρικών τομών και σύνολα κυριαρχίας σε επίπεδα γραφήματα Michael Samaris 2016-06-24
Asymptotic analysis of outerplanar graphs with subgraph obstructions Vasiliki Velona 2016-06-24
Linkages in primal-dual graphs Spyridon Maniatis 2016-06-03
Obstructions and Algorithms for Graph Searching Problems Dimitris Zoros 2014-02-04
On the computability of obstruction sets for well-quasi-ordered graph classes Iosif Salem 2012-09-17
Variants of Stable Marriage, algorithms, complexity and structural properties Georgios Stathopoulos 2011-12-05
Kernelization algorithms on planar graphs Georgios Askalidis 2011-05-30
Treewidth and Proper Treewidth Pavlos Ιoannis Pyrros Chaidos 2011-03-01
Using the color-coding method in Parametric Algorithms design C. Sdrakas 2010-03-01
Tree-depth of Graphs: Characterisations and Obstructions Archontia Giannopoulou 2009-06-11
Parameters and Problems on Graph Layouts I. Rokos 2009-02-01
Whitney's Theorem Grigorios Galiatsatos 2008-07-01
Elements of parametric complexity K. Papanikolaou 2008-05-01
Bidimensionality and Graph Decompositions Athanasios Koutsonas 2008-03-01
Succintness of logics on trees V. Nikas 2007-12-01
17 MSc theses.


Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.