2012

Articles

• Paschos, Vangelis ; Lucarelli, Giorgio ; Giannakos, Aristotelis ; Boria, Nicolas ; Ausiello, Giorgio . Online maximum k-coverage. Discrete Applied Mathematics. Volume 160. n° 13-14. 2012. pages 1901-1913. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2012.04.005.
• Milis, Ioannis ; Paschos, Vangelis ; Pottié, Olivier ; Giannakos, Aristotelis ; Lucarelli, Giorgio ; Bourgeois, Nicolas . The max quasi-independent set problem. Journal of Combinatorial Optimization. Volume 23. n° 1. 2012. pages 94-117. Springer. DOI http://dx.doi.org/10.1007/s10878-010-9343-5.

Working Papers

• Bourgeois, Nicolas ; Giannakos, Aristotelis ; Lucarelli, Giorgio ; Milis, Ioannis ; Paschos, Vangelis . Exact and approximation algorithms for densest k-subgraph. Université Paris-Dauphine . 2012 .

2011

Conference Contributions

• Paschos, Vangelis ; Lucarelli, Giorgio ; Giannakos, Aristotelis ; Boria, Nicolas ; Ausiello, Giorgio . Online Maximum k-Coverage. Fundamentals of Computation Theory, FCT 2011. Berlin. Norvège. 2011.

2010

Conference Contributions

• Pottié, Olivier ; Paschos, Vangelis ; Milis, Ioannis ; Lucarelli, Giorgio ; Giannakos, Aristotelis ; Bourgeois, Nicolas . The Max Quasi-Independent Set Problem. Computer Science – Theory and Applications 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Berlin. Russie. 2010.

2009

Articles

• Paschos, Vangelis ; Ausiello, Giorgio ; Bourgeois, Nicolas ; Giannakos, Aristotelis . Greedy algorithms for on-line set-covering. Algorithmic Operations Research. Volume 4. n° 1. 2009. pages 36-48. Preeminent Academic Facets Inc..

Conference Contributions

• Giannakos, Aristotelis ; Karagiorgos, Gregory ; Stavrakakis, Ioannis . A message-optimal sink mobility model for Wireless Sensor Networks. Eighth International Conference on Networks. Gosier (Guadeloupe). France. 2009.

2008

Book chapters

• Paschos, Vangelis ; Giannakos, Aristotelis ; Pottié, Olivier . Algorithmic games. Paschos, Vangelis. Combinatorial optimization and theoretical computer science: interfaces and perspectives. . 2008. pages 327-360.
• Paschos, Vangelis ; Giannakos, Aristotelis ; Ausiello, Giorgio . Online models for set-covering: the flaw of greediness. Paschos, Vangelis. Combinatorial optimization and theoretical computer science: interfaces and perspectives : 30th anniversary of the LAMSADE. London. 2008. pages 65-85.

2007

Book chapters

• Giannakos, Aristotelis . Localisation de ressources. V.Th. Paschos. Optimisation combinatoire 4 : problèmes paradigmatiques (Traité IC2, série informatique et systèmes d'information). Paris. 2007. pages 89-115.
• Paschos, Vangelis ; Giannakos, Aristotelis . Quand l'optimisation fait du beau jeu : une vision algorithmique de la théorie des jeux. Paschos, Vangelis. Optimisation combinatoire 5 : problèmes paradigmatiques et nouvelles problématiques. Paris. 2007. pages 207-240.

Conference Contributions

• Giannakos, Aristotelis ; Gourvès, Laurent ; Monnot, Jérôme ; Paschos, Vangelis . On the performance of congestion games for optimum satisfiability problems. Internet and Network Economics 3rd International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings. San Diego. États-Unis. 2007.

2006

Articles

• Pottié, Olivier ; Giannakos, Aristotelis . Approximate solutions of Happynet on cubic graphs. Foundations of Computing and Decision Sciences. Volume 31. n° 3-4. 2006. pages 233-242. Institute of Computing Science.

Conference Contributions

• Ausiello, Giorgio ; Giannakos, Aristotelis ; Paschos, Vangelis . Greedy algorithms for on-line set-covering and related problems. Twelfth Computing: The Australasian Theory Symposium (CATS'06). Hobart. Australie. 2006.

Working Papers

• Ausiello, Giorgio ; Giannakos, Aristotelis ; Paschos, Vangelis . On-line models for set-covering: the power of greediness. Université Paris-Dauphine . 2006 .
• Giannakos, Aristotelis ; Paschos, Vangelis . Un tour d'horizon sur quelques classes de jeux combinatoires. Université Paris-Dauphine . 2006 .