Short CV
Christos Kaklamanis received his S.B. in Computer Science and Engineering from Massachusetts Institute of Technology, Cambridge, MA, USA (1986). Then he obtained his S.M. (1989) and his Ph.D. (1992) in Computer Science from Harvard University, Cambridge, MA, USA. Afterwards he worked as Postdoctoral Fellow in Computer Science under the program for Massively Parallel Computation at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS, Piscataway, NJ), an NSF funded joint project of Rutgers University, Princeton University, AT\&T Bell Laboratories, and BellCoRe. He also worked as research consultant for NEC Research Institute, Princeton, NJ.
Currently, he is Full Professor and Vice-Chair at the Department of Computer Engineering and
Informatics of University of Patras where, from 1997 to 2003, he served as
Director of the "Division of Applications and Foundations of Computer Science"
and from 2003 to 2005, he served as Vice-Chair. He is also a senior researcher
at the Research Academic Computer Technology Institute, Patras, Greece, where
from 2007 he serves as Deputy Director. His research interests include Parallel
Computation and Communication, Design and Analysis of Algorithms, Networks,
Theory of Computation, Randomized and Approximation Algorithms, Fault Tolerance.
He is (co-) author of more than 100 publications in major international
conferences and journals. He has been a member of the scientific program and
steering committees of several major conferences. During the last years, he has
participated as leader/key researcher in many research, development or
consulting projects funded by the European Union, the Greek State or the private
sector, including the EU-FET projects
CRESCCO and
AEOLUS where he is the
coordinator. He is an elected member of the National Representation of the
Technical Chamber of Greece and of the Scientific Committee of Electronic
Engineers. Member of ACM (SIGACT), IEEE Computer Society and EATCS.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. ACM Transactions on Algorithms, to appear.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional path coloring in bounded degree trees with applications. Algorithmica, to appear.
S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis. Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory of Computing Systems, 45(3), pp. 555-576, 2009.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. Theoretical Computer Science, 402 (2-3), pp. 142-155, 2008. (TGC '06 special issue)
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Competitive Algorithms and Lower Bounds for Online Randomized Call Control in Cellular Networks. Networks, 52(4), pp. 235-251, 2008.
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. A tight bound for on-line coloring of disk graphs. Theoretical Computer Science, 384 (2-3), pp. 152-160, 2007. (SIROCCO '05 special issue)
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. Randomized Online Algorithms and Lower Bounds for Computing Large Independent Sets in Disk Graphs. Discrete Applied Mathematics, 155 (2), pp. 119-136, 2006. (MFCS '04 special issue)
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, Energy-Efficient Wireless Network Design. Theory of Computing Systems, Vol. 39(5), pp. 593-617, 2006.
C. Galdi, C. Kaklamanis, M. Montangero, G. Persiano. Station Placement in Networks. Parallel Processing Letters, 15(1-2): 117-130, 2005.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 143 (1-3): 54-61 (2004).
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis: Efficient binary and grey level morphological operations on a massively parallel processor. Parallel Algorithms and Applications, 19(1): 33-50 (2004).
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. A Logarithmic Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph Problem. Information Processing Letters, Vol. 86(3), pp. 149-154, 2003.
P. Bose, E. Kranakis, C. Kaklamanis, L. M. Kirousis, D. Krizanc, D. Peleg: Station Layouts in the Presence of Location Constraints. Journal of Interconnection Networks 3(1-2): 1-17 (2002)
I. Caragiannis, C. Kaklamanis, P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. Theoretical Computer Science, Vol. 270 (1-2), pp. 361-399, 2002.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. Efficient On-line Frequency Allocation and Call Control in Cellular Networks. Theory of Computing Systems, Vol. 35 (5), pp. 521-543, 2002.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies. Information Processing Letters, Vol. 83 (5), pp. 275-280, 2002.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. Theoretical Computer Science, Vol. 289 (1), pp. 355-399, 2002.
A. I. Svolos, C. G. Konstantopoulos, and C. Kaklamanis. Efficient primitive binary morphological algorithms on a massively parallel processor. SPIE Journal of Electronic Imaging, Vol. 10(2), 2001.
I. Caragiannis, C. Kaklamanis, P. Persiano. Wavelength Routing in All-Optical Tree Networks: A Survey. Computers and Informatics (formerly Computers and Artificial Intelligence),Vol. 20 (2), pp. 95-120, 2001.
V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, and P. Persiano. Sparse and Limited Wavelength Conversion in All-Optical Tree Networks. Theoretical Computer Science, 266(1-2), pp. 887-934, 2001.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. A Hypercube Algorithm for Sliding Window Compression. Parallel Processing Letters, 10(4), pp. 315-326, 2000.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. An Efficient Parallel Algorithm for Motion Estimation in Very Low Bit-Rate Video Coding Systems. Concurrency: Practice and Experience, Vol. 12, pp. 289-309, 2000.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. Polyvalent Parallelizations for Hierarchical Block Matching Motion Estimation. Journal of Computing and Information Technology, Vol. 8 (1), pp. 41-69, 2000, (invited paper).
I. Caragiannis, C. Kaklamanis, P. Persiano. Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, Vol. 10 (4), pp. 305-313, 2000.
T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal Wavelength Routing on Directed Fiber Trees. Theoretical Computer Science, 221(1-2), pp. 119-137, 1999, (invited paper).
T. Erlebach, K. Jansen, C. Kaklamanis, and P. Persiano. Directed tree networks. Chapter in Encyclopedia of Optimization, C.A. Floudas, P.M. Pardalos (eds.), Kluwer Academic Publisher, pp. 716-725, 2009.
V. Bilo, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli. Game-theoretic approaches to optimization problems in communication netwotks. Chapter in Graphs and Algorithms in Communication Networks, A. M. C. Koster and Z. Munioz (eds.), Springer, pp. 241-263, 2009.
I. Caragiannis, M. Flammini, C. Kaklamanis, R. Klasing, and A. Navarra. Energy consumption minimization in ad hoc wireless, and multi-interface networks. Chapter in Graphs and Algorithms in Communication Networks, A. M. C. Koster and Z. Munioz (eds.), Springer, pp. 335-355, 2009.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Minimum energy Communication in ad hoc wireless networks: A survey. Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, S. Rajasekaran and J. Reif (eds.), Chapman & Hall/CRC Computer & Information Science Series, 38, 1-20, 2007.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Online call admission control in wireless cellular networks. Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, S. Rajasekaran and J. Reif (eds.), Chapman & Hall/CRC Computer & Information Science Series, 39, 1-20, 2007.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Approximation
Algorithms for Path Coloring in Trees. Chapter in Efficient Approximation and
Online Algorithms, E. Bampis, K. Jansen, and C. Kenyon (eds.), LNCS 3484,
Springer, pp. 74-96, 2006.
Conference Proceedings
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. An improved approximation bound for spanning star forest and color saving. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 90-101, 2009.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Energy-efficient communication in multi-interface wireless networks. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 102-111, 2009.
I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), pp. 1058-1067, 2009.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Improving the efficiency of load balancing games through taxes. In Proceedings of the 4th International Workshop on Internet and Network Economics (WINE 08), LNCS, Springer, 2008, to appear.
I. Caragiannis, C. Kaklamanis, E. Kranakis, D. Krizanc, and A. Wiese. Communication in wireless networks with directional antennas. In Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 08), pp. 344-351, 2008.
S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis. Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT 07), LNCS 4639, Springer, pp. 52-63, 2007.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), LNCS 4661, Springer, pp. 218-232, 2006.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 06), LNCS 4168, Springer, pp. 184-195, 2006.
I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. In Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 06), LNCS 4051, Springer, Part I, pp. 311-322, 2006.
I. Caragiannis, C. Galdi, and C. Kaklamanis Network Load Games. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 809-818, 2005.
I. Caragiannis, C. Galdi, and C. Kaklamanis. Basic Computations in Wireless Networks. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 533-542, 2005.
V. Bilo, I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Geometric Clustering to Minimize the Sum of Cluster Sizes. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 05), LNCS 3669, Springer, pp. 460-471, 2005.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. In Proceedings of EUROPAR 2005 Parallel Processing, LNCS 3648, Springer, pp. 1089-1099, 2005.
C. Konstantopoulos, C. Kaklamanis. Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks. In Proceedings of EUROPAR 2005 Parallel Processing, LNCS 3648, Springer, pp. 952-961, 2005.
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. A Tight Bound for Online Coloring of Disk Graphs. In Proceedings of the 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO '05), LNCS 3499, Springer, pp. 78-88, 2005.
I. Caragiannis, A. Fishkin, C. Kaklamanis, and E. Papaioannou. On-line Algorithms for Disk Graphs. In Proc. of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS '04), LNCS 3153, Springer, pp. 215-226, 2004.
I. Caragiannis and C. Kaklamanis. Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. In Proc. of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS '04), LNCS 2996, Springer, pp. 258 - 269, 2004.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. In Proc. of the 3rd International Conference for Ad Hoc Networks and Wireless (ADHOC-NOW '04), LNCS, Springer, pp. 183-196, 2004.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Power Consumption Problems in Ad Hoc Wireless Networks. In Proc. of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 252-255, 2003.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Simple On-line Algorithms for Call Control in Cellular Networks. In Proc. of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 67-80, 2003.
I. Caragiannis, C. Kaklamanis, P. Persiano, and A. Sidiropoulos. Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. In Proc. of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 81-94, 2003.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Energy-Efficient Wireless Network Design. In Proc. of the 14th Annual International Symposium on Algorithms and Computation (ISAAC '03), LNCS 2906, Springer, pp. 585-594, 2003.
A. Svolos, C. Konstantopoulos, C. Kaklamanis. A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). Euro-Par 2002, pp. 431-435, 2002.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proc. of the 13th Annual International Symposium on Algorithms and Computation (ISAAC '02), LNCS 2518, Springer, pp. 332-343, 2002.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. Competitive Analysis of On-line Randomized Call Control in Cellular Networks. In Proc. of the 15th International Parallel and Distributed Processing Symposium (IPDPS 01), IEEE Computer Society Press, 2001.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies. In Proc. of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 01), pp. 77-88, 2001.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. In Proc. of the 27th International Workshop on Graph-Theoretic Concepts of Computer Science (WG 01), LNCS 2204, Springer, pp. 21-31, 2001.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional Path Coloring with Applications to WDM Networks. In Proc. of the 28th International Colloquium on Automata, Languages, and Programming (ICALP 01), LNCS 2076, Springer, pp. 732-743, 2001.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Randomized Call Control in Sparse Wireless Cellular Networks. In Proc. of the 8th International Conference on Advances in Communications and Control (COMCON 01), pp. 73-82, 2001.
C. Kaklamanis. Recent Advances in Wavelength Routing. SOFSEM 2001, pp. 58-72, 2001.
C. Galdi, C. Kaklamanis, M. Montangero, and P. Persiano. Optimal and Approximate Station Placement in Networks (with Applications to Multicasting and Space Efficient Traversals). In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), pp. 271-282, 2001.
I. Caragiannis, C. Kaklamanis, and I. Vergados, Greedy Dynamic Hot-Potato Routing on Arrays. In Proceedings of 5th International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN 2000), to appear.
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Randomized Path Coloring on Binary Trees. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2000), LNCS 1913, Springer, pp. 60-71, 2000.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. Sliding-Window Compression on the Hypercube. In Proceedings of EUROPAR 2000-Parallel Processing, LNCS 1900, Springer, pp.835-838, 2000.
C. Bartzis, I. Caragiannis, C. Kaklamanis, and I. Vergados. Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processors Arrays. In Proceedings of EUROPAR 2000-Parallel Processing, LNCS 1900, Springer, pp. 877-881, 2000.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Efficient On-line Communication in Cellular Networks. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pp. 46-53, July 2000.
C. Kaklamanis, D. Krizanc, M. Montangero, and P. Persiano. Efficient Automatic Simulation of Parallel Computation on Network of Workstations. In Proceedings of ICALP Satellite Workshops 2000 (ARACNE 2000), pp. 191-202, 2000.
A.I. Svolos, C.G. Konstantopoulos, and C. Kaklamanis. Efficient Binary Morphological Algorithms on a Massively Parallel Processor. In Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS 00), 2000.
P. Bose, C. Kaklamanis, L. M. Kirousis, E. Kranakis, D. Krizanc, and D. Peleg. Station Layouts in the Presence of Location Constraints. In Proceedings of 10th International Symposium on Algorithms and Computation (ISAAC 99), LNCS 1741, Springer, pp. 269-278, 1999.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS 99), LNCS 1672, Springer, pp. 376-386, 1999.