dblp.uni-trier.dewww.uni-trier.de

Dimitris Fotakis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
40EECharalampos 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
2008
39EEDimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis: Atomic Congestion Games: Fast, Myopic and Concurrent. SAGT 2008: 121-132
38EEDimitris Fotakis: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. SAGT 2008: 33-45
37EEDimitris Fotakis, Paul G. Spirakis: Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2008
36EEDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic congestion games among coalitions. ACM Transactions on Algorithms 4(4): (2008)
35EEDimitris Fotakis: On the Competitive Ratio for Online Facility Location. Algorithmica 50(1): 1-57 (2008)
2007
34EEDimitris Fotakis: Stackelberg Strategies for Atomic Congestion Games. ESA 2007: 299-310
33EEDimitris Fotakis, Paul G. Spirakis: Cost-Balancing Tolls for Atomic Network Congestion Games. WINE 2007: 179-190
32EEDimitris Fotakis: A primal-dual algorithm for online non-uniform facility location. J. Discrete Algorithms 5(1): 141-148 (2007)
2006
31EEDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583
30EEDimitris Fotakis: Memoryless Facility Location in One Pass. STACS 2006: 608-620
29EEDimitris Fotakis, Stefanos Gritzalis: Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks. Computer Communications 29(11): 2109-2122 (2006)
28EEDimitris 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)
27EEDimitris Fotakis: Incremental algorithms for Facility Location and k-Median. Theor. Comput. Sci. 361(2-3): 275-313 (2006)
2005
26EEDimitris Fotakis: A Primal-Dual Algorithm for Online Non-uniform Facility Location. Panhellenic Conference on Informatics 2005: 47-56
25EEDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175
24EEDimitris 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)
23EEDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005)
22EEDimitris 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)
2004
21EEDimitris Fotakis: Incremental Algorithms for Facility Location and k-Median. ESA 2004: 347-358
20EEDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish Unsplittable Flows. ICALP 2004: 593-605
2003
19EEDimitris Fotakis: On the Competitive Ratio for Online Facility Location. ICALP 2003: 637-652
18EEDimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282
17 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)
2002
16EEDimitris 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
15EEMaria 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
14EEDimitris 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
13EEDimitris Fotakis, Paul G. Spirakis: Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3): 396-422 (2002)
2001
12EEDimitris Fotakis, Spiridon D. Likothanassis, Stamatis Stefanakos: An Evolutionary Annealing Approach to Graph Coloring. EvoWorkshops 2001: 120-129
11 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
10 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)
9 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)
2000
8EEDimitris 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
1999
7 Christos Bouras, Dimitris Fotakis, Vaggelis Kapoulas, Anni Koubek, Harald Mayer, Herwig Rehatschek: Virtual European School - VES. ICMCS, Vol. 2 1999: 1055-1057
6 Dimitris Fotakis, Paul G. Spirakis: Efficient Redundant Assignments under Fault-Tolerance Constraints. RANDOM-APPROX 1999: 156-167
1998
5 Dimitris Fotakis, Paul G. Spirakis: A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. FSTTCS 1998: 18-29
4EEDimitris Fotakis, Paul G. Spirakis: Graph Properties that Facilitate Travelling Electronic Colloquium on Computational Complexity (ECCC) 5(31): (1998)
3EEDimitris Fotakis, Paul G. Spirakis: Random Walks, Conditional Hitting Sets and Partial Derandomization Electronic Colloquium on Computational Complexity (ECCC) 5(49): (1998)
1996
2 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
1987
1 Dimitris Fotakis, Nikolaos G. Bourbakis: A Risc-Type Structural Design of the Hermes Multiprocessor Kernel. ICS 1987: 1011-1030

Coauthor Index

1Maria I. Andreou [15]
2Grigorios N. Beligiannis [11] [17] [40]
3Christos Bouras [7]
4Nikolaos G. Bourbakis [1]
5Dimitris Fragoudis [11] [17]
6Konstantinos C. Giotopoulos [11] [17]
7Stefanos Gritzalis [29]
8Alexis C. Kaporis [39]
9Vaggelis Kapoulas [7]
10Spyros C. Kontogiannis [16] [20] [23] [25] [31] [36]
11Anni Koubek [7]
12Elias Koutsoupias [16]
13Spiridon D. Likothanassis (Spiros Likothanassis) [11] [12] [17] [40]
14Marios Mavronicolas [16]
15Harald Mayer [7]
16Charalampos N. Moschopoulos [40]
17Sotiris E. Nikoletseas [8] [9] [10] [14] [15] [24] [28]
18Rasmus Pagh [18] [22]
19Vicky G. Papadopoulou (Vicky Papadopoulou) [8] [9] [10] [14] [15] [24] [28]
20Herwig Rehatschek [7]
21Peter Sanders [18] [22]
22Paul G. Spirakis [2] [3] [4] [5] [6] [8] [9] [10] [13] [14] [15] [16] [18] [20] [22] [23] [24] [25] [28] [31] [33] [36] [37] [39]
23Stamatis Stefanakos [12]
24Panagiotis Tsiatsis [40]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)