| No. |
Title |
Author |
Year |
| 1 |
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding |
Doron-Arad, Ilan et al. |
2023 |
| 2 |
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets |
Doron-Arad, Ilan et al. |
2023 |
| 3 |
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping |
Fairstein, Yaron et al. |
2021 |
| 4 |
A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem |
Fairstein, Yaron et al. |
2020 |
| 5 |
Maximizing Throughput in Flow Shop Real-Time Scheduling |
Ben Yamin, Lior et al. |
2020 |
| 6 |
Generalized Assignment via Submodular Optimization with Reserved Capacity |
Kulik, Ariel et al. |
2019 |
| 7 |
The Preemptive Resource Allocation Problem |
Sarpatwar, Kanthi et al. |
2019 |
| 8 |
Generalized Assignment of Time-Sensitive Item Groups |
Sarpatwar, Kanthi et al. |
2018 |
| 9 |
The Container Selection Problem |
Nagarajan, Viswanath et al. |
2015 |
| 10 |
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) |
Jansen, Klaus et al. |
2011 |
| 11 |
Minimizing Busy Time in Multiple Machine Real-time Scheduling |
Khandekar, Rohit et al. |
2010 |
