Christos Kaklamanis

	2012
112		Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the approximability of Dodgson and Young elections. Artif. Intell. 187: 31-51 (2012)
111		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos: On the efficiency of equilibria in generalized second price auctions CoRR abs/1201.6429: (2012)
110		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: The Efficiency of Fair Division. Theory Comput. Syst. 50(4): 589-610 (2012)
	2011
109		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: On the efficiency of equilibria in generalized second price auctions. ACM Conference on Electronic Commerce 2011: 81-90
108		Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou: Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. FAW-AAIM 2011: 185-195
107		Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli: Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61(3): 606-637 (2011)
106		Christos Kaklamanis, Martin Skutella: Preface. Theor. Comput. Sci. 412(7): 561-562 (2011)
	2010
105		Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia: Socially desirable approximations for Dodgson's voting rule. ACM Conference on Electronic Commerce 2010: 253-262
104		Stavros Athanassopoulos, Christos Kaklamanis, Ilias Laftsidis, Evi Papaioannou: An experimental study of greedy routing algorithms. HPCS 2010: 150-156
103		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Evi Papaioannou: The Impact of Altruism on the Efficiency of Atomic Congestion Games. TGC 2010: 172-188
102		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Taxes for linear atomic congestion games. ACM Transactions on Algorithms 7(1): 13 (2010)
101		Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano: Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58(2): 516-540 (2010)
	2009
100		Christos Kaklamanis, Flemming Nielson: Trustworthy Global Computing, 4th International Symposium, TGC 2008, Barcelona, Spain, November 3-4, 2008, Revised Selected Papers Springer 2009
99		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: On Low-Envy Truthful Allocations. ADT 2009: 111-119
98		Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Energy-Efficient Communication in Multi-interface Wireless Networks. MFCS 2009: 102-111
97		Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou: An Improved Approximation Bound for Spanning Star Forest and Color Saving. MFCS 2009: 90-101
96		Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the approximability of Dodgson and Young elections. SODA 2009: 1058-1067
95		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: The Efficiency of Fair Division. WINE 2009: 475-482
94		Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano: Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725
93		Thomas Erlebach, Christos Kaklamanis: WAOA 2006 Special Issue of TOCS. Theory Comput. Syst. 45(3): 427-428 (2009)
92		Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Theory Comput. Syst. 45(3): 555-576 (2009)
	2008
91		Christos Kaklamanis, Martin Skutella: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers Springer 2008
90		Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese: Communication in wireless networks with directional antennas. SPAA 2008: 344-351
89		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Improving the Efficiency of Load Balancing Games through Taxes. WINE 2008: 374-385
88		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Competitive algorithms and lower bounds for online randomized call control in cellular networks. Networks 52(4): 235-251 (2008)
87		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou: Scheduling to maximize participation. Theor. Comput. Sci. 402(2-3): 142-155 (2008)
86		Christos Kaklamanis: Preface. Theor. Comput. Sci. 406(3): 171-172 (2008)
	2007
85		Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis: Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2007: 793
84		Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. FCT 2007: 52-63
83		Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discrete Applied Mathematics 155(2): 119-136 (2007)
82		Charalampos Konstantopoulos, Christos Kaklamanis: Optimal hypercube simulation on the partitioned optical passive stars network. The Journal of Supercomputing 42(2): 165-180 (2007)
81		Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2-3): 152-160 (2007)
	2006
80		Thomas Erlebach, Christos Kaklamanis: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers Springer 2006
79		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Taxes for Linear Atomic Congestion Games. ESA 2006: 184-195
78		Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli: Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322
77		Christos Kaklamanis: Project AEOLUS: An Overview. TGC 2006: 1-9
76		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou: Scheduling to Maximize Participation. TGC 2006: 218-232
75		Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano: Efficient automatic simulation of parallel computation on networks of workstations. Discrete Applied Mathematics 154(10): 1500-1509 (2006)
74		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Energy-Efficient Wireless Network Design. Theory Comput. Syst. 39(5): 593-617 (2006)
	2005
