No. Title Author Year
1 Malleable Scheduling Beyond Identical Machines Fotakis, Dimitris et al. 2019
2 Covering Clients with Types and Budgets Fotakis, Dimitris et al. 2018
3 On the Size and the Approximability of Minimum Temporally Connected Subgraphs Axiotis, Kyriakos et al. 2016
4 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: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI