Office: I11
Tel/Fax: +30 210 727 5139 / 5114
E-mail: mliazi AT di DOT uoa DOT gr
Short Resume
Ph.D. in Computer Science Department of Informatics and Telecommunications, University of Athens
Dissertation Title: Approximation schemes, Cliques, Colors & Densest subgraphs
(in Greek, abstract)
Supervisor: Prof. Vassilis Zissimopoulos
M.Sc. in Logic, Algorithms and Computation
Department of Mathematics, University of Athens
M.Sc. Thesis: The k-densest subgraph problem (in Greek)
B.S. ("Ptychion") in Mathematics Department of Mathematics, University of Patras
Research Interests
Algorithms and Complexity
Combinatorial Optimization
Approximation Algorithms
Graph Theory
Publications
M. Liazi, I. Milis, V. Zissimopoulos. A constant approximation algorithm for the densest k-subgraph
problem on chordal graphs,
Information Processing Letters, Vol. 108, No 1, pages 29-32, 2008 (pdf)
M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos. The densest k-subgraph problem on clique graphs,
Journal of Combinatorial Optimization, Vol. 14, No 4, pages 465-474, 2007 (pdf)
M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos. The densest k-subgraph problem on clique graphs,
International Combinatorics, Geometry and Computer Science
Conference, Marseille, 2007 (slides)
M. Liazi, I. Milis, V. Zissimopoulos. Polynomial Variants of the Densest/Heaviest k-Subgraph Problem,
20th British Combinatorial Conference, Durham, 2005 (slides)
M. Liazi, I. Milis, V. Zissimopoulos. The densest k-subgraph problem on chordal graphs,
2nd Athens Colloquium on Algorithms and Complexity, Athens, 2007 (slides)
M. Liazi, I. Milis, V. Zissimopoulos. Polynomial variants of the Densest/Heaviest k-subgraph problem,
APPOL II, Final Workshop on Approximation and on line Algorithms, Athens, 2004 (slides)
