D. Fotakis, L. Gourves and J. Monnot. Conference Program Design with Single-Peaked and Single-Crossing Preferences. Conference on Internet and Network Economics - WINE 2016.
D. Fotakis, C. Tzamos and E. Zampetakis. Mechanism Design with Selective Verification. ACM Conference on Electronic Commerce - EC 2016.
K. Axiotis and D. Fotakis. On the Size and the Approximability of Minimum Temporally Connected Subgraphs. International Colloquium on Automata, Languages and Programming - ICALP 2016 (Track C).
D. Fotakis, D. Palyvos-Giannas and S. Skoulakis. Opinion Dynamics with Local Interactions. International Joint Conference on Artificial Intelligence – IJCAI 2016.
D. Fotakis, I. Milis, O. Papadigenopoulos, V. Vassalos, G. Zois. Scheduling MapReduce Jobs under Multi-Round Precedences. European Conference on Parallel and Distributed Computing – EuroPar 2016.
D. Fotakis, M. Lampis and V.Th. Paschos. Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. Symposium on Theoretical Aspects of Computer Science – STACS 2016.
D. Fotakis, L. Gourves and J. Monnot. Selfish Transportation Games. Conference on Current Trends in Theory and Practice of Computer Science - SOFSEM 2017.
D. Fotakis, D. Kalimeris and T. Lianeas. Improving Selfish Routing for Risk-Averse Players. Conference on Internet and Network Economics – WINE 2015, LNCS 9470, pp. 328-342, 2015.
D. Fotakis, D. Tsipras, C. Tzamos and E. Zampetakis. Efficient Money Burning in General Domains. International Symposium on Algorithmic Game Theory – SAGT 2015, LNCS 9347, pp. 85-97, 2015. Full version to appear in Theory of Computing Systems.
D. Fotakis, I. Milis, O. Papadigenopoulos, E. Zampetakis and G. Zois. Scheduling MapReduce jobs and data shuffle on unrelated processors. International Symposium on Experimental Algorithms – SEA '15, LNCS 9125, pp. 137-150, 2015.
D. Fotakis, P. Krysta, and C. Ventre. The Power of Verification for Greedy Mechanism Design. International Conference on Autonomous Agents and Multiagent Systems – AAMAS 2015.
D. Fotakis. A Selective Tour Through Congestion Games. Algorithms, Probability, Networks and Games (Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday), 2015.
D. Fotakis, T. Lykouris, E. Markakis, and S. Obraztsova. Influence Maximization in Switching-Selection Threshold Models. Symposium on Algorithmic Game Theory - SAGT '14, LNCS 8768, pp. 122-133, 2014.
F. Afrati, D. Fotakis, and A. Vasilakopoulos. Efficient Lineage for SUM Aggregate Queries. AI Communications 28(4): 655-663, 2015.
D. Fotakis, P. Krysta, and C. Ventre. Combinatorial Auctions without Money. International Conference on Autonomous Agents and Multiagent Systems - AAMAS '14, pp. 1029-1036, 2014. Full version to appear in Algorithmica.
D. Fotakis and E. Zampetakis. Truthfulness Flooded Domains and the Power of Verification for Mechanism Design. Workshop on Internet and Network Economics - WINE '13, 2013. Full version in ACM Transactions on Economics and Computation 3(4), 2015.
H. Angelidakis, D. Fotakis, and T. Lianeas. Stochastic Congestion Games with Risk-Averse Players. Symposium on Algorithmic Game Theory - SAGT '13, LNCS 8146, pp. 87-98, 2013.
D. Fotakis and C. Tzamos. Strategyproof Facility Location for Concave Cost Functions. ACM Conference on Electronic Commerce - EC '13, pp. 435-452, 2013. Full version in Algorithmica 76(1): 143-167, 2016.
D. Fotakis and C. Tzamos. On the Power of Deterministic Mechanisms for Facility Location Games. International Colloquium on Automata, Languages and Programming - ICALP '13 (Track A), LNCS 7965, Part I, pp. 449-460, 2013. Full version in ACM Transactions on Economics and Computation 2(4), 2015.
D. Fotakis, A. Kaporis, T. Lianeas, and P. Spirakis. Resolving Braess's Paradox in Random Networks. Workshop on Internet and Network Economics - WINE '13, 2013. Full version to appear in Algorithmica.
F. Afrati, D. Fotakis, and J. Ullman: Enumerating Subgraph Instances Using Map-Reduce. IEEE International Conference on Data Engineering - ICDE '13, pp. 62-73, 2013.
D. Fotakis, A. Kaporis, T. Lianeas, and P. Spirakis. On the Hardness of Network Design for Bottleneck Routing Games. Symposium on Algorithmic Game Theory - SAGT '12, LNCS 7615, pp. 156–167, 2012. Full version in Theoretical Computer Science 521, pp. 107-122, 2014.
D. Fotakis and P. Siminelakis. On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. Workshop on Internet and Network Economics - WINE '12, LNCS 7695, pp. 271-284, 2012. Full version in Theoretical Computer Science 539, pp. 68-86, 2014.
D. Fotakis and P. Koutris. Online Sum-Radii Clustering. Mathematical Foundations of Computer Science - MFCS '12, LNCS 7464, pp. 395-406, 2000, 2012. Full version in Theoretical Computer Science 540, pp. 27-39, 2014.
D. Fotakis, P. Krysta, and O. Telelis. Externalities among Advertisers in Sponsored Search. Symposium on Algorithmic Game Theory - SAGT '11, LNCS 6982, pp. 105-116, 2011.
D. Fotakis. Online and Incremental Algorithms for Facility Location. SIGACT News 42(1), pp. 97-131, 2011.
D. Fotakis and C. Tzamos. Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. Workshop on Internet and Network Economics - WINE '10, 2010. Full version in Theoretical Computer Science 472, pp. 90-103, 2013.
D. Fotakis, G. Karakostas, and S. Kolliopoulos. On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. Symposium on Algorithmic Game Theory - SAGT '10, LNCS 6386, pp. 162-173, 2010.
D. Fotakis, V. Gkatzelis, A. Kaporis, and P. Spirakis. The Impact of Social Ignorance on Weighted Congestion Games. Workshop on Internet and Network Economics - WINE '09, LNCS 5929, pp. 316-327, 2009. Full version in Theory of Computing Systems 50, pp. 559-578, 2012.
D. Fotakis, A. Kaporis, and P. Spirakis. Efficient Methods for Selfish Network Design. International Colloquium on Automata, Languages and Programming - ICALP '09 (Track C), LNCS 5556, pp. 459-471, 2009. Full version in Theoretical Computer Science, 2012.
D. Fotakis. Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. Symposium on Algorithmic Game Theory - SAGT '08, LNCS 4997, pp. 33-45, 2008. Full version in Theory of Computing Systems, Special Issue on SAGT 2008, March 2009.
D. Fotakis, A. Kaporis, and P. Spirakis. Atomic Congestion Games: Fast, Myopic, and Concurrent. Symposium on Algorithmic Game Theory - SAGT '08, LNCS 4997, pp. 121-132, 2008. Full version in Theory of Computing Systems, Special Issue on SAGT 2008, March 2009.
D. Fotakis. Stackelberg Strategies for Atomic Congestion Games. European Symposium on Algorithms - ESA '07, LNCS 4698, pp. 299-310, 2007. Full version in Theory of Computing Systems, October 2008.
D. Fotakis and P. Spirakis. Cost-Balancing Tolls for Atomic Network Congestion Games. Workshop on Internet and Network Economics - WINE '07, LNCS 4858, pp. 179-190, 2007. Full version accepted in Internet Mathematics, Special Issue on WINE 2007, January 2009.
D. Fotakis, S. Kontogiannis, and P. Spirakis. Atomic Congestion Games among Coalitions. International Colloquium on Automata, Languages and Programming - ICALP '06, LNCS 4051, pp. 573-584, 2006. Full version in ACM Transactions on Algorithms, 2008.
D. Fotakis. Memoryless Facility Location in One Pass. Symposium on Theoretical Aspects of Computer Science - STACS '06, LNCS 3884, pp. 608-620, 2006. Full version in ACM Transactions on Algorithms 7(4): 49, 2011.
D. Fotakis. A Primal-Dual Algorithm for Online Non-Uniform Facility Location. Journal of Discrete Algorithms 5, pp. 141-148, 2006. Preliminary version in the 10th Panhellenic Conference on Informatics - PCI '05.
D. Fotakis, S. Kontogiannis, and P. Spirakis. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. Workshop on Approximation and Online Algorithms - WAOA ’05, LNCS 3879, pp. 161-175, 2006.
D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish Unsplittable Flows. International Colloquium on Automata, Languages and Programming - ICALP '04, LNCS 3142, pp. 593-605, 2004. Full version in Theoretical Computer Science 348, Special Issue on ICALP 2004, pp. 226-239, 2005.
D. Fotakis. Incremental Algorithms for Facility Location and k-Median. European Symposium on Algorithms - ESA '04, LNCS 3221, pp. 347-358, 2004. Full version in Theoretical Computer Science 361, Special Issue on Approximation and Online Algorithms, pp. 275-313, 2006.
D. Fotakis. On the Competitive Ratio for Online Facility Location. International Colloquium on Automata, Languages and Programming - ICALP '03, LNCS 2719, pp. 637-652, 2003. Full version in Algorithmica 50(1), pp. 1-57, 2008.
D. Fotakis, R. Pagh, P. Sanders, and P. Spirakis. Space Efficient Hash Tables with Worst Case Constant Access Time. Symposium on Theoretical Aspects of Computer Science - STACS '03, LNCS 2607, pp. 271-282, 2003. Full version in Theory of Computing Systems 38, Special Issue on STACS 2003, 229-248, 2005.
D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. International Colloquium on Automata, Languages and Programming - ICALP '02, LNCS 2380, pp. 123-134, 2002. Full version in Theoretical Computer Science 410, Special Issue "Graphs, Games and Computation: Dedicated to Professor Burkhard Monien on the Occasion of his 65th Birthday", pp. 3305-3326, 2009.
M. Andreou, D. Fotakis, S. Nikoletseas, V. Papadopoulou, and P. Spirakis. On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. Mathematical Foundations of Computer Science - MFCS '02, LNCS 2420, pp. 81-92, 2002.
D. Fotakis, S. Nikoletseas, V. Papadopoulou, and P. Spirakis. Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. Graph Theoretical Concepts in Computer Science - WG '02, LNCS 2573, pp. 223-234, 2002. Full version in Journal of Discrete Algorithms 4, pp. 433-454, 2006.
D. Fotakis, S. Nikoletseas, V. Papadopoulou, and P. Spirakis. NP-Completeness Results and Efficient Approximations for Radio Coloring in Planar Graphs. Mathematical Foundations of Computer Science - MFCS '00, LNCS 1893, pp. 363-372, 2000. Full version in Theoretical Computer Science, Special Issue on MFCS 2000, 340, 514-538, 2005.
D. Fotakis and P. Spirakis. Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3), pp. 396-422, 2002. Preliminary version in Randomization, Approximation, and Combinatorial Optimization: Algorithms and Techniques - APPROX '99, LNCS 1671, pp. 156-167, 1999.
D. Fotakis and P. Spirakis. A Hamiltonian Approach to the Assignment of Non-Reusable Frequencies. Foundations of Software Technology and Theoretical Computer Science - FST & TCS '98, LNCS 1530, pp. 18-29, 1998.
D. Fotakis, G. Pantziou, G. Pentaris, and P. Spirakis. Frequency Assignment in Mobile and Radio Networks. Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45, pp. 73-90, 1999.
D. Fotakis and P. Spirakis. Random Walks, Conditional Hitting Sets and Partial Derandomization. Electronic Colloquium on Computational Complexity (ECCC), Technical Report 98-049, 1998.
D. Fotakis and P. Spirakis. Graph Properties that Facilitate Travelling. Electronic Colloquium on Computational Complexity (ECCC), Technical Report 98-031, 1998.
D.Fotakis and P. Spirakis. (poly(loglog n), poly(loglog n))-restricted verifiers are unlikely to exist for languages in NP. Mathematical Foundations of Computer Science - MFCS '96, LNCS 1113, pp. 360-371, 1996.