Christos Kaklamanis

Professor

Department of Computer Engineering and Informatics,
University of Patras and CTI "Diophantus",
Building B,
GR 26504, Rion
Tel: +30 2610 997868, +30 2610 960300, +30 210 3350600
Fax: +30 2610 960479
Email: kakl at ceid.upatras.gr, ckakl at cti.gr

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 at the Department of Computer Engineering and Informatics of University of Patras where, from 2009 to 2011 and from 2003 to 2005 he served as Vice-Chair and from 1997 to 2003, he served as Director of the "Division of Applications and Foundations of Computer Science". He is also a senior researcher at the Computer Technology Institute & Press "Diophantus", Patras, Greece, where since 2007 he serves as Vice President. His research interests include design and analysis of algorithms, theory of computation, parallel and distributed computing, randomized and approximation algorithms, high-performance computing, fault tolerance, algorithmic game theory, computational social choice, cryptography, art and technology. 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 was the coordinator, the EU-ICT Project EULER as well as the project "DIGITAL SCHOOL: Specifying a Digital Educational Platform, Building and Operating an Educational Knowledge Base, Adapting and Annotating Learning Objects with Educational Metadata, Building the Infrastructure to Support Exemplary Teaching Practices and the Use of the Participatory Web", co-funded by the Greek National Strategic Reference Framework (NSRF), No 296441 (2010-2015), where he is the coordinator. He is a member of the Association for Computing Machinery (ACM), the European Association for Theoretical Computer Science (EATCS-council member), the Institute of Electrical and Electronics Engineers (IEEE), the Technical Chamber of Greece (TEE).

Courses

Theory of Computation (CEI 301)
Parallel Algorithms (CEI 412)
Communication Algorithms (CEI 512)
Cryptography (CEI 416)
Special Topics of Computation and Complexity (CEI 402)
Advanced Communication Algorithms (graduate)

Conference Committees

Recent Publications

Journals

I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, to appear.
I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for combinatorial frugal coverage algorithms. Journal of Combinatorial Optimization, to appear.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Energy-efficient communication in multi-interface wireless networks. Theory of Computing Systems, 52 (2), pp. 285-296, 2013.
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. Artificial Intelligence, 187-188, pp. 31-51, 2012.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. Theory of Computing Systems, 50(4), pp. 589-610, 2012
I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3), pp. 606-637, 2011.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. ACM Transactions on Algorithms, 7(1), article no. 13, 2010.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional path coloring in bounded degree trees with applications. Algorithmica, 58(2), pp. 516-540, 2010.
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, 2007. (MFCS 04 special issue)
C. Kaklamanis, D. Krizanc, M. Montangero, and G. Persiano. Efficient automatic simulation of parallel computation on networks of workstations. Discrete Applied Mathematics, Vol. 154(10), pp. 1500-1509, 2006.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos, Energy-Efficient Wireless Network Design. Theory of Computing Systems, Vol. 39(5), pp. 593-617, 2006.
C. Galdi, C. Kaklamanis, M. Montangero, and 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).
A. Svolos, C. Konstantopoulos, and C. 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, and D. Peleg. Station Layouts in the Presence of Location Constraints. Journal of Interconnection Networks 3(1-2): 1-17 (2002)
I. Caragiannis, C. Kaklamanis, and P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. Theoretical Computer Science, Vol. 270 (1-2), pp. 361-399, 2002.
I. Caragiannis, C. Kaklamanis, and 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, and 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), pp. 567-575, 2001.
I. Caragiannis, C. Kaklamanis, and 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, and P. Persiano. Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, Vol. 10 (4), pp. 305-314, 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).
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Efficient Wavelength Routing in Trees with Low-Degree Converters. DIMACS Series in Discrete Mathematics and Computer Science, AMS, vol. 46, Multichannel Optical Networks: Theory and Practice, pp. 1-14, 1998.
T. Erlebach, K. Jansen, C. Kaklamanis, and P. Persiano. An optimal greedy algorithm for wavelength allocation in directed tree networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Vol. 40, Network Design: Connectivity and Facilities Location, pp. 117-130, 1997.
C. Kaklamanis, D. Krizanc, and S. Rao. New Graph Decompositions with Applications to Emulations. Theory of Computing Systems, 30, pp. 39-49, 1997 (invited paper).
C. Kaklamanis and G. Persiano. Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. Mathematical Systems Theory, 27, pp. 471-489, 1993 (invited paper).
C. Kaklamanis, D. Krizanc, and A. Tsantilas. Tight Bounds for Oblivious Routing in the Hypercube. Mathematical Systems Theory, 24(4): 223-232, 1991, (invited paper).

