Journals

• 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).

• 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 S. Rao. New Graph Decompositions with Applications to Emulations. Theory of Computing Systems, 30, pp. 39-49, 1997 (invited paper).

• 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.

• 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, M. Mihail, and P. Persiano. Optimal Wavelength Routing on Directed Fiber Trees. Theoretical Computer Science, 221(1-2), pp. 119-137, 1999, (invited paper).

• 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).

• 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. A Hypercube Algorithm for Sliding Window Compression. Parallel Processing Letters, 10(4), pp. 315-326, 2000.

• I. Caragiannis, C. Kaklamanis, and P. Persiano, Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, Vol. 10(4), pp. 305-314, 2000.

• 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. Reprint in Bulletin of the European Association for Theoretical Computer Science, Vol. 76, pp. 104-124, 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.

• V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, and P. Persiano. Sparse and Limited Wavelength Conversion in All-Optical Tree Networks. Theoretical Computer Science, Vol. 266 (1-2), pp. 887-934, 2001.

• 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.

• 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.

• 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.

• 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, Vol. 3(1-2), pp. 1-17, 2002.

• 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.

• I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, Vol. 143 (1-3), pp. 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, Vol. 19(1), pp. 33-50, 2004.

• C. Galdi, C. Kaklamanis, M. Montangero, and G. Persiano. Station Placement in Networks. Parallel Processing Letters, Vol. 15(1-2), pp. 117-130, 2005.

• 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.

• 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, Vol. 155 (2), pp. 119-136, 2007. (MFCS 04 special issue)

• I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. A tight bound for on-line coloring of disk graphs. Theoretical Computer Science, Vol. 384 (2-3), pp. 152-160, 2007. (SIROCCO 05 special issue)

• C. Konstantopoulos and C. Kaklamanis. Optimal hypercube simulation on the partitioned optical passive stars network. The Journal of Supercomputing, Vol. 42 (2), pp. 165-180, 2007.

• I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Competitive Algorithms and Lower Bounds for Online Randomized Call Control in Cellular Networks. Networks, Vol. 52 (4), pp. 235-251, 2008.

• 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)

• 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, 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.

• 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, 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, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. Theory of Computing Systems, 50(4), pp. 589-610, 2012.

• 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.

• 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, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for combinatorial frugal coverage algorithms. Journal of Combinatorial Optimization, 26 (2), pp. 292-309, 2013. (FAW-AAIM 2011 special issue)

• I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, 10 (2), Article 6, 2014.

• I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. Revenue guarantees in the generalized second price auction. ACM Transactions on Internet Technologies, 14 (2-3), Article 17, 2014.

• I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, B. Lucier, R. Paes Leme, and E. Tardos. Bounding the inefficiency of outcomes in generalized second price auctions. Journal of Economic Theory, 156, pp. 343-388, 2015 (invited paper).

• E. Bagiakou, E. Papaioannou, S. Athanassopoulos, and C. Kaklamanis. OCTOPUS: Online collaborative toll-card-sharing public system. International Journal of Advances in Computer Science & Its Applications, 6(1), pp. 85-88, 2016.

• I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Limitations of deterministic auction design for correlated bidders. ACM Transactions on Computation Theory, 8(4), Article 13, 2016.