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
[1]
Hilfe
Suche: Author="Fotakis, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Atomic congestion games: Fast, myopic and concurrent
D. Fotakis
,
A.C. Kaporis
,
P.G. Spirakis
Theory of Computing Systems
47
(1), 2010, pp. 38-59
Radiocoloring in planar graphs: Complexity and approximations
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Theoretical Computer Science
340
(3), 2005, pp. 514-538
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
2573
, 2002, pp. 223-234
Minimum congestion redundant assignments to tolerate random faults
D.A. Fotakis
,
P.G. Spirakis
Algorithmica
32
(3), 2002, pp. 396-422
NP
-completeness results and efficient approximations for radiocoloring in planar graphs
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
1893
, 2000, pp. 363-372