Aristotelis Giannakos

Maître de conférences
Graphes - Algorithmique - Optimisation combinatoire - Complexité

Biographie
  • 1992 : Diplôme d’ingénieur, Ecole Polytechnique d’Athènes
  • 1997 : Doctorat (S. 27), Université Paris-sud (Orsay)
  • 1998 : Maitre de Conférences, Université de Picardie Jules Verne

Encadrement de thèses

 O. Pottié, soutenue en octobre 2010, Université Paris-Dauphine (co-direction avec V. Th. Paschos)

Dernières publications

BOOK CHAPTERS

  • [L5] A. Giannakos, V. Th. Paschos, Algorithmic games, in V. Th. Paschos (ed.) Combinatorial Optimization Volume 2, Paradigmatic Problems and New Approaches, Wiley-ISTE, London, 2010.
  • [L4] A. Giannakos, Location problems, in V. Th. Paschos (ed.) Combinatorial Optimization Volume 2, Paradigmatic Problems and New Approaches, Wiley-ISTE, London, 2010.
  • [L3] G. Ausiello, A. Giannakos, V. Th. Paschos, Online models for set-covering: the flaw of greediness, in V. Th. Paschos (ed.) Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives, Wiley – ISTE, London, 2008.
  • [L2] A. Giannakos, V. Th. Paschos, Une vision algorithmique de la théorie des jeux, in V.Th. Paschos (ed.) Optimisation Combinatoire Volume 5 : problèmes paradigmatiques et nouvelles problématiques, Hermès-Lavoisier, Paris, 2007.
  • [L1] A. Giannakos, Localisation de ressources, in V.Th. Paschos (ed.) Optimisation Combinatoire Volume 4 : problèmes paradigmatiques, Hermès-Lavoisier, Paris, 2007.

JOURNAL PAPERS

  • [AS] A. Giannakos, G. Karagiorgos, Data Delivery by Mobile Agents over a Fixed Path. (Article soumis).
  • [A9] A. Giannakos, M. Hifi, R. Kheffache, R. Ouafi, An Approximation Algorithm for the k-fixed Depots Problem, Computers and Industrial Engineering 111(C), 201, pp 50-55.
  • [A8] N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.Th. Paschos, Exact and superpolynomial approximation algorithms for the densest k-subgraph problem, European Journal of Operational Research, Elsevier, 262(3), 2017, pp 894-903.
  • [A7] G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, V. Th. Paschos, Online maximum k-coverage, Discrete Applied Mathematics, 160(13-14), 2012, pp 1901-1913 .
  • [A6] N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.Th. Paschos, O. Pottié, The Max Quasi-Independent Set Problem, Journal of Combinatorial Optimization 23(1), 2011, pp 94-117. [A5] G. Ausiello, N. Bourgeois, A. Giannakos, V.Th. Paschos, Greedy algorithms for on-line set-covering, Algorithmic Operations Research, 4(1), 2009, pp 36-48.
  • [A4] A. Giannakos, O. Pottié, Approximate solutions of Happynet on Cubic Graphs, Foundations of Computing and Decision Systems 31(3-4), 2006, pp 233-241.
  • [A3] E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis, Perfect Matching in General vs. Cubic Graphs: A Note on Planar and Bipartite Cases, RAIRO – Theoretical Informatics and Applications, 34(2), 2000, pp 87-98.
  • [A2] E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis, A Parallel Algorithm for finding a Perfect Matching in a Planar Graph, Parallel Processing Letters 8(3), 1998, pp 399-405.
  • [A1] E. Bampis, A. Giannakos, J-C. König, On the Complexity of Scheduling with Large Communication Delays, European Journal of Operations Research 94(2), 1996, pp 252-260.

