default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFanny Pascual
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Martin Durand, Fanny Pascual:
Collective schedules: axioms and algorithms. CoRR abs/2403.18642 (2024)- [i5]Martin Durand, Fanny Pascual:
Detecting and taking Project Interactions into account in Participatory Budgeting. CoRR abs/2403.19194 (2024) - [i4]Martin Durand, Fanny Pascual:
Ordering Collective Unit Tasks: from Scheduling to Computational Social Choice. CoRR abs/2403.19197 (2024) - 2023
- [c22]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ISAAC 2023: 9:1-9:15 - 2022
- [c21]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling with Untrusted Predictions. IJCAI 2022: 4581-4587 - [c20]Martin Durand
, Fanny Pascual:
Collective Schedules: Axioms and Algorithms. SAGT 2022: 454-471 - [c19]Martin Durand, Fanny Pascual, Olivier Spanjaard:
A Non-utilitarian Discrete Choice Model for Preference Aggregation. SUM 2022: 157-171 - 2021
- [j18]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Coordination of a two-level supply chain with contracts. 4OR 19(2): 235-264 (2021) - [j17]Martin Durand, Fanny Pascual:
Efficiency and equity in the multi organization scheduling problem. Theor. Comput. Sci. 864: 103-117 (2021) - [c18]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Speed Scaling with Explorable Uncertainty. SPAA 2021: 83-93 - 2020
- [c17]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling Malleable Jobs Under Topological Constraints. IPDPS 2020: 316-325
2010 – 2019
- 2019
- [b2]Fanny Pascual:
Models and algorithms for combinatorial optimization problems of resource sharing between agents. Sorbonne University, Paris, France, 2019 - [j16]Fanny Pascual, Krzysztof Rzadca:
Optimizing Egalitarian Performance when Colocating Tasks with Types for Cloud Data Center Resource Management. IEEE Trans. Parallel Distributed Syst. 30(11): 2523-2535 (2019) - 2018
- [j15]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Two-level lot-sizing with inventory bounds. Discret. Optim. 30: 1-19 (2018) - [j14]Fanny Pascual, Krzysztof Rzadca:
Colocating tasks in data centers using a side-effects performance model. Eur. J. Oper. Res. 268(2): 450-462 (2018) - [c16]Fanny Pascual, Krzysztof Rzadca, Piotr Skowron:
Collective Schedules: Scheduling Meets Computational Social Choice. AAMAS 2018: 667-675 - [i3]Fanny Pascual, Krzysztof Rzadca, Piotr Skowron:
Collective Schedules: Scheduling Meets Computational Social Choice. CoRR abs/1803.07484 (2018) - 2017
- [j13]Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten:
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670: 1-10 (2017) - [c15]Fanny Pascual, Krzysztof Rzadca:
Optimizing Egalitarian Performance in the Side-Effects Model of Colocation for Data Center Resource Management. Euro-Par 2017: 206-219 - 2016
- [c14]Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault:
Truthfulness for the Sum of Weighted Completion Times. COCOON 2016: 15-26 - [i2]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Two-level lot-sizing with inventory bounds. CoRR abs/1604.02278 (2016) - [i1]Fanny Pascual, Krzysztof Rzadca:
Optimizing egalitarian performance in the side-effects model of colocation for data~center resource management. CoRR abs/1610.07339 (2016) - 2015
- [j12]Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual:
Network sharing by two mobile operators: beyond competition, cooperation. RAIRO Oper. Res. 49(3): 635-650 (2015) - [c13]Johanne Cohen, Fanny Pascual:
Scheduling Tasks from Selfish Multi-tasks Agents. Euro-Par 2015: 183-195 - [c12]Fanny Pascual, Krzysztof Rzadca:
Partition with Side Effects. HiPC 2015: 295-304 - 2013
- [j11]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) - [c11]Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 - 2012
- [j10]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in multiorganization matching. Algorithmic Oper. Res. 7(2) (2012) - 2011
- [j9]Pierre-François Dutot, Fanny Pascual, Krzysztof Rzadca, Denis Trystram:
Approximation Algorithms for the Multiorganization Scheduling Problem. IEEE Trans. Parallel Distributed Syst. 22(11): 1888-1895 (2011) - [c10]Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard:
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81 - [c9]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 - 2010
- [j8]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. Algorithmica 58(2): 391-404 (2010)
2000 – 2009
- 2009
- [j7]Fanny Pascual, Krzysztof Rzadca, Denis Trystram:
Cooperation in multi-organization scheduling. Concurr. Comput. Pract. Exp. 21(7): 905-921 (2009) - [j6]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5): 437-445 (2009) - 2008
- [j5]Eric Angel, Evripidis Bampis, Fanny Pascual:
How good are SPT schedules for fair optimality criteria. Ann. Oper. Res. 159(1): 53-64 (2008) - [j4]Eric Angel, Evripidis Bampis, Fanny Pascual:
An exponential (matching based) neighborhood for the vehicle routing problem. J. Comb. Optim. 15(2): 179-190 (2008) - [j3]Eric Angel, Evripidis Bampis, Fanny Pascual:
The impact of local policies on the quality of packet routing in paths, trees, and rings. J. Sched. 11(5): 311-322 (2008) - [c8]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in Multiorganization Matching. WAOA 2008: 78-91 - 2007
- [j2]Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos:
The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4): 465-474 (2007) - [c7]George Christodoulou, Laurent Gourvès, Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197 - [c6]Fanny Pascual, Krzysztof Rzadca, Denis Trystram:
Cooperation in Multi-organization Scheduling. Euro-Par 2007: 224-233 - [c5]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. HiPC 2007: 297-307 - [c4]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks. SPAA 2007: 196-197 - [r1]Evripidis Bampis, Eric Angel, Fanny Pascual:
Algorithmic Game Theory and Scheduling. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [b1]Fanny Pascual:
Optimisation dans les réseaux : de l'approximation polynomiale à la théorie des jeux. (Optimization in networks: from polynomial time approximation to game theory). University of Évry Val d'Essonne, France, 2006 - [j1]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 369(1-3): 157-168 (2006) - [c3]Eric Angel, Evripidis Bampis, Fanny Pascual:
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. Euro-Par 2006: 157-166 - 2005
- [c2]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. WINE 2005: 698-707 - 2004
- [c1]Eric Angel, Evripidis Bampis, Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network. SIROCCO 2004: 1-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
