Spyros C. Kontogiannis

	2009
30		Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis: Incentive-Compatible Robust Line Planning. Robust and Online Large-Scale Optimization 2009: 85-118
29		Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis: Preface. Theor. Comput. Sci. 410(17): 1551 (2009)
28		Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. 410(17): 1599-1606 (2009)
27		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)
26		Spyros C. Kontogiannis, Paul G. Spirakis: On the support size of stable strategies in random games. Theor. Comput. Sci. 410(8-10): 933-942 (2009)
	2008
25		Spyros C. Kontogiannis, Christos D. Zaroliagis: Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. ATMOS 2008
24		Spyros C. Kontogiannis, Paul G. Spirakis: Equilibrium Points in Fear of Correlated Threats. WINE 2008: 210-221
23		Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008
22		Spyros C. Kontogiannis: Computing Pure Equilibria in the Game of Parallel Links. Encyclopedia of Algorithms 2008
21		Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic congestion games among coalitions. ACM Transactions on Algorithms 4(4): (2008)
	2007
20		Spyros C. Kontogiannis, Paul G. Spirakis: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. ICALP 2007: 595-606
19		Spyros C. Kontogiannis, Paul G. Spirakis: Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. MFCS 2007: 596-608
18		Spyros C. Kontogiannis, Paul G. Spirakis: On the Support Size of Stable Strategies in Random Games. SAGA 2007: 154-165
17		Spyros C. Kontogiannis, Paul G. Spirakis: Probabilistic Techniques in Algorithmic Game Theory. SAGA 2007: 30-53
	2006
16		Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings Springer 2006
15		Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583
14		Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006: 286-296
13		Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electronic Colloquium on Computational Complexity (ECCC) 13(081): (2006)
	2005
12		Spyros C. Kontogiannis, Paul G. Spirakis: Counting Stable Strategies in Random Evolutionary Games. ISAAC 2005: 839-848
11		Spyros C. Kontogiannis, Paul G. Spirakis: The Contribution of Game Theory to Complex Systems. Panhellenic Conference on Informatics 2005: 101-111
10		Spyros C. Kontogiannis, Paul G. Spirakis: Evolutionary Games: An Algorithmic View. Self-star Properties in Complex Information Systems 2005: 97-111
9		Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175
8		Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Selfish Routing in Networks: A Survey. WINE 2005: 989-1002
7		Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005)
	2004
6		Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish Unsplittable Flows. ICALP 2004: 593-605
	2002
5		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
4		Spyros C. Kontogiannis: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. STOC 2002: 124-133
	2000
3		Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000)
	1998
2		Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: ``Dynamic-Fault-Prone BSP'': A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46
	1997
1		Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis: Efficient Computations on Fault-Prone BSP Machines. SPAA 1997: 84-93

Coauthor Index

1	Apostolos Bessas	[30]
2	Dimitris Fotakis	[5] [6] [7] [9] [15] [21] [27]
3	Elias Koutsoupias	[5] [27]
4	Marios Mavronicolas	[5] [16] [27] [29]
5	Panagiota N. Panagopoulou	[13] [14] [23] [28]
6	Grammati E. Pantziou	[1] [2] [3]
7	Paul G. Spirakis	[1] [2] [3] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [23] [24] [26] [27] [28] [29]
8	Moti Yung (Mordechai M. Yung)	[2] [3]
9	Christos D. Zaroliagis	[25] [30]