Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Aristotelis Giannakos

Email : Giannakos.Aristotelis@lamsade.dauphine.fr

Pole : Optimisation combinatoire algorithmique
Status : Externe



Publications DFIS


7 Exact and approximation algorithms for densest k-subgraph (, , , and ), In WALCOM: Algorithms and Computation 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (Tokuyama, Takeshi, ed.), Springer, . [bibtex]

6 A Note on Using T-joins to Approximate Solutions for min Graphic k-Path TSP ( and ), Technical report, Cahiers du Lamsade, . [bibtex]

5 The max quasi-independent set problem (, , , , and ), In Journal of Combinatorial Optimization, volume 23, . [bibtex] [doi]

4 Online maximum k-coverage (, , , and ), In Discrete Applied Mathematics, volume 160, . [bibtex] [doi]

3 Online Maximum k-Coverage (, , , and ), In Fundamentals of Computation Theory, FCT 2011 (Steffen, Martin, ed.), Springer, . [bibtex]

2 The Max Quasi-Independent Set Problem (, , , , and ), In Computer Science – Theory and Applications 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings (Mayr, Ernst W., ed.), Springer, . [bibtex]

1 Greedy algorithms for on-line set-covering (, , and ), In Algorithmic Operations Research, volume 4, . [bibtex]

Publications HAL