| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Graph Connectivity with Noisy Queries | Fotakis, Dimitris et al. | 2023 |
| 2 | On the Approximability of Multistage Min-Sum Set Cover | Fotakis, Dimitris et al. | 2021 |
| 3 | Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games | Fotakis, Dimitris et al. | 2020 |
| 4 | The Online Min-Sum Set Cover Problem | Fotakis, Dimitris et al. | 2020 |
| 5 | Malleable Scheduling Beyond Identical Machines | Fotakis, Dimitris et al. | 2019 |
| 6 | Covering Clients with Types and Budgets | Fotakis, Dimitris et al. | 2018 |
| 7 | On the Size and the Approximability of Minimum Temporally Connected Subgraphs | Axiotis, Kyriakos et al. | 2016 |
| 8 | Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse | Fotakis, Dimitris et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |