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="Kaporis, A.C."
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
On the chromatic number of a random 5-regular graph
J. Díaz
,
A.C. Kaporis
,
G.D. Kemkes
,
L.M. Kirousis
,
X. Pérez
,
N. Wormald
Journal of Graph Theory
61
(3), 2009, pp. 157-191
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
A.C. Kaporis
,
P.G. Spirakis
Theoretical Computer Science
410
(8-10), 2009, pp. 745-755
Approximating almost all instances of MAX-CUT within a ratio above the Håstad threshold
A.C. Kaporis
,
L.M. Kirousis
,
E.C. Stavropoulos
Lecture Notes in Computer Science
4168
, 2006, pp. 432-443
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
A.C. Kaporis
,
P.G. Spirakis
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 19-28
5-regular graphs are 3-colorable with positive probability
J. Díaz
,
G. Grammatikopoulos
,
A.C. Kaporis
,
L.M. Kirousis
,
X. Pérez
,
D.G. Sotiropoulos
Lecture Notes in Computer Science
3669
, 2005, pp. 215-225