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


Publications HAL


12 Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problem (, , , and ), In European Journal of Operational Research, Elsevier, volume 262, . [bibtex] [pdf] [doi]

11 A Note on Using T-joins to Approximate Solutions for min Graphic k-Path TSP ( and ), . [bibtex] [pdf]

10 Exact and approximation algorithms for densest k-subgraph (, , , and ), . [bibtex] [pdf]

9 Online maximum k-coverage (, , , and ), . [bibtex] [pdf]

8 The max quasi-independent set problem (, , , , and ), . [bibtex] [pdf]

7 A message-optimal sink mobility model for Wireless Sensor Networks (, and ), . [bibtex] [pdf]

6 A message-optimal sink mobility model for Wireless Sensor Networks (, and ), . [bibtex] [pdf]

5 On the performance of congestion games for optimum satistiability problems (, , and ), . [bibtex] [pdf]

4 Un tour d'horizon sur quelques classes de jeux combinatoires (juin 2006) ( and ), . [bibtex] [pdf]

3 Greedy algorithms for on-line set-covering (, and ), . [bibtex] [pdf]

2 Un tour d'horizon sur quelques classes de jeux combinatoires ( and ), . [bibtex] [pdf]

1 On-line models for set-covering: the power of greediness (, and ), . [bibtex] [pdf]