73		Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Geometric Clustering to Minimize the Sum of Cluster Sizes. ESA 2005: 460-471
72		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. Euro-Par 2005: 1089-1099
71		Christos Kaklamanis, Charalampos Konstantopoulos: Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks. Euro-Par 2005: 952-961
70		Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis: Basic Computations in Wireless Networks. ISAAC 2005: 533-542
69		Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis: Network Load Games. ISAAC 2005: 809-818
68		Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: A Tight Bound for Online Coloring of Disk Graphs. SIROCCO 2005: 78-88
67		Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Giuseppe Persiano: Station Placement in Networks. Parallel Processing Letters 15(1-2): 117-130 (2005)
	2004
66		Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. ADHOC-NOW 2004: 183-196
65		Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina: Topic 13: Theory and Algorithms for Parallel Computation. Euro-Par 2004: 803
64		Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: Online Algorithms for Disk Graphs. MFCS 2004: 215-226
63		Ioannis Caragiannis, Christos Kaklamanis: Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. STACS 2004: 258-269
62		Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate constrained bipartite edge coloring. Discrete Applied Mathematics 143(1-3): 54-61 (2004)
61		Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: Efficient binary and grey level morphological operations on a massively parallel processor. Parallel Algorithms Appl. 19(1): 33-50 (2004)
	2003
60		Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann: Topic Introduction. Euro-Par 2003: 884
59		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Energy-Efficient Wireless Network Design. ISAAC 2003: 585-594
58		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Power Consumption Problems in Ad-Hoc Wireless Networks. WAOA 2003: 252-255
57		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Simple On-Line Algorithms for Call Control in Cellular Networks. WAOA 2003: 67-80
56		Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos: Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94
55		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. Inf. Process. Lett. 86(3): 149-154 (2003)
	2002
54		Christos Kaklamanis, Lefteris M. Kirousis: SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002 Carleton Scientific 2002
53		Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). Euro-Par 2002: 431-435
52		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New Results for Energy-Efficient Broadcasting in Wireless Networks. ISAAC 2002: 332-343
51		Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano: Wavelength Routing in All-Optical Tree Networks: A Survey. Bulletin of the EATCS 76: 104-124 (2002)
50		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New bounds on the size of the minimum feedback vertex set in meshes and butterflies. Inf. Process. Lett. 83(5): 275-280 (2002)
49		Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg: Station Layouts in the Presence of Location Constraints. Journal of Interconnection Networks 3(1-2): 1-17 (2002)
48		Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Edge coloring of bipartite graphs with constraints. Theor. Comput. Sci. 270(1-2): 361-399 (2002)
47		Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Randomized path coloring on binary trees. Theor. Comput. Sci. 289(1): 355-399 (2002)
46		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. Theory Comput. Syst. 35(5): 521-543 (2002)
	2001
45		Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano: Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743
44		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Competitive Analysis of On-line Randomized Call Control in Cellular Networks. IPDPS 2001: 14
43		Christos Kaklamanis: Bandwidth allocation in WDM tree networks. IPDPS 2001: 198
42		Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: A hypercube parallel algorithm in texture analysis. SIP 2001: 47-50
41		Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. SIROCCO 2001: 77-88
40		Christos Kaklamanis: Recent Advances in Wavelength Routing. SOFSEM 2001: 58-72
39		Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano: Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). STACS 2001: 271-282
38		Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31
37		Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano: Wavelength Routing in All-optical Tree Networks: A Survey. Computers and Artificial Intelligence 20(2): (2001)
36		Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: Efficient primitive binary morphological algorithms on a massively parallel processor. J. Electronic Imaging 10(2): 567-575 (2001)
35		Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano: Sparse and limited wavelength conversion in all-optical tree networks. Theor. Comput. Sci. 266(1-2): 887-934 (2001)
	2000
