| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Approximating Connected Maximum Cuts via Local Search | Schieber, Baruch et al. | 2023 |
| 2 | Maximizing Throughput in Flow Shop Real-Time Scheduling | Ben Yamin, Lior et al. | 2020 |
| 3 | Generalized Assignment via Submodular Optimization with Reserved Capacity | Kulik, Ariel et al. | 2019 |
| 4 | The Preemptive Resource Allocation Problem | Sarpatwar, Kanthi et al. | 2019 |
| 5 | Fully Dynamic MIS in Uniformly Sparse Graphs | Onak, Krzysztof et al. | 2018 |
| 6 | Generalized Assignment of Time-Sensitive Item Groups | Sarpatwar, Kanthi et al. | 2018 |
| 7 | The Container Selection Problem | Nagarajan, Viswanath et al. | 2015 |
| 8 | Minimizing Busy Time in Multiple Machine Real-time Scheduling | Khandekar, Rohit et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |