PASCUAL Fanny
Full Professor
Team : RO
Tel: +33 1 44 27 88 65, Fanny.Pascual (at) nulllip6.fr
https://perso.lip6.fr/Fanny.Pascual
Team : RO
- Sorbonne Université - LIP6
Boîte courrier 169
Couloir 26-00, Étage 4, Bureau 432
4 place Jussieu
75252 PARIS CEDEX 05
FRANCE
Tel: +33 1 44 27 88 65, Fanny.Pascual (at) nulllip6.fr
https://perso.lip6.fr/Fanny.Pascual
Four past PhD students (2013 - 2023) at Sorbonne University
- 2023
- DURAND Martin : Aspects axiomatiques et computationnels de problèmes d'optimisation discrète dans des contextes collectifs.
- 2022
- DOGEAS Konstantinos : Energy Minimisation, Data Movement and Uncertainty: models and algorithms.
- 2017
- PHOURATSAMAY Siao-Leu : Coordination des décisions de planification dans une chaîne logistique.
- 2013
- BLOGOWSKI Alexandre : Prise en compte des incertitudes dans le déploiement des réseaux mobiles LTE.
2007-2023 Publications
-
2023
- E. Bampis, A. Kononov, G. Lucarelli, F. Pascual : “Non-Clairvoyant Makespan Minimization Scheduling with Predictions”, 34th International Symposium on Algorithms and Computation (ISAAC 2023), vol. 283, Leibniz International Proceedings in Informatics (LIPIcs), Kyoto, Japan, pp. 9:1-9:15, (Schloss Dagstuhl – Leibniz-Zentrum fĂĽr Informatik) (2023)
-
2022
- Th. Ehrhard, S. Attias, E. Bampis, V. Cohen‑Addad, B. Escoffier, C. Mathieu, F. Pascual, A. Pass‑Lanneau, D. Saulpic : “DĂ©coupage Ă©lectoral des circonscriptions lĂ©gislatives en France: dĂ©sĂ©quilibres dĂ©mographiques et contraintes territoriales”, Revue Française de Science Politique, vol. Vol. 72 (3), pp. 333-364, (Presses de Sciences Po) (2022)
- M. Durand, F. Pascual, O. Spanjaard : “A Non-utilitarian Discrete Choice Model for Preference Aggregation”, Proceedings of the 15th Scalable Uncertainty Management conference (SUM 2022), vol. 13562, Lecture Notes in Computer Science, Paris, France, pp. 157-171, (Springer International Publishing) (2022)
- M. Durand, F. Pascual : “Collective Schedules: Axioms and Algorithms”, Symposium on Algorithmic Game Theory - SAGT 2022, vol. 13584, Lecture Notes in Computer Science, Colchester, United Kingdom, pp. 454-471, (Springer International Publishing) (2022)
- E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling with Untrusted Predictions”, Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}, Vienna, Austria, pp. 4581-4587, (International Joint Conferences on Artificial Intelligence Organization) (2022)
- M. Durand, F. Pascual : “Ordonnancements collectifs : Étude axiomatique et algorithmique”, 23e congrès annuel de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision, Villeurbanne - Lyon, France (2022)
-
2021
- E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Speed Scaling with Explorable Uncertainty”, SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, virtual conference, United States, pp. 83-93, (ACM) (2021)
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Coordination of a two-level supply chain with contracts”, 4OR: A Quarterly Journal of Operations Research, vol. 19 (2), pp. 235-264, (Springer Verlag) (2021)
- M. Durand, F. Pascual : “Efficiency and Equity in the Multiple Organization Scheduling Problem”, International Workshop on Project Management and Scheduling, Toulouse, France (2021)
- M. Durand, F. Pascual : “Efficiency and equity in the multi organization scheduling problem”, Theoretical Computer Science, vol. 864, pp. 103-117, (Elsevier) (2021)
-
2020
- E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling Malleable Jobs Under Topological Constraints”, 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Orleans, LA, United States, pp. 316-325, (IEEE) (2020)
-
2019
- F. Pascual : “Models and algorithms for combinatorial optimization problems of resource sharing between agents”, habilitation, phd defence 11/29/2019 (2019)
- F. Pascual, K. Rzadca : “Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management”, IEEE Transactions on Parallel and Distributed Systems, (Institute of Electrical and Electronics Engineers) (2019)
-
2018
- F. Pascual, K. Rzadca, P. Skowron : “Collective Schedules: Scheduling Meets Computational Social Choice”, Seventeenth International Conference on Autonomous Agents and Multiagent Systems, Stockholm, Sweden (2018)
- F. Pascual, K. Rzadca : “Colocating tasks in data centers using a side-effects performance model”, European Journal of Operational Research, vol. 268 (2), pp. 450-462, (Elsevier) (2018)
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Two-level lot-sizing with inventory bounds”, Discrete Optimization, vol. 30, pp. 1-19, (Elsevier) (2018)
-
2017
- F. Pascual, K. Rzadca : “Optimizing egalitarian performance in the side-effects model of colocation for data center resource management”, 23rd International European Conference on Parallel and Distributed Computing (Euro-Par 2017), Lectures Notes in Computer Science, Santiago de Compostela, Spain (2017)
- F. Pascual, K. Rzadca : “Optimizing egalitarian performance in the side-effects model of colocation for data center resource management”, 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2017), Seeon-Seebruck, Germany (2017)
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Mise en place de contrats pour la coordination d’une chaĂ®ne logistique Ă deux acteurs”, ROADEF 2017, 18e confĂ©rence de la sociĂ©tĂ© française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision, Metz, France (2017)
- L. Gourvès, J. Monnot, F. Pascual, D. Vanderpooten : “Bi-objective matchings with the triangle inequality”, Theoretical Computer Science, vol. 670, pp. 1-10, (Elsevier) (2017)
-
2016
- E. Angel, E. Bampis, F. Pascual, N. Thibault : “Truthfulness for the Sum of Weighted Completion Times”, Computing and Combinatorics, vol. 9797, Lecture Notes in Computer Science, Ho Chi Minh City, Viet Nam, pp. 15-26, (Springer Verlag) (2016)
- F. Pascual, O. Spanjaard : “Deux approches pour l’identification d’un axe politique gauche-droite Ă partir de donnĂ©es de votes par approbation”, 17e congrès annuel de la SociĂ©tĂ© française de recherche opĂ©rationnelle et d’aide Ă la dĂ©cision (ROADEF), Compiègne, France (2016)
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Designing contracts in a two-level supply chain with asymmetric information”, IWLS - International Workshop on Lot Sizing, Hanovre, Germany (2016)
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Two-level supply chain coordination under complete or asymmetric information”, ISCO - 4th International Symposium on Combinatorial Optimization, Salerne, Italy (2016)
-
2015
- F. Pascual, K. Rzadca : “Partition with side effects”, 22nd IEEE International Conference on High Performance Computing, HiPC 2015, Bengaluru, India, December 16-19, 2015, Bengaluru, India (2015)
- J. Cohen, F. Pascual : “Scheduling tasks from selfish multi-tasks agents.”, 21st International Conference on Parallel and Distributed Computing, vol. 9233, Lecture Notes in Computer Science, Vienna, Australia, pp. 183-195, (Springer) (2015)
- A. Blogowski, Ph. ChrĂ©tienne, F. Pascual : “Network sharing by two mobile operators: beyond competition, cooperation”, RAIRO - Operations Research, (EDP Sciences) (2015)
-
2014
- D. Ferraioli, L. Gourvès, S. Moretti, F. Pascual, O. Spanjaard : “Combinatorial Optimization with Competing Agents”, chapter in Paradigms of Combinatorial Optimization: Problems and New Approaches, 2nd Edition, Mathematics and Statistics Series, pp. 675-706, (Wiley-ISTE) (2014)
-
2013
- B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Truthful many-to-many assignment with private weights”, 8th International Conference on Algorithms and Complexity (CIAC 2013), vol. 7878, Lecture Notes in Computer Science, Barcelona, Spain, pp. 209-220, (Springer) (2013)
- C. Bazgan, L. Gourvès, J. Monnot, F. Pascual : “Single approximation for Biobjective Max TSP”, Theoretical Computer Science, vol. 478, pp. 41-50, (Elsevier) (2013)
- B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Algorithmes Ă vĂ©racitĂ© garantie pour des problèmes de b-couplage dans un graphe biparti”, 14e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision, ROADEF 2013, Troyes, France (2013)
-
2012
- A. Blogowski, F. Pascual, Ph. ChrĂ©tienne, A. Ouorou, M. Bouhtou : “Partage de rĂ©seau d’accès avec un autre opĂ©rateur mobile”, 13e confĂ©rence ROADEF, Angers, France, pp. 2 (2012)
- A. Blogowski, M. Bouhtou, Ph. ChrĂ©tienne, A. Ouorou, F. Pascual : “Partage de rĂ©seau d’accès entre deux opĂ©rateurs de rĂ©seaux mobiles”, 14es Rencontres Francophones sur les Aspects Algorithmiques des TĂ©lĂ©communications (AlgoTel), La Grande Motte, France, pp. 1-4 (2012)
- L. Gourvès, J. Monnot, F. Pascual : “Cooperation in Multiorganization Matching”, Algorithmic Operations Research, vol. 7 (2), pp. 111-124, (Preeminent Academic Facets) (2012)
-
2011
- B. Escoffier, L. Gourvès, K. Nguyen, F. Pascual, O. Spanjaard : “Strategy-proof Mechanisms for Facility Location Games with Many Facilities”, 2nd International Conference on Algorithmic Decision Theory (ADT'11), vol. 6992, Lecture Notes in Artificial Intelligence, Piscataway, NJ, United States, pp. 67-81, (Springer) (2011)
- C. Bazgan, L. Gourvès, J. Monnot, F. Pascual : “Single Approximation for Biobjective Max TSP”, 9th Workshop on Approximation and Online Algorithms, vol. 7164, Lecture Notes in Computer Science, SaarbrĂĽcken, Germany, pp. 49-62, (Springer) (2011)
- C. Bazgan, L. Gourvès, J. Monnot, F. Pascual : “On the approximation of multiple criteria Max-TSP”, 21st International Conference on Multiple Criteria Decision Making, Jyväskylä, Finland (2011)
- B. Escoffier, L. Gourvès, K. Nguyen, F. Pascual, O. Spanjaard : “Algorithmes Ă vĂ©racitĂ© garantie pour le placement d’installations sur une ligne”, 12e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2011), Saint-Etienne, France (2011)
- A. Blogowski, O. Klopfenstein, Ph. ChrĂ©tienne, F. Pascual : “Modèle simple pour la planification de capacitĂ© de liens dans les rĂ©seaux mobiles LTE”, 12e confĂ©rence ROADEF, Saint-Étienne, France, pp. 2 (2011)
- A. Blogowski, O. Klopfenstein, Ph. ChrĂ©tienne, F. Pascual : “Modèle de dimensionnement de liens dans les rĂ©seaux mobiles LTE”, 13es Rencontres Francophones sur les Aspects Algorithmiques de TĂ©lĂ©communications (AlgoTel), Cap EstĂ©rel, France (2011)
- P.‑F. Dutot, F. Pascual, K. Rzadca, D. Trystram : “Approximation Algorithms for the Multi-Organization Scheduling Problem”, IEEE Transactions on Parallel and Distributed Systems, vol. 22 (11), pp. 1888-1895, (Institute of Electrical and Electronics Engineers) (2011)
-
2010
- A. Blogowski, O. Klopfenstein, F. Pascual, Ph. ChrĂ©tienne : “Modèles de mobilitĂ© pour le dimensionnement de rĂ©seaux LTE”, MajecSTIC (MAnifestation des JEunes Chercheurs en Sciences et Technologies de l'Information et de la Communication), Bordeaux, France, pp. 8 (2010)
- S. Kedad‑Sidhoum, F. Pascual, P. Fouilhoux : “Ordonnancement de paquets dans les rĂ©seaux sans fil”, 11e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2010), Toulouse, France (2010)
- J. Cohen, F. Pascual : “Placement de tâches par des agents individualistes sur des machines distribuĂ©es”, 11e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2010), Toulouse, France (2010)
- F. Diedrich, K. Jansen, F. Pascual, D. Trystram : “Approximation algorithms for scheduling with reservations”, Algorithmica, vol. 58 (2), pp. 391-404, (Springer Verlag) (2010)
-
2009
- E. Angel, E. Bampis, F. Pascual, A.‑A. Tchetgnia : “On truthfulness and approximation for scheduling selfish tasks”, Journal of Scheduling, vol. 12 (5), pp. 437-445, (Springer Verlag) (2009)
- L. Gourvès, J. Monnot, F. Pascual : “Problème d’affectation entre plusieurs organisations”, 10e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2009), Nancy, France (2009)
- F. Pascual, K. Rzadca, D. Trystram : “Cooperation in Multi-Organization Scheduling”, Concurrency and Computation: Practice and Experience, vol. 21 (7), pp. 905-921, (Wiley) (2009)
-
2008
- L. Gourvès, J. Monnot, F. Pascual : “Cooperation in Multiorganization Matching”, 6th Workshop on Approximation and Online Algorithms, vol. 5426, Lecture Notes in Computer Science, Karlsruhe, Germany, pp. 78-91, (Springer) (2008)
- E. Angel, E. Bampis, F. Pascual : “How good are SPT schedules for fair optimality criteria”, Annals of Operations Research, vol. 159 (1), pp. 53-64, (Springer Verlag) (2008)
- E. Angel, E. Bampis, F. Pascual : “An exponential (matching based) neighborhood for the vehicle routing problem”, Journal of Combinatorial Optimization, vol. 15 (2), pp. 179-190, (Springer Verlag) (2008)
- E. Angel, E. Bampis, F. Pascual : “The impact of local policies on the quality of packet routing in paths, trees, and rings”, Journal of Scheduling, vol. 11 (5), pp. 311-322, (Springer Verlag) (2008)
-
2007
- M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos : “The k-densest Subgraph Problem in Pairwise Overlapping Cliques”, Journal of Combinatorial Optimization, vol. 14 (4), pp. 465-474, (Springer Verlag) (2007)
- E. Angel, E. Bampis, F. Pascual : “Algorithmic game theory and scheduling”, chapter in Handbook of Approximation algorithms and metaheuristics, pp. 1299-1318, (Chapman and Hall/CRC), (ISBN: 978-1584885504) (2007)