No. Title Author Year
1 Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games Fotakis, Dimitris et al. 2020
2 The Online Min-Sum Set Cover Problem Fotakis, Dimitris et al. 2020
3 Malleable Scheduling Beyond Identical Machines Fotakis, Dimitris et al. 2019
4 Covering Clients with Types and Budgets Fotakis, Dimitris et al. 2018
5 On the Size and the Approximability of Minimum Temporally Connected Subgraphs Axiotis, Kyriakos et al. 2016
6 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: 6


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