Dimitris Fotakis

Dimitris Fotakis, Christos Tzamos: Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theor. Comput. Sci. 472: 90-103 (2013)

Dimitris Fotakis, Epameinondas Sidiropoulos: A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems. Applied Mathematics and Computation 218(9): 5168-5180 (2012)

Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis: The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012)

Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Efficient methods for selfish network design. Theor. Comput. Sci. 448: 9-20 (2012)

Dimitris Fotakis, Paraschos Koutris: Online Sum-Radii Clustering. MFCS 2012: 395-406

Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis: On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167

Dimitris Fotakis, Paris Siminelakis: On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. WINE 2012: 270-283

Dimitris Fotakis, Christos Tzamos: On the Power of Deterministic Mechanisms for Facility Location Games. CoRR abs/1207.0935 (2012)

Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis: On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012)

Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman: Enumerating Subgraph Instances Using Map-Reduce. CoRR abs/1208.0615 (2012)

Dimitris Fotakis: Online and incremental algorithms for facility location. SIGACT News 42(1): 97-131 (2011)

Dimitris Fotakis: Memoryless facility location in one pass. ACM Transactions on Algorithms 7(4): 49 (2011)

Dimitris Fotakis, Piotr Krysta, Orestis Telelis: Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116

Dimitris Fotakis, Paraschos Koutris: Online Sum-Radii Clustering. CoRR abs/1109.5325 (2011)

Dimitris Fotakis, Paris Siminelakis: On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. CoRR abs/1110.1894 (2011)

Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Atomic Congestion Games: Fast, Myopic and Concurrent. Theory Comput. Syst. 47(1): 38-59 (2010)

Dimitris Fotakis: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. Theory Comput. Syst. 47(1): 113-136 (2010)

Dimitris Fotakis: Stackelberg Strategies for Atomic Congestion Games. Theory Comput. Syst. 47(1): 218-249 (2010)

Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos: On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173

Dimitris Fotakis, Christos Tzamos: Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. WINE 2010: 234-245

Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009)

Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Efficient Methods for Selfish Network Design. ICALP (2) 2009: 459-471

Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis: The Impact of Social Ignorance on Weighted Congestion Games. WINE 2009: 316-327

Charalampos N. Moschopoulos, Panagiotis Tsiatsis, Grigorios N. Beligiannis, Dimitris Fotakis, Spiridon D. Likothanassis: Dealing with Large Datasets Using an Artificial Intelligence Clustering Tool. Tools and Applications with Artificial Intelligence 2009: 105-120

Dimitris Fotakis: On the Competitive Ratio for Online Facility Location. Algorithmica 50(1): 1-57 (2008)

Dimitris Fotakis, Paul G. Spirakis: Cost-Balancing Tolls for Atomic Network Congestion Games. Internet Mathematics 5(4): 343-363 (2008)

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic congestion games among coalitions. ACM Transactions on Algorithms 4(4) (2008)

Dimitris Fotakis: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. SAGT 2008: 33-45

Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Atomic Congestion Games: Fast, Myopic and Concurrent. SAGT 2008: 121-132

Dimitris Fotakis, Paul G. Spirakis: Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2008

Dimitris Fotakis: A primal-dual algorithm for online non-uniform facility location. J. Discrete Algorithms 5(1): 141-148 (2007)

Dimitris Fotakis: Stackelberg Strategies for Atomic Congestion Games. ESA 2007: 299-310

Dimitris Fotakis, Paul G. Spirakis: Cost-Balancing Tolls for Atomic Network Congestion Games. WINE 2007: 179-190

Dimitris Fotakis, Stefanos Gritzalis: Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks. Computer Communications 29(11): 2109-2122 (2006)

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. J. Discrete Algorithms 4(3): 433-454 (2006)

Dimitris Fotakis: Incremental algorithms for Facility Location and k-Median. Theor. Comput. Sci. 361(2-3): 275-313 (2006)

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583

Dimitris Fotakis: Memoryless Facility Location in One Pass. STACS 2006: 608-620

Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. 38(2): 229-248 (2005)

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Radiocoloring in planar graphs: Complexity and approximations. Theor. Comput. Sci. 340(3): 514-538 (2005)

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005)

Dimitris Fotakis: A Primal-Dual Algorithm for Online Non-uniform Facility Location. Panhellenic Conference on Informatics 2005: 47-56

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175

Dimitris Fotakis: Incremental Algorithms for Facility Location and k-Median. ESA 2004: 347-358

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish Unsplittable Flows. ICALP 2004: 593-605

Spiridon D. Likothanassis, Grigorios N. Beligiannis, Dimitris Fotakis, Dimitris Fragoudis, Konstantinos C. Giotopoulos: An Evolutionary Computation Technique for User Profile Optimization. I. J. Comput. Appl. 10(1): 25-33 (2003)

Dimitris Fotakis: On the Competitive Ratio for Online Facility Location. ICALP 2003: 637-652

Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282

Dimitris Fotakis, Paul G. Spirakis: Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3): 396-422 (2002)

Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134

Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. MFCS 2002: 81-92

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. WG 2002: 223-234

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. Computers and Artificial Intelligence 20(2) (2001)

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. Bulletin of the EATCS 75: 152-181 (2001)

Sokratis K. Katsikas, Spiridon D. Likothanassis, Grigorios N. Beligiannis, K. G. Berkeris, Dimitris Fotakis: Genetically determined variable structure multiple model estimation. IEEE Transactions on Signal Processing 49(10): 2253-2261 (2001)

Dimitris Fotakis, Spiridon D. Likothanassis, Stamatis Stefanakos: An Evolutionary Annealing Approach to Graph Coloring. EvoWorkshops 2001: 120-129

Spiridon D. Likothanassis, Grigorios N. Beligiannis, Dimitris Fotakis, Dimitris Fragoudis, Konstantinos C. Giotopoulos: An Evolutionary Computation Technique for User Profile Optimization. IRI 2001: 24-29

Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. MFCS 2000: 363-372

Christos Bouras, Dimitris Fotakis, Vaggelis Kapoulas, Anni Koubek, Harald Mayer, Herwig Rehatschek: Virtual European School - VES. ICMCS, Vol. 2 1999: 1055-1057

Dimitris Fotakis, Paul G. Spirakis: Efficient Redundant Assignments under Fault-Tolerance Constraints. RANDOM-APPROX 1999: 156-167

Dimitris Fotakis, Paul G. Spirakis: A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. FSTTCS 1998: 18-29

Dimitris Fotakis, Paul G. Spirakis: Graph Properties that Facilitate Travelling. Electronic Colloquium on Computational Complexity (ECCC) 5(31) (1998)

Dimitris Fotakis, Paul G. Spirakis: Random Walks, Conditional Hitting Sets and Partial Derandomization. Electronic Colloquium on Computational Complexity (ECCC) 5(49) (1998)

Dimitris Fotakis, Paul G. Spirakis: (poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. MFCS 1996: 360-371

Dimitris Fotakis, Nikolaos G. Bourbakis: A Risc-Type Structural Design of the Hermes Multiprocessor Kernel. ICS 1987: 1011-1030