34		Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Randomized path coloring on binary trees. APPROX 2000: 60-71
33		Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis: Sliding-Window Compression on the Hypercube (Research Note). Euro-Par 2000: 835-838
32		Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados: Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note). Euro-Par 2000: 877-881
31		Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano: Efficient Automatic Simulation of Parallel Computation on Network of Workstations. ICALP Satellite Workshops 2000: 191-202
30		Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: fficient Binary Morphological Algorithms on a Massively Parallel Processor. IPDPS 2000: 281-
29		Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados: Greedy Dynamic Hot-Potato Routing on Arrays. ISPAN 2000: 178-185
28		Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Efficient on-line communication in cellular networks. SPAA 2000: 46-53
27		Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis: An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems. Concurrency - Practice and Experience 12(5): 289-309 (2000)
26		Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters 10(4): 305-314 (2000)
25		Christos Kaklamanis, Charalampos Konstantopoulos, Andreas Svolos: A Hypercube Algorithm for Sliding Window Compression. Parallel Processing Letters 10(4): 315-326 (2000)
	1999
24		Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis: Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor. ACPC 1999: 265-275
23		Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis: Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. Algorithm Engineering 1999: 259-271
22		Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg: Station Layouts in the Presence of Location Constraints. ISAAC 1999: 269-278
21		Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Edge Coloring of Bipartite Graphs with Constraints. MFCS 1999: 376-386
20		Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano: Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. 221(1-2): 119-137 (1999)
	1998
19		Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: On the Complexity of Wavelength Converters. MFCS 1998: 771-779
18		Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. SIROCCO 1998: 10-19
	1997
17		Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen: Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP 1997: 493-504
16		Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. SIROCCO 1997: 24-39
15		Christos Kaklamanis, Danny Krizanc, Satish Rao: New Graph Decompositions with Applications to Emulations. Theory Comput. Syst. 30(1): 39-49 (1997)
	1996
14		Lefteris M. Kirousis, Christos Kaklamanis: Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995 Carleton Scientific 1996
13		Christos Kaklamanis, Giuseppe Persiano: Efficient Wavelength Routing on Directed Fiber Trees. ESA 1996: 460-470
12		Christos Kaklamanis, Danny Krizanc: Multipacket Hot-Potato Routing on Processor Arrays. Euro-Par, Vol. I 1996: 270-277
	1995
11		Milena Mihail, Christos Kaklamanis, Satish Rao: Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. FOCS 1995: 548-557
	1994
10		Christos Kaklamanis, Giuseppe Persiano: Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. Mathematical Systems Theory 27(5): 471-489 (1994)
	1993
9		Christos Kaklamanis, Danny Krizanc, Satish Rao: Universal Emulations with Sublogarithmic Slowdown FOCS 1993: 341-350
8		Christos Kaklamanis, Danny Krizanc, Satish Rao: New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. SPAA 1993: 325-334
	1992
7		Christos Kaklamanis, Giuseppe Persiano: Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. SPAA 1992: 118-126
6		Christos Kaklamanis, Danny Krizanc, Satish Rao: Simple Path Selection for Optimal Routing on Processor Arrays. SPAA 1992: 23-30
5		Christos Kaklamanis, Danny Krizanc: Optimal Sorting on Mesh-Connected Processor Arrays. SPAA 1992: 50-59
	1991
4		Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas: Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). SPAA 1991: 17-28
3		Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas: Tight Bounds for Oblivious Routing in the Hypercube. Mathematical Systems Theory 24(4): 223-232 (1991)
	1990
2		Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas: Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) FOCS 1990: 285-296
1		Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas: Tight Bounds for Oblivious Routing in the Hypercube. SPAA 1990: 31-36

Coauthor Index

