Fanny Pascual

Orcid: 0000-0003-0215-409X

According to our database1, Fanny Pascual authored at least 39 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ordering Collective Unit Tasks: from Scheduling to Computational Social Choice.
CoRR, 2024

Detecting and taking Project Interactions into account in Participatory Budgeting.
CoRR, 2024

2023
Non-Clairvoyant Makespan Minimization Scheduling with Predictions.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
A Non-utilitarian Discrete Choice Model for Preference Aggregation.
Proceedings of the Scalable Uncertainty Management - 15th International Conference, 2022

Collective Schedules: Axioms and Algorithms.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Scheduling with Untrusted Predictions.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Efficiency and equity in the multi organization scheduling problem.
Theor. Comput. Sci., 2021

Coordination of a two-level supply chain with contracts.
4OR, 2021

Speed Scaling with Explorable Uncertainty.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020
Scheduling Malleable Jobs Under Topological Constraints.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019
Optimizing Egalitarian Performance when Colocating Tasks with Types for Cloud Data Center Resource Management.
IEEE Trans. Parallel Distributed Syst., 2019

Models and algorithms for combinatorial optimization problems of resource sharing between agents.
, 2019

2018
Colocating tasks in data centers using a side-effects performance model.
Eur. J. Oper. Res., 2018

Two-level lot-sizing with inventory bounds.
Discret. Optim., 2018

Collective Schedules: Scheduling Meets Computational Social Choice.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Bi-objective matchings with the triangle inequality.
Theor. Comput. Sci., 2017

Optimizing Egalitarian Performance in the Side-Effects Model of Colocation for Data Center Resource Management.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

2016
Truthfulness for the Sum of Weighted Completion Times.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Network sharing by two mobile operators: beyond competition, cooperation.
RAIRO Oper. Res., 2015

Partition with Side Effects.
Proceedings of the 22nd IEEE International Conference on High Performance Computing, 2015

Scheduling Tasks from Selfish Multi-tasks Agents.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2013
Single approximation for the biobjective Max TSP.
Theor. Comput. Sci., 2013

Truthful Many-to-Many Assignment with Private Weights.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Cooperation in multiorganization matching.
Algorithmic Oper. Res., 2012

2011
Approximation Algorithms for the Multiorganization Scheduling Problem.
IEEE Trans. Parallel Distributed Syst., 2011

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010
Approximation Algorithms for Scheduling with Reservations.
Algorithmica, 2010

2009
On truthfulness and approximation for scheduling selfish tasks.
J. Sched., 2009

Cooperation in multi-organization scheduling.
Concurr. Comput. Pract. Exp., 2009

2008
The impact of local policies on the quality of packet routing in paths, trees, and rings.
J. Sched., 2008

An exponential (matching based) neighborhood for the vehicle routing problem.
J. Comb. Optim., 2008

How good are SPT schedules for fair optimality criteria.
Ann. Oper. Res., 2008

2007
Algorithmic Game Theory and Scheduling.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

The densest <i>k</i>-subgraph problem on clique graphs.
J. Comb. Optim., 2007

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

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).
PhD thesis, 2006

Truthful algorithms for scheduling selfish tasks on parallel machines.
Theor. Comput. Sci., 2006

The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2004
Traffic Grooming in a Passive Star WDM Network.
Proceedings of the Structural Information and Communication Complexity, 2004


  Loading...