Conference Proceedings

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

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

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

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

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

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

• 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 (Satellite workshop of FST&TCS 99), 1999.

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

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

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

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

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

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

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

• I. Caragiannis, C. Kaklamanis, and I. Vergados. Greedy Dynamic Hot-Potato Routing on Arrays. In Proceedings of the 2000 International Symposium on Parallel Algorithms and Networks (I-SPAN 00), IEEE Computer Society Press, pp. 178-185, 2000.

• 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 E. Papaioannou. Randomized Call Control in Sparse Wireless Cellular Networks. In Proceedings of the 8th International Conference on Advances in Communications and Control (COMCON 01), pp. 73-82, 2001.

• I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional Path Coloring with Applications to WDM Networks. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP 01), LNCS 2076, Springer, pp. 732-743, 2001.

• I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. In Proceedings of the 27th International Workshop on Graph-Theoretic Concepts of Computer Science (WG 01), LNCS 2204, Springer, pp. 21-31, 2001.

• I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies. In Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 01), pp. 77-88, 2001.

• I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Competitive Analysis of On-line Randomized Call Control in Cellular Networks. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 01), IEEE Computer Society Press, 2001.

• C. Kaklamanis. Recent Advances in Wavelength Routing. In Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 01), LNCS 2234, Springer, 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.

• I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC 02), LNCS 2518, Springer, pp. 332-343, 2002.

• A. Svolos, C. Konstantopoulos, and C. Kaklamanis. A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). In Proceedings of Euro-Par 2002, pp. 431-435, 2002.

• I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Power Consumption Problems in Ad Hoc Wireless Networks. In Proceedings 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 Proceedings 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 Proceedings 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 Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 03), LNCS 2906, Springer, pp. 585-594, 2003.

• I. Caragiannis, A. Fishkin, C. Kaklamanis, and E. Papaioannou. On-line Algorithms for Disk Graphs. In Proceedings 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 Proceedings 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 Proceedings of the 3rd International Conference for Ad Hoc Networks and Wireless (ADHOC-NOW 04), LNCS, Springer, pp. 183-196, 2004.

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

• C. Kaklamanis: Project AEOLUS: An Overview. In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), LNCS 4661, Springer, pp. 1-9, 2006.

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

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

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

• S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, 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, 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, pp. 111-119, 2009.

• I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. In Proceedings of the 5th International Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 475-482, 2009.

• 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, a nd 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), ΙΕΕΕ, pp. 1003-1008, 2010.

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

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

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

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

• 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, P. Katsikouli, and E. Papaioannou. How Greek the WEB is. In Proceedings of the 7th International Technology, Education and Development Conference (INTED 13), IATED, pp. 6014-6023, 2013.

• I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Limitations of deterministic auction design for correlated bidders. In Proceedings of the 21st Annual European Symposium on Algorithms (ESA 13), LNCS 8125, Springer, pp. 277-288, 2013.

• E. Megalou and C. Kaklamanis. PHOTODENTRO LOR, the Greek national learning object repository. In Proceedings of the 8th International Technology, Education and Development Conference (INTED 14), IATED, pp. 309-319, 2014.

• E. Megalou, A. Koutoumanos, Y. Tsilivigos, and C. Kaklamanis. Introducing "e-me", the Hellenic Digital Educational Platform for pupils and teachers. In Proceedings of the 7th International Conference on Education and New Learning Technologies (EDULEARN 15), IATED, pp. 4858-4868, 2015.

• E. Bagiakou, E. Papaioannou, S. Athanassopoulos, and C. Kaklamanis. OCTOPUS: Online collaborative toll-card-sharing public system. In Proceedings of the 3rd International Conference on Advances in Computing, Electronics and Communication (ACEC 15), IRED, pp. 171-174, 2015.

• E. Megalou and C. Kaklamanis. Interactive textbooks, the Photodentro repositories of learning resources, and the digital educational platform “e-me”. In Proceedings of the 8th PanHellenic Conference on ICT in Education, 2015 (in Greek).

• E. Megalou, V. Gkamas, S. Papadimitriou, M. Paraskevas, and C. Kaklamanis. Open educational practices: Motivating teachers to use and reuse open educational resources. In Proceedings of the END 2016 International Conference on Education and New Developments, pp. 42-46, 2016.

• C. Kaklamanis, P. Kanellopoulos, and S. Tsokana. On network formation games with heterogeneous players and basic network creation games. In Proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management (AAIM 16), LNCS 9778, Springer, pp. 125-136, 2016.

• V. Gkamas, A. Koutoumanos, K. Alexandris, E. Megalou, M. Paraskevas, and C. Kaklamanis. Integrating the Kaltura video platform with the Dspace-based Photodentro video repository: a case study. In Proceedings of the 19th IEEE International Conference on Computational Science and Engineering (CSE 16), to appear, 2016.

• C. Kaklamanis, P. Kanellopoulos, and K. Papaioannou. The price of stability of simple symmetric fractional hedonic games. In Proceedings of the 9th International Conference on Algorithmic Game Theory (SAGT 16), LNCS 9928, Springer, pp. 220-232, 2016.