Traffic Grooming in a Passive Star WDM Network. - Eric Angel; Evripidis Bampis; Fanny Pascual (SIROCCO, 2004)

The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. - Eric Angel; Evripidis Bampis; Fanny Pascual (Euro-Par, 2006)

Truthful algorithms for scheduling selfish tasks on parallel machines. - Eric Angel; Evripidis Bampis; Fanny Pascual (Theor. Comput. Sci., 2006)

Optimisation dans les réseaux : de l'approximation polynomiale à la théorie des jeux. (Optimization in networks: from polynomial time approximation to game theory). - Fanny Pascual (2006)

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. - George Christodoulou 001; Laurent Gourvès; Fanny Pascual (COCOON, 2007)

The densest k-subgraph problem on clique graphs. - Maria Liazi; Ioannis Milis; Fanny Pascual; Vassilis Zissimopoulos (J. Comb. Optim., 2007)

Algorithmic Game Theory and Scheduling. - Evripidis Bampis; Eric Angel; Fanny Pascual (Handbook of Approximation Algorithms and Metaheuristics, 2007)

How good are SPT schedules for fair optimality criteria. - Eric Angel; Evripidis Bampis; Fanny Pascual (Ann. Oper. Res., 2008)

An exponential (matching based) neighborhood for the vehicle routing problem. - Eric Angel; Evripidis Bampis; Fanny Pascual (J. Comb. Optim., 2008)

The impact of local policies on the quality of packet routing in paths, trees, and rings. - Eric Angel; Evripidis Bampis; Fanny Pascual (J. Sched., 2008)

Cooperation in multi-organization scheduling. - Fanny Pascual; Krzysztof Rzadca; Denis Trystram (Concurr. Comput. Pract. Exp., 2009)

On truthfulness and approximation for scheduling selfish tasks. - Eric Angel; Evripidis Bampis; Fanny Pascual; Alex-Ariel Tchetgnia (J. Sched., 2009)

Approximation Algorithms for Scheduling with Reservations. - Florian Diedrich; Klaus Jansen; Fanny Pascual; Denis Trystram (Algorithmica, 2010)

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. - Bruno Escoffier; Laurent Gourvès; Kim Thang Nguyen; Fanny Pascual; Olivier Spanjaard (ADT, 2011)

Approximation Algorithms for the Multiorganization Scheduling Problem. - Pierre-François Dutot; Fanny Pascual; Krzysztof Rzadca; Denis Trystram (IEEE Trans. Parallel Distributed Syst., 2011)

Cooperation in multiorganization matching. - Laurent Gourvès; Jérôme Monnot; Fanny Pascual (Algorithmic Oper. Res., 2012)

Truthful Many-to-Many Assignment with Private Weights. - Bruno Escoffier; Jérôme Monnot; Fanny Pascual; Olivier Spanjaard (CIAC, 2013)

Single approximation for the biobjective Max TSP. - Cristina Bazgan; Laurent Gourvès; Jérôme Monnot; Fanny Pascual (Theor. Comput. Sci., 2013)

Scheduling Tasks from Selfish Multi-tasks Agents. - Johanne Cohen; Fanny Pascual (Euro-Par, 2015)

Partition with Side Effects. - Fanny Pascual; Krzysztof Rzadca (HiPC, 2015)

Network sharing by two mobile operators: beyond competition, cooperation. - Alexandre Blogowski; Philippe Chrétienne; Fanny Pascual (RAIRO Oper. Res., 2015)

Truthfulness for the Sum of Weighted Completion Times. - Eric Angel; Evripidis Bampis; Fanny Pascual; Nicolas Thibault (COCOON, 2016)

Optimizing Egalitarian Performance in the Side-Effects Model of Colocation for Data Center Resource Management. - Fanny Pascual; Krzysztof Rzadca (Euro-Par, 2017)

Bi-objective matchings with the triangle inequality. - Laurent Gourvès; Jérôme Monnot; Fanny Pascual; Daniel Vanderpooten (Theor. Comput. Sci., 2017)

Collective Schedules: Scheduling Meets Computational Social Choice. - Fanny Pascual; Krzysztof Rzadca; Piotr Skowron 001 (AAMAS, 2018)

Two-level lot-sizing with inventory bounds. - Siao-Leu Phouratsamay; Safia Kedad-Sidhoum; Fanny Pascual (Discret. Optim., 2018)

Colocating tasks in data centers using a side-effects performance model. - Fanny Pascual; Krzysztof Rzadca (Eur. J. Oper. Res., 2018)

Models and algorithms for combinatorial optimization problems of resource sharing between agents. - Fanny Pascual (2019)

Optimizing Egalitarian Performance when Colocating Tasks with Types for Cloud Data Center Resource Management. - Fanny Pascual; Krzysztof Rzadca (IEEE Trans. Parallel Distributed Syst., 2019)

Scheduling Malleable Jobs Under Topological Constraints. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IPDPS, 2020)

Speed Scaling with Explorable Uncertainty. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (SPAA, 2021)

Coordination of a two-level supply chain with contracts. - Siao-Leu Phouratsamay; Safia Kedad-Sidhoum; Fanny Pascual (4OR, 2021)

Efficiency and equity in the multi organization scheduling problem. - Martin Durand; Fanny Pascual (Theor. Comput. Sci., 2021)

Scheduling with Untrusted Predictions. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IJCAI, 2022)

Collective Schedules: Axioms and Algorithms. - Martin Durand; Fanny Pascual (SAGT, 2022)

A Non-utilitarian Discrete Choice Model for Preference Aggregation. - Martin Durand; Fanny Pascual; Olivier Spanjaard (SUM, 2022)

Non-Clairvoyant Makespan Minimization Scheduling with Predictions. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (ISAAC, 2023)

Detecting and taking Project Interactions into account in Participatory Budgeting. - Martin Durand; Fanny Pascual (CoRR, 2024)

Ordering Collective Unit Tasks: from Scheduling to Computational Social Choice. - Martin Durand; Fanny Pascual (CoRR, 2024)

Estimating the Electoral Consequences of Legislative Redistricting in France. - Evripidis Bampis; Thomas Ehrhard; Bruno Escoffier; Claire Mathieu; Fanny Pascual; David Saulpic (FAccT, 2025)