Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Fotakis, Dimitris"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the hardness of network design for bottleneck routing games
Dimitris Fotakis
,
Alexis C. Kaporis
,
Thanasis Lianeas
,
Paul G. Spirakis
Theoretical Computer Science
521
, 2014, pp. 107-122
Online Sum-Radii Clustering
Dimitris Fotakis
,
Paraschos Koutris
Theoretical Computer Science
540-541
, 2014, pp. 27-39
On the efficiency of influence-and-Exploit strategies for revenue maximization under positive externalities
Dimitris Fotakis
,
Paris Siminelakis
Theoretical Computer Science
539
, 2014, pp. 68-86
On the power of deterministic mechanisms for facility location games
Dimitris Fotakis
,
Christos Tzamos
Lecture Notes in Computer Science
7965
, 2013, pp. 449-460
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Dimitris Fotakis
,
Christos Tzamos
Theoretical Computer Science
472
, 2013, pp. 90-103
The impact of social ignorance on weighted congestion games
Dimitris Fotakis
,
Vasilis Gkatzelis
,
Alexis C. Kaporis
,
Paul G. Spirakis
Theory of Computing Systems
50
(3), 2012, pp. 559-578
Efficient methods for selfish network design
Dimitris Fotakis
,
Alexis C. Kaporis
,
Paul G. Spirakis
Theoretical Computer Science
448
, 2012, pp. 9-20
Online Sum-Radii Clustering
Dimitris Fotakis
,
Paraschos Koutris
Lecture Notes in Computer Science
7464
, 2012, pp. 395-406
Congestion games with linearly independent paths: Convergence time and price of anarchy
Dimitris Fotakis
Theory of Computing Systems
47
(1), 2010, pp. 113-136
Stackelberg strategies for atomic congestion games
Dimitris Fotakis
Theory of Computing Systems
47
(1), 2010, pp. 218-249
Efficient methods for selfish network design
Dimitris Fotakis
,
Alexis C. Kaporis
,
Paul G. Spirakis
Lecture Notes in Computer Science
5556
, 2009, pp. 459-471
The structure and complexity of Nash equilibria for a selfish routing game
Dimitris Fotakis
,
Spyros Kontogiannis
,
Elias Koutsoupias
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
410
(36), 2009, pp. 3305-3326
On the competitive ratio for online facility location
Dimitris Fotakis
Algorithmica
50
(1), 2008, pp. 1-57
Stackelberg strategies for atomic congestion games
Dimitris Fotakis
Lecture Notes in Computer Science
4698
, 2007, pp. 299-310
Algorithmic issues in coalitional and dynamic network games
Dimitris Fotakis
,
Spyros Kontogiannis
,
Panagiota Panagopoulou
,
Christoforos Raptopoulos
,
Paul Spirakis
HNI-Verlagsschriftenreihe
181
, 2006, pp. 25-42
Atomic congestion games among coalitions
Dimitris Fotakis
,
Spyros Kontogiannis
,
Paul Spirakis
Lecture Notes in Computer Science
4051
, 2006, pp. 572-583
Memoryless facility location in one pass
Dimitris Fotakis
Lecture Notes in Computer Science
3884
, 2006, pp. 608-620
Incremental algorithms for Facility Location and
k
-median
Dimitris Fotakis
Theoretical Computer Science
361
(2-3), 2006, pp. 275-313
Selfish unsplittable flows
Dimitris Fotakis
,
Spyros Kontogiannis
,
Paul Spirakis
Theoretical Computer Science
348
(2-3), 2005, pp. 226-239
Space efficient hash tables with worst case constant access time
Dimitris Fotakis
,
Rasmus Pagh
,
Peter Sanders
,
Paul Spirakis
Theory of Computing Systems
38
(2), 2005, pp. 229-248
Selfish unsplittable flows
Dimitris Fotakis
,
Spyros Kontogiannis
,
Paul Spirakis
Lecture Notes in Computer Science
3142
, 2004, pp. 593-605
Incremental algorithms for facility location and
k
-median
Dimitris Fotakis
Lecture Notes in Computer Science
3221
, 2004, pp. 347-358
Space efficient hash tables with worst case constant access time
Dimitris Fotakis
,
Rasmus Pagh
,
Peter Sanders
,
Paul Spirakis
Lecture Notes in Computer Science
2607
, 2003, pp. 271-282
On the competitive ratio for online facility location
Dimitris Fotakis
Lecture Notes in Computer Science
2719
, 2003, pp. 637-652
On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations
Maria I. Andreou
,
Dimitris A. Fotakis
,
Sotiris E. Nikoletseas
,
Vicky G. Papadopoulou
,
Paul G. Spirakis
Lecture Notes in Computer Science
2420
, 2002, pp. 81-92
Seiten 1
2
>