Book Chapters

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. Collection of theoretical findings on algorithmic principles for building efficient overlay computers, Chapter 13, pp. 207-225, Future and Emerging Technologies, 2010.
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.
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.
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, Chapman & Hall/CRC Computer & Information Science Series, pp. 39: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, Chapman & Hall/CRC Computer & Information Science Series, pp. 38: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.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Competitive algorithms and lower bounds for on-line call control in cellular networks. Book on resource sharing methods and algorithms, Chapter 5, pp. 117-134, Information Society Technologies, 2005.

Conference Proceedings

S. Athanassopoulos, C. Kaklamanis, P. Katsikouli, and E. Papaioannou. How Greek the WEB is. In Proceedings of the 7th International Technology, Education and Development Conference (INTED 13), IATED (ISBN: 978-84-616-2661-8), pp. 6014-6023, 2013.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. Revenue guarantees in sponsored search auctions. In Proceedings of the 20th Annual European Symposium on Algorithms (ESA 12), LNCS 7501, Springer, pp. 253-264, 2012.
S. Athanassopoulos, C. Kaklamanis, G. Kalfountzos, and E. Papaioannou. Cellular automata for topology control in wireless sensor networks using Matlab. In Proceedings of the 7th FTRA International Conference on Future Information Technology (FutureTech 12), LNEE 164 (I), Springer, pp. 13-21, 2012.
S. Athanassopoulos, C. Kaklamanis, G. Kalfountzos, and E. Papaioannou. Cellular automata: simulations using Matlab. In Proceedings of the 6th International Conference on Digital Society (ICDS 12), IARIA, pp. 63-68, 2012.
S. Athanassopoulos, C. Kaklamanis, P. Katsikouli, and E. Papaioannou. Cellular Automata for Topology control in wireless sensor networks. In Proceedings of the 16th Mediterranean Electrotechnical Conference (Melecon 12), IEEE, pp. 212-215, 2012.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. On the efficiency of equilibria in generalized second price auctions. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC 11), pp. 81-90, 2011.
I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for greedy frugal coverage algorithms. In Proceedings of the 5th International Frontiers of Algorithmics Workshop (FAW 11) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM 11), LNCS 6681, Springer, pp. 185-195, 2011.
I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC 10), pp. 253-262, 2010.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, and E. Papaioannou. The impact of altruism on the efficiency of atomic congestion games. In Proceedings of the 5th Symposium on Trustworthy Global Computing (TGC 10), LNCS 6084, Springer, pp. 172-188, 2010.
S. Athanassopoulos, C. Kaklamanis, I. Laftsidis, and E. Papaioannou. An experimental study of greedy routing algorithms. In Proceedings of the 2010 International Conference on High Performance Computing & Simulation (HPCS 10), IEEE, pp. 150-156, 2010.
S. Athanassopoulos, C. Kaklamanis, E. Papaioannou, and C. Tsantilas. Experimental Comparison of Algorithms for Interference Control in Ad-Hoc Wireless Networks. In Proceedings of the 15th IEEE Mediterranean Electrotechnical Conference (Melecon 10), IEEE, pp. 1003 – 1008, 2010.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. In Proceedings of the 5th Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 475-482, 2009.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. On low-envy truthful allocations. In Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT 09), LNAI 5783, Springer, pp. 111-119, 2009.
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 5385, Springer, pp. 374-385, 2008.
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, and 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, and 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, and 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.
A. Svolos, C. Konstantopoulos and C. Kaklamanis. A hypercube parallel algorithm in texture analysis. In Proceedings of the IASTED International Conference on Signal and Image Processing (SIP 01), pp. 47-50, 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 01), 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 00), IEEE Computer Society Press, pp. 178-185, 2000.
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 00), 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 00), pp. 46-53, 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 00), 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.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. A Parallel Algorithm for Affine Based Motion Estimation. In Proceedings of 11th IASTED International Conference Parallel and Distributed Computing and Systems (PDCS 99), pp. 529-536, 1999.
A. I. Svolos, C. Konstantopoulos, and C. Kaklamanis. Efficient shape transformations on a massively parallel processor. In Proceedings of SPIE Non-Linear Image Processing X, Vol. 3646, pp. 296-304, 1999.
A. Bouganis, I. Caragiannis, and C. Kaklamanis. Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. In Proceedings of the 3rd Workshop on Algorithm Engineering (WAE 99), LNCS 1668, Springer, pp. 259-271, 1999.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. On-line Call Control in Cellular Networks. In Proceedings of the Workshop on Foundations of Mobile Computing (Sattelite workshop of FST&TCS 99), 1999.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor. In Proceedings of 4th International ACPC Conference, LNCS 1557, Springer, pp. 265-275, 1999.
C. Konstantopoulos, A. Svolos, and C. Kaklamanis. Efficient Parallel Algorithm for Hierarchical Block-Matching Motion Estimation. In Proceedings of SPIE Visual Communications and Image Processing ’99, pp. 481-490, 1999.
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. On the Complexity of Wavelength Converters. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS 98), LNCS 1450, Springer, pp. 771-779, 1998.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. In Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO 98), Carleton Scientific, pp. 10-19, 1998.
C. Kaklamanis, G. Persiano, T. Erlebach, and K. Jansen. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP 97), LNCS 1256, Springer, pp. 493-504, 1997.
D. I. Kaklamani, C. Kaklamanis, and A. Marsh. Exploiting the Parallelism in PMoM to Solve an Electrically Large Multi–Plate Conducting Structure. In Proceedings of the Progress in Electromagnetics Research Symposium (PIERS 97), p. 880, 1997.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies. In Proceedings of the 2nd Workshop on Optics & Computer Science (WOCS 97), part of IPPS 97, 1997.
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Bandwidth Allocation Algorithms for Tree-Shaped Optical Networks with Wavelength Converters, In Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO 97), Carleton Scientific, pp. 24-39, 1997.
C. Kaklamanis and G. Persiano. Efficient Wavelength Routing on Directed Fiber Trees. In Proceedings of the 4th European Symposium on Algorithms (ESA 96), LNCS 1136, Springer, pp. 460-470, 1996.
C. Kaklamanis and D. Krizanc. Multipacket Hot-Potato Routing on Processor Arrays. In Proceedings of EUROPAR 1996 Parallel Processing, LNCS 1123,Springer, pp. 270-277, 1996.
M. Mihail, C. Kaklamanis, and S. Rao. Efficient Access to Optical Bandwidth. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS 95), 1995.
C. Kaklamanis, D. Krizanc, and S. Rao. Hot-Potato Routing on Processor Arrays. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), pp. 273-282, 1993.
C. Kaklamanis, D. Krizanc, and S. Rao. New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), pp. 325-334, 1993.
C. Kaklamanis, D. Krizanc, and S. Rao. Universal Emulations with Sublogarithmic Slowdown. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS 93), pp. 341-350, 1993.
C. Kaklamanis and D. Krizanc. Optimal Sorting on Mesh-Connected Processor Arrays. In Proceedings. of the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA 92), pp. 50-59, 1992.
C. Kaklamanis, D. Krizanc, and S. Rao. Simple Path Selection for Optimal Routing on Processor Arrays. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA 92), pp. 23-30, 1992.
C. Kaklamanis and G. Persiano. Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. In Proceedings of 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 92), pp. 118-126, 1992.
C. Kaklamanis, D. Krizanc, L. Narayanan, and T. Tsantilas. Randomized Sorting and Selection on Mesh-Connected Processor Arrays. In Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA 91), pp. 17-28, 1991.
C. Kaklamanis, D. Krizanc, and A. Tsantilas. Tight Bounds for Oblivious Routing in the Hypercube. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 90), pp. 31-36, 1990.
C. Kaklamanis, A. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically Tight Bounds for Computing in Faulty Arrays of Processors. In Proceedings of the 31st IEEE Symp. on Foundations of Computer Science (FOCS 90), pp. 285-296, 1990.