| Cooperation in multi‐organization scheduling F Pascual, K Rzadca, D Trystram Concurrency and Computation: Practice and Experience 21 (7), 905-921, 2009 | 87 | 2009 |
| Truthful algorithms for scheduling selfish tasks on parallel machines E Angel, E Bampis, F Pascual Theoretical Computer Science 369 (1-3), 157-168, 2006 | 73 | 2006 |
| Strategy-proof mechanisms for facility location games with many facilities B Escoffier, L Gourves, N Kim Thang, F Pascual, O Spanjaard Algorithmic Decision Theory: Second International Conference, ADT 2011 …, 2011 | 52 | 2011 |
| Scheduling selfish tasks: about the performance of truthful algorithms G Christodoulou, L Gourves, F Pascual Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007 | 30 | 2007 |
| The densest k-subgraph problem on clique graphs M Liazi, I Milis, F Pascual, V Zissimopoulos Journal of combinatorial optimization 14, 465-474, 2007 | 29 | 2007 |
| Approximation algorithms for scheduling with reservations F Diedrich, K Jansen, F Pascual, D Trystram Algorithmica 58 (2), 391-404, 2010 | 27 | 2010 |
| Two-level lot-sizing with inventory bounds SL Phouratsamay, S Kedad-Sidhoum, F Pascual Discrete Optimization 30, 1-19, 2018 | 21 | 2018 |
| Approximation algorithms for the multiorganization scheduling problem PF Dutot, F Pascual, K Rzadca, D Trystram IEEE Transactions on Parallel and Distributed Systems 22 (11), 1888-1895, 2011 | 20 | 2011 |
| On the truthfulness and the approximation for scheduling selfish tasks E Angel, E Bampis, F Pascual, AA Tchetgnia Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007 | 20 | 2007 |
| Collective schedules: Scheduling meets computational social choice F Pascual, K Rzadca, P Skowron arXiv preprint arXiv:1803.07484, 2018 | 15 | 2018 |
| The price of approximate stability for a scheduling game problem E Angel, E Bampis, F Pascual Proceedings of Euro-Par 4128, 2006 | 15 | 2006 |
| Scheduling with Untrusted Predictions. E Bampis, K Dogeas, AV Kononov, G Lucarelli, F Pascual IJCAI, 4581-4587, 2022 | 13 | 2022 |
| How good are SPT schedules for fair optimality criteria E Angel, E Bampis, F Pascual Annals of Operations Research 159, 53-64, 2008 | 12 | 2008 |
| Traffic grooming in a passive star WDM network E Angel, E Bampis, F Pascual International Colloquium on Structural Information and Communication …, 2004 | 9 | 2004 |
| An exponential (matching based) neighborhood for the vehicle routing problem E Angel, E Bampis, F Pascual Journal of combinatorial optimization 15 (2), 179-190, 2008 | 8 | 2008 |
| The price of approximate stability for scheduling selfish tasks on two links E Angel, E Bampis, F Pascual European Conference on Parallel Processing, 157-166, 2006 | 8 | 2006 |
| Single approximation for the biobjective Max TSP C Bazgan, L Gourvès, J Monnot, F Pascual Theoretical Computer Science 478, 41-50, 2013 | 6 | 2013 |
| Colocating tasks in data centers using a side-effects performance model F Pascual, K Rzadca European Journal of Operational Research 268 (2), 450-462, 2018 | 5 | 2018 |
| Truthfulness for the sum of weighted completion times E Angel, E Bampis, F Pascual, N Thibault International Computing and Combinatorics Conference, 15-26, 2016 | 5 | 2016 |
| Scheduling tasks from selfish multi-tasks agents J Cohen, F Pascual Euro-Par 2015: Parallel Processing: 21st International Conference on …, 2015 | 5 | 2015 |
