Christos Kaklamanis
Christos Kaklamanis
University of Patras & Computer Technology Institute and Press "Diophantus"
Verified email at ceid.upatras.gr - Homepage
Title
Cited by
Cited by
Year
Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings
M Mihail, C Kaklamanis, S Rao
Proceedings of IEEE 36th Annual Foundations of Computer Science, 548-557, 1995
1881995
Tight bounds for oblivious routing in the hypercube
C Kaklamanis, D Krizanc, T Tsantilas
Mathematical Systems Theory 24 (1), 223-232, 1991
1491991
The Steiner tree problem on graphs: Inapproximability results
M Chlebík, J Chlebíková
Theoretical Computer Science 406 (3), 207-214, 2008
1172008
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
International Colloquium on Automata, Languages, and Programming, 311-322, 2006
982006
Optimal wavelength routing on directed fiber trees
T Erlebach, K Jansen, C Kaklamanis, M Mihail, P Persiano
Theoretical Computer Science 221 (1-2), 119-137, 1999
921999
Asymptotically tight bounds for computing with faulty arrays of processors
C Kaklamanis, AR Karlin, FT Leighton, V Milenkovic, P Raghavan, S Rao, ...
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
861990
The efficiency of fair division
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou
Theory of Computing Systems 50 (4), 589-610, 2012
842012
On the efficiency of equilibria in generalized second price auctions
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou
Proceedings of the 12th ACM conference on Electronic commerce, 81-90, 2011
842011
Constrained bipartite edge coloring with applications to wavelength routing
C Kaklamanis, P Persiano, T Erlebach, K Jansen
International Colloquium on Automata, Languages, and Programming, 493-504, 1997
841997
Geometric clustering to minimize the sum of cluster sizes
V Bilň, I Caragiannis, C Kaklamanis, P Kanellopoulos
European Symposium on Algorithms, 460-471, 2005
802005
On the approximability of Dodgson and Young elections
I Caragiannis, JA Covey, M Feldman, CM Homan, C Kaklamanis, ...
Artificial Intelligence 187, 31-51, 2012
692012
Efficient wavelength routing on directed fiber trees
C Kaklamanis, P Persiano
European Symposium on Algorithms, 460-470, 1996
691996
Bounding the inefficiency of outcomes in generalized second price auctions
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou, B Lucier, ...
Journal of Economic Theory 156, 343-388, 2015
682015
Hot-potato routing on processor arrays
C Kaklamanis, D Krizanc, S Rao
Proceedings of the fifth annual ACM symposium on Parallel algorithms and …, 1993
671993
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
Algorithmica 61 (3), 606-637, 2011
642011
Branch-and-bound and backtrack search on mesh-connected arrays of processors
C Kaklamanis, G Persiano
Mathematical Systems Theory 27 (5), 471-489, 1994
641994
Communication in wireless networks with directional antennas
I Caragiannis, C Kaklamanis, E Kranakis, D Krizanc, A Wiese
Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008
582008
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
C Kaklamanis, D Krizanc, L Narayanan, T Tsantilas
Proceedings of the third annual ACM symposium on Parallel algorithms and …, 1991
551991
Socially desirable approximations for Dodgson’s voting rule
I Caragiannis, C Kaklamanis, N Karanikolas, AD Procaccia
ACM Transactions on Algorithms (TALG) 10 (2), 1-28, 2014
532014
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
I Caragiannis, C Kaklamanis, P Kanellopoulos
Information Processing Letters 83 (5), 275-280, 2002
482002
The system can't perform the operation now. Try again later.
Articles 1–20