Dimitris Fotakis

1. Metric-Distortion Bounds under Limited Information
   2021/07/06 by Ioannis Anagnostides, Anagnostides, Ioannis, Dimitris Fotakis +3 · 4 citations
   Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Voting Systems
2. Efficient Algorithms for Learning from Coarse Labels
   2021/08/22 by Dimitris Fotakis, Alkis Kalavasis, Fotakis, Dimitris +5 · 3 citations
   Computer Science · Mathematics · #Machine Learning and Data Classification #Machine Learning and Algorithms #Statistical Methods and Inference
3. On the Size and the Approximability of Minimum Temporally Connected\n Subgraphs
   2016/02/20 by Kyriakos Axiotis, Axiotis, Kyriakos, Dimitris Fotakis +1 · 2 citations
   Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks
4. Efficient Parameter Estimation of Truncated Boolean Product\n Distributions
   2020/07/05 by Dimitris Fotakis, Fotakis, Dimitris, Alkis Kalavasis +3 · 2 citations
   Computer Science · #Bayesian Modeling and Causal Inference #Computation (stat.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Machine Learning and Data Classification #Statistics Theory (math.ST)
5. Sub-exponential Approximation Schemes for CSPs: from Dense to Almost\n Sparse
   2015/07/15 by Dimitris Fotakis, Fotakis, Dimitris, Michael Lampis +3 · 1 citation
   Mathematics · #Advanced Optimization Algorithms Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences
6. Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
   2021/11/11 by Dimitris Fotakis, Fotakis, Dimitris, Jannik Matuschke +3 · 1 citation
   Computer Science · Engineering · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems #Optimization and Search Problems #Scheduling and Optimization Algorithms
7. The Knapsack Secretary Problem is Strictly Harder Than the Secretary Problem
   2026/07/24 by Eric Balkanski, Jason Chatzitheodorou, Dimitris Fotakis +1 · 1 citation
   #cs.DS
8. FAIR-Compute: A Roadmap for Fair and Efficient Allocation of Federated Digital Research Infrastructure
   2026/07/30 by Konstantinos, E. Zachariadis, Ahmed Sayed +3
   Computer Science · #cs.DC