1	Nancy M. Amato	[65]
2	Stavros Athanassopoulos	[66] [84] [92] [97] [98] [104]
3	Vincenzo Auletta	[16] [19] [34] [35] [47]
4	Constantinos Bartzis	[32]
5	Vittorio Bilò	[73]
6	Prosenjit Bose	[22] [49]
7	Athanasios Bouganis	[23]
8	Ioannis Caragiannis	[16] [18] [19] [21] [23] [26] [28] [29] [32] [34] [35] [37] [38] [41] [44] [45] [46] [47] [48] [50] [51] [52] [55] [56] [57] [58] [59] [62] [63] [64] [66] [68] [69] [70] [72] [73] [74] [76] [78] [79] [81] [83] [84] [87] [88] [89] [90] [92] [95] [96] [97] [98] [99] [101] [102] [103] [105] [107] [108] [109] [110] [111] [112]
9	Jason A. Covey	[96] [112]
10	Thomas Erlebach	[17] [20] [80] [93] [94]
11	Pascal Felber	[85]
12	Michal Feldman	[96] [112]
13	Afonso Ferreira	[38] [45] [62] [101]
14	Aleksei V. Fishkin	[64] [68] [81] [83]
15	Michele Flammini	[78] [107]
16	Pierre Fraigniaud	[60]
17	Clemente Galdi	[39] [67] [69] [70]
18	Luisa Gargano	[35]
19	Christopher Homan (Christopher M. Homan)	[96] [112]
20	Klaus Jansen	[17] [20] [94]
21	Panagiotis Kanellopoulos	[41] [50] [52] [55] [58] [59] [66] [73] [74] [76] [78] [79] [87] [89] [95] [99] [102] [103] [107] [109] [110] [111]
22	Nikos Karanikolas	[96] [105] [112]
23	Anna R. Karlin	[2]
24	Michael Kaufmann	[60]
25	Lefteris M. Kirousis	[14] [22] [49] [54]
26	Charalampos Konstantopoulos	[24] [25] [27] [30] [33] [36] [42] [53] [61] [71] [82]
27	Evangelos Kranakis	[22] [49] [90]
28	Danny Krizanc	[1] [3] [4] [5] [6] [8] [9] [12] [15] [22] [31] [49] [60] [65] [75] [90]
29	Maria Kyropoulou	[95] [97] [99] [103] [108] [109] [110] [111]
30	Ilias Laftsidis	[104]
31	Frank Thomson Leighton (Tom Leighton)	[2]
32	Renato Paes Leme	[111]
33	Brendan Lucier	[111]
34	Milena Mihail	[11] [20]
35	Victor J. Milenkovic (Victor Milenkovic)	[2]
36	Manuela Montangero	[31] [39] [67] [75]
37	Luca Moscardelli	[78] [107]
38	Lata Narayanan	[4]
39	Flemming Nielson	[100]
40	Evi Papaioannou	[28] [44] [46] [57] [64] [68] [72] [76] [81] [83] [87] [88] [98] [103] [104]
41	David Peleg	[22] [49]
42	Stéphane Pérennes (Stephane Perennes)	[38] [45] [62] [101]
43	Giuseppe Persiano (Pino Persiano)	[7] [10] [13] [16] [17] [18] [19] [20] [21] [26] [31] [34] [35] [37] [38] [39] [47] [48] [51] [56] [62] [67] [75] [94]
44	Andrea Pietracaprina	[65]
45	Ariel D. Procaccia	[96] [105] [112]
46	Prabhakar Raghavan	[2]
47	Satish Rao	[2] [6] [8] [9] [11] [15]
48	Hervé Rivano	[38] [45] [62] [101]
49	Jeffrey S. Rosenschein	[96] [112]
50	Nicolas Schabanel	[85]
51	Nir Shavit	[85]
52	Anastasios Sidiropoulos	[56]
53	Martin Skutella	[91] [106]
54	Andreas Svolos	[24] [25] [27] [30] [33] [36] [42] [53] [61]
55	Éva Tardos	[111]
56	Clark D. Thomborson (Clark D. Thompson)	[2]
57	A. Tsantilas	[2]
58	Thanasis Tsantilas	[1] [3] [4]
59	Yannis Vergados (Ioannis Vergados)	[29] [32]
60	Andreas Wiese	[90]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page