LAMSADE
Giannakos Aristotelis
Full Professor
Publications
Articles
Ausiello G., Boria N., Giannakos A., Lucarelli G., Paschos V. (2012), Online maximum k-coverage, Discrete Applied Mathematics, vol. 160, n°13-14, p. 1901-1913 
Bourgeois N., Giannakos A., Lucarelli G., Milis I., Paschos V., Pottié O. (2012), The max quasi-independent set problem, Journal of Combinatorial Optimization, vol. 23, n°1, p. 94-117
Bourgeois N., Ausiello G., Paschos V., Giannakos A. (2009), Greedy algorithms for on-line set-covering, Algorithmic Operations Research, vol. 4, n°1, p. 36-48
Communications avec actes
Giannakos A., Hifi M., Kheffache R., Ouafi R. (2013), An Approximation Algorithm for the Three Depots Hamiltonian Path Problem, in Athanasios Migdalas, Angelo Sifaleras, Christos K. Georgiadis, Jason Papathanasiou, Emmanuil Stiakakis, Optimization Theory, Decision Making, and Operations Research Applications. Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research, Springer, 351-359 p.
Monnot J., Giannakos A., Gourvès L., Paschos V. (2007), On the performance of congestion games for optimum satisfiability problems, in Graham, Fan Chung, Internet and Network Economics 3rd International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, San Diego, Springer, 598 p.
Prépublications / Cahiers de recherche
Giannakos A., Kheffache R. (2012), A Note on Using T-joins to Approximate Solutions for min Graphic k-Path TSP, Paris, Cahiers du LAMSADE, 11 p.
Giannakos A., Paschos V. (2006), Un tour d'horizon sur quelques classes de jeux combinatoires, Paris, Cahiers du LAMSADE, 22 p.