| Scheduling with Untrusted Predictions | 0 | 0.34 | 2022 |
| Scheduling with Untrusted Predictions. | 0 | 0.34 | 2022 |
| Coordination Of A Two-Level Supply Chain With Contracts | 0 | 0.34 | 2021 |
| Speed Scaling with Explorable Uncertainty | 0 | 0.34 | 2021 |
| Efficiency And Equity In The Multi Organization Scheduling Problem | 0 | 0.34 | 2021 |
| Scheduling Malleable Jobs Under Topological Constraints | 0 | 0.34 | 2020 |
| Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management | 0 | 0.34 | 2019 |
| Collective Schedules: Scheduling Meets Computational Social Choice | 0 | 0.34 | 2018 |
| Two-level lot-sizing with inventory bounds. | 0 | 0.34 | 2018 |
| Colocating tasks in data centers using a side-effects performance model. | 0 | 0.34 | 2018 |
| Optimizing egalitarian performance in the side-effects model of colocation for data~center resource management. | 0 | 0.34 | 2017 |
| Bi-objective matchings with the triangle inequality. | 0 | 0.34 | 2017 |
| Scheduling Tasks from Selfish Multi-tasks Agents | 2 | 0.38 | 2015 |
| Network sharing by two mobile operators: beyond competition, cooperation | 0 | 0.34 | 2015 |
| Partition with Side Effects. | 1 | 0.35 | 2015 |
| Single approximation for the biobjective Max TSP | 0 | 0.34 | 2013 |
| Truthful Many-to-Many Assignment with Private Weights. | 0 | 0.34 | 2013 |
| Cooperation in Multiorganization Matching | 1 | 0.40 | 2012 |
| Single approximation for biobjective max TSP | 0 | 0.34 | 2011 |
| Approximation Algorithms for the Multiorganization Scheduling Problem | 4 | 0.44 | 2011 |
| Strategy-proof mechanisms for facility location games with many facilities | 17 | 1.00 | 2011 |
| Approximation Algorithms for Scheduling with Reservations | 11 | 0.99 | 2010 |
| Cooperation in multi-organization scheduling | 15 | 0.94 | 2009 |
| On truthfulness and approximation for scheduling selfish tasks | 10 | 0.63 | 2009 |
| The impact of local policies on the quality of packet routing in paths, trees, and rings | 0 | 0.34 | 2008 |
| How good are SPT schedules for fair optimality criteria | 3 | 0.50 | 2008 |
| An exponential (matching based) neighborhood for the vehicle routing problem | 4 | 0.48 | 2008 |
| Scheduling selfish tasks: about the performance of truthful algorithms | 16 | 0.93 | 2007 |
| The densest k-subgraph problem on clique graphs | 9 | 0.53 | 2007 |
| On the truthfulness and the approximation for scheduling selfish tasks | 0 | 0.34 | 2007 |
| The price of approximate stability for scheduling selfish tasks on two links | 2 | 0.43 | 2006 |
| Traffic Grooming in a Passive Star WDM Network | 2 | 0.40 | 2004 |
