Pas de modifications possibles

 Fanny Pascual 

MdC groupe : RO Membre permanent Bureau : 434 Tél : 0144277371 Fax : 0144278889 Mail : Url : http://www-poleia.lip6.fr/~pascualf/

Algorithme approché	Ordonnancement	Optimisation	Recherche Opérationnelle
Théorie des jeux algorithmique

C. Bazgan, L. Gourvès, J. Monnot et F. Pascual (à paraître) "Single approximation for Biobjective Max TSP". In 9th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, Springer. Download: waoa11.pdf

	P. F. Dutot, F. Pascual, K. Rzadca et D. Trystram (2011) "Approximation algorithms for the Multi-Organization Scheduling Problem". IEEE Transactions on Parallel and Distributed Systems , Vol 22, N°11, pp. 1888--1895. Download: tpds.pdf
	B. Escoffier, L. Gourvès, K. T. Nguyen, F. Pascual et O. Spanjaard (2011) "Strategy-proof Mechanisms for Facility Location Games with Many Facilities". In 2nd International Conference on Algorithmic Decision Theory (ADT'11), Lecture Notes in Computer Science, Vol 6992, pp. 67--81, Springer. Download: ADT11b.pdf
	B. Escoffier, L. Gourvès, K. T. Nguyen, F. Pascual et O. Spanjaard (2011) "Algorithmes à véracité garantie pour le placement d'installations sur une ligne". In 12ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2011), Saint-Etienne.
	C. Bazgan, L. Gourvès, J. Monnot et F. Pascual (2011) "On the approximation of multiple criteria Max-TSP". In 21st International Conference on Multiple Criteria Decision Making, Jyväskylä, Finland. Download: mcdm.pdf

	F. Diedrich, K. Jansen, F. Pascual et D. Trystram (2010) "Approximation Algorithms for Scheduling with Reservations". Algorithmica, Vol 58, N°2, pp. 391--404. Download: algorithmica09.pdf
	S. Kedad-Sidhoum, F. Pascual et P. Fouilhoux (2010) "Ordonnancement de paquets dans les réseaux sans fil". In 11ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision.
	J. Cohen et F. Pascual (2010) "Placement de tâches par des agents individualistes sur des machines distribuées". In 11ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision.

	E. Angel, E. Bampis, F. Pascual et A.-A. Tchetgnia (2009) "On truthfulness and approximation for scheduling selfish tasks". Journal of Scheduling, Vol 12, N°5, pp. 437--445.
	F. Pascual, K. Rzadca et D. Trystram (2009) "Cooperation in Multi-Organization Scheduling". Concurrency and Computation: Practice and Experience, Vol 21, N°7, pp. 905--921. Download: conc-comp.pdf
	L. Gourvès, J. Monnot et F. Pascual (2009) "Problème d'affectation entre plusieurs organisations". In 10ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision. Download: roadef09.pdf

	E. Angel, E. Bampis et F. Pascual (2008) "The impact of local policies on the quality of packet routing in paths, trees, and rings". Journal of Scheduling, Vol 11, N°5, pp. 311--322. Download: josh08.pdf
	E. Angel, E. Bampis et F. Pascual (2008) "An exponential (matching based) neighborhood for the Vehicle Routing Problem". Journal of Combinatorial Optimization, Vol 15, N°2, pp. 179--190. Download: joco08.pdf
	E. Angel, E. Bampis et F. Pascual (2008) "How good are SPT schedules for fair optimality criteria". Annals of Operations Research, Vol 159, N°1, pp. 53--64. Download: aor08.ps
	L. Gourvès, J. Monnot et F. Pascual (2008) "Cooperation in Multiorganization Matching". In 6th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, Vol 5426, pp. 78--91, Springer. Download: waoa_final.pdf

	E. Angel, E. Bampis et F. Pascual (2007) "Algorithmic Game Theory and Scheduling". In Handbook of Approximation Algorithms and Metaheuristics. Teofilo Gonzalez (eds), pp. 1001--1020, Chapman & Hall.
	M. Liazi, I. Milis, F. Pascual et V. Zissimopoulos (2007) "The k-densest Subgraph Problem in Pairwise Overlapping Cliques". Journal of Combinatorial Optimization, Vol 14, N°3, pp. 465--474. Download: joco07.pdf
	E. Angel, E. Bampis, F. Pascual et A.-A. Tchetgnia (2007) "On the Truthfulness and the Approximation for Scheduling Selfish Tasks". In 19th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 196--197. Download: spaa07.ps
	F. Pascual, K. Rzadca et D. Trystram (2007) "Cooperation in Multi-Organization Scheduling". In 13th European Conference on Parallel and Distributed Computing, Lecture Notes in Computer Science, Vol 4641, pp. 224--233, Springer. Download: europar07.pdf
	G. Christodoulou, L. Gourvès et F. Pascual (2007) "Scheduling Selfish Tasks: About the Performance of Truthful Algorithms". In 13th International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol 4598, pp. 187--197, Springer. Download: cocoon07.pdf
	F. Diedrich, K. Jansen, F. Pascual et D. Trystram (2007) "Approximation Algorithms for Scheduling with Reservations". In International Conference on High Performance Computing, Lecture Notes in Computer Science, Vol 4873, pp. 297--307. Download: hipc07.pdf

	E. Angel, E. Bampis et F. Pascual (2006) "Truthful algorithms for scheduling selfish tasks on parallel machines". Theoretical Computer Science, Vol 369, pp. 157--168. Download: tcs06.pdf
	E. Angel, E. Bampis et F. Pascual (2006) "The price of approximate stability for scheduling tasks on two links". In 12th European Conference on Parallel and Distributed Computing, Lecture Notes in Computer Science, Vol 4128, pp. 157--166, Springer. Download: europar06.ps

	E. Angel, E. Bampis et F. Pascual (2005) "Truthful algorithms for scheduling selfish tasks on parallel machines". In 1st Workshop on Internet and Network Economics, Lecture Notes in Computer Science, Vol 3828, pp. 698--707, Springer. Download: wine05.ps
	E. Angel, E. Bampis et F. Pascual (2005) "How good are SPT schedules for fair optimality criteria". In Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 244--257. Download: mista05.pdf

E. Angel, E. Bampis et F. Pascual (2004) "Traffic grooming in a passive star WDM network". In 11th Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, Vol 3104, pp. 1--12, Springer. Download: sirocco04.pdf