CONERENCE PAPERS

  • [C9] A. Giannakos, M. Hifi, R. Kheffache, R. Ouafi, Using T-joins to Approximate Solutions for min-Graphic k-Path TSP, 21th BALCOR, Belgrade, Serbia, September 711, 2013. Proceedings (N.Mladenovic, G. Savic, eds.), University of Belgrade Press, 2014, pp 33-38.
  • [C8] N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.Th. Paschos, Exact and approximation algorithms for densest k-subgraph. WALCOM: Algorithms and Computation 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (T. Tokuyama, ed.), LNCS 7748, Springer, 2013, pp 114-125.
  • [C7] A. Giannakos, M. Hifi, R. Kheffache, R. Ouafi, An approximation algorithm for the Three Depots Hamiltonian Path Problem. 19th BALCOR, Thessaloniki, Greece, September 22-24, 2011. Proceedings in Mathematics and Statistics 31 (A. Migdalas, A. Sifaleras, eds.), Springer, 2013, pp 351-359.
  • [C6] G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, V. Th. Paschos, On the online maximum k-coverage, FCT 2011. Proceedings LNCS 6914, Springer, 2011, pp 181-192.
  • [C5] N. Bourgeois, A. Giannakos, I. Milis, V.Th. Paschos, G. Lucarelli, O. Pottié, The Max Quasi-Independent Set Problem. In Computer Science – Theory and Applications 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings (F. Ablayev, E.W. Mayr, eds.), LNCS 6072, Springer, 2010, pp 60-71.
  • [C4] A. Giannakos, G. Karagiorgos, I. Stavrakakis, A message-optimal sink mobility model for Wireless Sensor Networks, Eighth International Conference on Networks, Cancún, Mexico, March 1-6, 2009, Proceedings (R. Bestak, L. George, eds.), IEEEXplore, 2009, pp 287-291.
  • [C3] A. Giannakos, L. Gourvès, J. Monnot, V. Th. Paschos, On the performance of congestiongames for optimum satisfiability problems, WINE’07. Proceedings (X. Deng, F.C. Graham, eds.) LNCS 4858, Springer, 2007, pp 220-231.
  • [C2] G. Ausiello, A. Giannakos, V.Th. Paschos, Greedy Algorithms for online Set Covering, CATS06, Hobart, Australia, January 16-19, 2006. Proceedings of the Australasian Theory Symposium vol 51 (J. Gudmundsson, B. Jay, eds.), Australian Computer Society, 2006, pp 145-151.
  • [C1] A. Giannakos, J-C. König, A. Munier. On the Cyclic Scheduling Problem with Small Communication Delays, EUROPAR-96, August 27-29, Lyon. Proceedings LNCS 1124, Springer, 1996, pp 578-581. MISC. CONFERENCES
  • [c5] A. Giannakos, Efficient Approximation, ISOR 2011, USTHB, Algiers, Algeria, May 30-June 2, 2011.
  • [c4] A. Giannakos, O. Pottié, Tsetlin Automata heuristics for Happynet and general Clustering Games, EURO XXII, Prague, 2007.
  • [c3] A.Giannakos, O.Pottié, Polynomial algorithms for approximate solutions of HAPPYNET on cubic graphs, EARO, Tours, November 2003.
  • [c2] A. Giannakos, O. Pottié, Tsetlin automata for the game of HAPPYNET. NPPAR03, La Colle sur Loup, October 2003.
  • [c1] E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis. Some new results on Matchings. Conference on Combinatorics and Comp.Sci. (CCS-95), Brest, July 3-5, 1995.

PROJECTS

  • -SODEAL Institut Henri Poincaré, 2016-
  • -GDR RO Réoptimisation 2014-
  • -Coopération bilatérale de recherche UPJV-USTHB (Algérie), 2013-
  • -ADEME Logistique Mutualisée Durable, 2011-2015-
  • -ANR Time versus Optimality in Discrete Optimisation, 2009-2013

COLLABORATIONS

  • Université de Paris I, ENSIMAG (Grenoble), University of Athens, Università La Sapienza (Rome), USTHB (Algérie), RMIT (Australie).