Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) - Christos Kaklamanis; Anna R. Karlin; Frank Thomson Leighton; Victor Milenkovic; Prabhakar Raghavan; Satish Rao; Clark D. Thomborson; A. Tsantilas (FOCS, 1990)

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). - Christos Kaklamanis; Danny Krizanc; Lata Narayanan; Thanasis Tsantilas (SPAA, 1991)

Tight Bounds for Oblivious Routing in the Hypercube. - Christos Kaklamanis; Danny Krizanc; Thanasis Tsantilas (Math. Syst. Theory, 1991)

Optimal Sorting on Mesh-Connected Processor Arrays. - Christos Kaklamanis; Danny Krizanc (SPAA, 1992)

Simple Path Selection for Optimal Routing on Processor Arrays. - Christos Kaklamanis; Danny Krizanc; Satish Rao (SPAA, 1992)

Universal Emulations with Sublogarithmic Slowdown - Christos Kaklamanis; Danny Krizanc; Satish Rao (FOCS, 1993)

New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. - Christos Kaklamanis; Danny Krizanc; Satish Rao (SPAA, 1993)

Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. - Christos Kaklamanis; Giuseppe Persiano (Math. Syst. Theory, 1994)

Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. - Milena Mihail; Christos Kaklamanis; Satish Rao (FOCS, 1995)

Efficient Wavelength Routing on Directed Fiber Trees. - Christos Kaklamanis; Giuseppe Persiano (ESA, 1996)

Multipacket Hot-Potato Routing on Processor Arrays. - Christos Kaklamanis; Danny Krizanc (Euro-Par, Vol. I, 1996)

An optimal greedy algorithm for wavelength allocation in directed tree networks. - Thomas Erlebach; Klaus Jansen; Christos Kaklamanis; Giuseppe Persiano (Network Design: Connectivity and Facilities Location, 1997)

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. - Christos Kaklamanis; Pino Persiano; Thomas Erlebach; Klaus Jansen (ICALP, 1997)

Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (SIROCCO, 1997)

New Graph Decompositions with Applications to Emulations. - Christos Kaklamanis; Danny Krizanc; Satish Rao (Theory Comput. Syst., 1997)

Efficient wavelength routing in trees with low-degree converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Multichannel Optical Networks: Theory and Practice, 1998)

On the Complexity of Wavelength Converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (MFCS, 1998)

Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (SIROCCO, 1998)

Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor. - Charalampos Konstantopoulos; Andreas Svolos; Christos Kaklamanis (ACPC, 1999)

Efficient shape transformations on a massively parallel processor. - Andreas I. Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (Electronic Imaging: Nonlinear Image Processing, 1999)

Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. - Athanasios Bouganis; Ioannis Caragiannis; Christos Kaklamanis (WAE, 1999)

Optimal Wavelength Routing on Directed Fiber Trees. - Thomas Erlebach; Klaus Jansen; Christos Kaklamanis; Milena Mihail; Pino Persiano (Theor. Comput. Sci., 1999)

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note). - Constantinos Bartzis; Ioannis Caragiannis; Christos Kaklamanis; Ioannis Vergados (Euro-Par, 2000)

Sliding-Window Compression on the Hypercube (Research Note). - Charalampos Konstantopoulos; Andreas Svolos; Christos Kaklamanis (Euro-Par, 2000)

Efficient Automatic Simulation of Parallel Computation on Network of Workstations. - Christos Kaklamanis; Danny Krizanc; Manuela Montangero; Pino Persiano (ICALP Satellite Workshops, 2000)

fficient Binary Morphological Algorithms on a Massively Parallel Processor. - Andreas Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (IPDPS, 2000)

Greedy Dynamic Hot-Potato Routing on Arrays. - Ioannis Caragiannis; Christos Kaklamanis; Ioannis Vergados (ISPAN, 2000)

Efficient on-line communication in cellular networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (SPAA, 2000)

An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems. - Charalampos Konstantopoulos; Andreas Svolos; Christos Kaklamanis (Concurr. Pract. Exp., 2000)

Symmetric Communication in All-Optical Tree Networks. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Parallel Process. Lett., 2000)

A Hypercube Algorithm for Sliding Window Compression. - Christos Kaklamanis; Charalampos Konstantopoulos; Andreas Svolos (Parallel Process. Lett., 2000)

Fractional Path Coloring with Applications to WDM Networks. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Hervé Rivano (ICALP, 2001)

Competitive Analysis of On-line Randomized Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (IPDPS, 2001)

Bandwidth allocation in WDM tree networks. - Christos Kaklamanis (IPDPS, 2001)

A hypercube parallel algorithm in texture analysis. - Andreas Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (SIP, 2001)

Recent Advances in Wavelength Routing. - Christos Kaklamanis (SOFSEM, 2001)

Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). - Clemente Galdi; Christos Kaklamanis; Manuela Montangero; Pino Persiano (STACS, 2001)

Wavelength Routing in All-optical Tree Networks: A Survey. - Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Comput. Artif. Intell., 2001)

Efficient primitive binary morphological algorithms on a massively parallel processor. - Andreas Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (J. Electronic Imaging, 2001)

Sparse and limited wavelength conversion in all-optical tree networks. - Vincenzo Auletta; Ioannis Caragiannis; Luisa Gargano; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2001)

A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). - Andreas Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (Euro-Par, 2002)

New Results for Energy-Efficient Broadcasting in Wireless Networks. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ISAAC, 2002)

New bounds on the size of the minimum feedback vertex set in meshes and butterflies. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Inf. Process. Lett., 2002)

Station Layouts in the Presence of Location Constraints. - Prosenjit Bose; Evangelos Kranakis; Christos Kaklamanis; Lefteris M. Kirousis; Danny Krizanc; David Peleg (J. Interconnect. Networks, 2002)

Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Theory Comput. Syst., 2002)

Randomized path coloring on binary trees. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2002)

Edge coloring of bipartite graphs with constraints. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2002)

Topic Introduction. - Christos Kaklamanis; Danny Krizanc; Pierre Fraigniaud; Michael Kaufmann 001 (Euro-Par, 2003)

Power Consumption Problems in Ad-Hoc Wireless Networks. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (WAOA, 2003)

Simple On-Line Algorithms for Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (WAOA, 2003)

Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano; Anastasios Sidiropoulos (WAOA, 2003)

A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Inf. Process. Lett., 2003)

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ADHOC-NOW, 2004)

Topic 13: Theory and Algorithms for Parallel Computation. - Christos Kaklamanis; Nancy M. Amato; Danny Krizanc; Andrea Pietracaprina (Euro-Par, 2004)

Online Algorithms for Disk Graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (MFCS, 2004)

Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. - Ioannis Caragiannis; Christos Kaklamanis (STACS, 2004)

Approximate constrained bipartite edge coloring. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Pino Persiano; Hervé Rivano (Discret. Appl. Math., 2004)

Efficient binary and grey level morphological operations on a massively parallel processor. - Andreas Svolos; Charalampos Konstantopoulos; Christos Kaklamanis (Parallel Algorithms Appl., 2004)

Geometric Clustering to Minimize the Sum of Cluster Sizes. - Vittorio Bilò; Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ESA, 2005)

New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Euro-Par, 2005)

Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks. - Christos Kaklamanis; Charalampos Konstantopoulos (Euro-Par, 2005)

Basic Computations in Wireless Networks. - Ioannis Caragiannis; Clemente Galdi; Christos Kaklamanis (ISAAC, 2005)

Network Load Games. - Ioannis Caragiannis; Clemente Galdi; Christos Kaklamanis (ISAAC, 2005)

A Tight Bound for Online Coloring of Disk Graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (SIROCCO, 2005)

Station Placement in Networks. - Clemente Galdi; Christos Kaklamanis; Manuela Montangero; Giuseppe Persiano (Parallel Process. Lett., 2005)

Project AEOLUS: An Overview. - Christos Kaklamanis (TGC, 2006)

Efficient automatic simulation of parallel computation on networks of workstations. - Christos Kaklamanis; Danny Krizanc; Manuela Montangero; Giuseppe Persiano (Discret. Appl. Math., 2006)

Energy-Efficient Wireless Network Design. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Theory Comput. Syst., 2006)

Approximation Algorithms for Path Coloring in Trees. - Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Efficient Approximation and Online Algorithms, 2006)

Topic 12 Theory and Algorithms for Parallel Computation. - Nir Shavit; Nicolas Schabanel; Pascal Felber; Christos Kaklamanis (Euro-Par, 2007)

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis (FCT, 2007)

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (Discret. Appl. Math., 2007)

A tight bound for online colouring of disk graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (Theor. Comput. Sci., 2007)

Optimal hypercube simulation on the partitioned optical passive stars network. - Charalampos Konstantopoulos; Christos Kaklamanis (J. Supercomput., 2007)

Minimum Energy Communication in Ad Hoc Wireless Networks. - Ioannis Caragiannis; Panagiotis Kanellopoulos; Christos Kaklamanis (Handbook of Parallel Computing, 2007)

Online Call Admission Control in Wireless Cellular Networks. - Ioannis Caragiannis; Evi Papaioannou; Christos Kaklamanis (Handbook of Parallel Computing, 2007)

Communication in wireless networks with directional antennas. - Ioannis Caragiannis; Christos Kaklamanis; Evangelos Kranakis; Danny Krizanc; Andreas Wiese (SPAA, 2008)

Improving the Efficiency of Load Balancing Games through Taxes. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (WINE, 2008)

Competitive algorithms and lower bounds for online randomized call control in cellular networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Networks, 2008)

Scheduling to maximize participation. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Evi Papaioannou (Theor. Comput. Sci., 2008)

Preface. - Christos Kaklamanis (Theor. Comput. Sci., 2008)

On Low-Envy Truthful Allocations. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ADT, 2009)

An Improved Approximation Bound for Spanning Star Forest and Color Saving. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (MFCS, 2009)

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis (Theory Comput. Syst., 2009)

WAOA 2006 Special Issue of TOCS. - Thomas Erlebach; Christos Kaklamanis (Theory Comput. Syst., 2009)

Directed Tree Networks. - Thomas Erlebach; Klaus Jansen; Christos Kaklamanis; Giuseppe Persiano (Encyclopedia of Optimization, 2009)

Game-Theoretic Approaches to Optimization Problems in Communication Networks. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Christos Kaklamanis; Gianpiero Monaco; Luca Moscardelli (Graphs and Algorithms in Communication Networks, 2010)

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. - Alfredo Navarra; Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Ralf Klasing (Graphs and Algorithms in Communication Networks, 2010)

An experimental study of greedy routing algorithms. - Stavros Athanassopoulos; Christos Kaklamanis; Ilias Laftsidis; Evi Papaioannou (HPCS, 2010)

The Impact of Altruism on the Efficiency of Atomic Congestion Games. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Evi Papaioannou (TGC, 2010)

Fractional Path Coloring in Bounded Degree Trees with Applications. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stéphane Pérennes; Hervé Rivano (Algorithmica, 2010)

Taxes for linear atomic congestion games. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ACM Trans. Algorithms, 2010)

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (FAW-AAIM, 2011)

On the efficiency of equilibria in generalized second price auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (EC, 2011)

Tight Bounds for Selfish and Greedy Load Balancing. - Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Panagiotis Kanellopoulos; Luca Moscardelli (Algorithmica, 2011)

Preface. - Christos Kaklamanis; Martin Skutella (Theor. Comput. Sci., 2011)

Revenue Guarantees in Sponsored Search Auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ESA, 2012)

On the approximability of Dodgson and Young elections. - Ioannis Caragiannis; Jason A. Covey; Michal Feldman; Christopher M. Homan; Christos Kaklamanis; Nikos Karanikolas; Ariel D. Procaccia; Jeffrey S. Rosenschein (Artif. Intell., 2012)

On the efficiency of equilibria in generalized second price auctions - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Brendan Lucier; Renato Paes Leme; Éva Tardos (CoRR, 2012)

The Efficiency of Fair Division. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (Theory Comput. Syst., 2012)

Tight approximation bounds for combinatorial frugal coverage algorithms. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (J. Comb. Optim., 2013)

Energy-Efficient Communication in Multi-interface Wireless Networks. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Theory Comput. Syst., 2013)

Socially desirable approximations for dodgson's voting rule. - Ioannis Caragiannis; Christos Kaklamanis; Nikos Karanikolas; Ariel D. Procaccia (ACM Trans. Algorithms, 2014)

Revenue Guarantees in the Generalized Second Price Auction. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ACM Trans. Internet Techn., 2014)

Bounding the inefficiency of outcomes in generalized second price auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Brendan Lucier; Renato Paes Leme; Éva Tardos (J. Econ. Theory, 2015)

Integrating the Kaltura Video Platform with the Photodentro Video Repository: A Case Study. - Vasileios Gkamas; A. Koutoumanos; K. Alexandris; Elina Megalou; Michael Paraskevas; Christos Kaklamanis (CSE/EUC/DCABES, 2016)

The Price of Stability of Simple Symmetric Fractional Hedonic Games. - Christos Kaklamanis; Panagiotis Kanellopoulos; Konstantinos Papaioannou 001 (SAGT, 2016)

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms. - Christos Kaklamanis; Kirk Pruhs (Theory Comput. Syst., 2016)

Limitations of Deterministic Auction Design for Correlated Bidders. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (ACM Trans. Comput. Theory, 2016)

On the Price of Stability of Social Distance Games. - Christos Kaklamanis; Panagiotis Kanellopoulos; Dimitris Patouchas (SAGT, 2018)

Multi-criteria Decision Making with Existential Rules Using Repair Techniques. - Nikos Karanikolas; Madalina Croitoru; Pierre Bisquert; Christos Kaklamanis; Rallou Thomopoulos; Bruno Yun (SGAI Conf., 2018)

ICALP 2019 - First Call for Papers. - Efstratios Gallopoulos; John D. Garofalakis; Christos Kaklamanis; Sotiris E. Nikoletseas; Christos D. Zaroliagis (Bull. EATCS, 2018)

A Decision Support Tool for Agricultural Applications Based on Computational Social Choice and Argumentation. - Nikos Karanikolas; Pierre Bisquert; Patrice Buche; Christos Kaklamanis; Rallou Thomopoulos (Int. J. Agric. Environ. Inf. Syst., 2018)

VSI: Edu*-2016 - Keeping up with technology: Teaching parallel, distributed and high-performance computing. - Sushil K. Prasad; Sheikh K. Ghafoor; Christos Kaklamanis; Ramachandran Vaidyanathan (J. Parallel Distributed Comput., 2018)

On network formation games with heterogeneous players and basic network creation games. - Christos Kaklamanis; Panagiotis Kanellopoulos; Sophia Tsokana (Theor. Comput. Sci., 2018)

A Voting Argumentation Framework: Considering the Reasoning behind Preferences. - Nikos Karanikolas; Pierre Bisquert; Christos Kaklamanis (ICAART (1), 2019)

A decision-making approach where argumentation added value tackles social choice deficiencies. - Pierre Bisquert; Madalina Croitoru; Christos Kaklamanis; Nikos Karanikolas (Prog. Artif. Intell., 2019)

An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm. - Nasia Zacharia; Evi Papaioannou; Christos Kaklamanis (Electron. J. Graph Theory Appl., 2020)

On the price of stability of some simple graph-based hedonic games. - Christos Kaklamanis; Panagiotis Kanellopoulos; Konstantinos Papaioannou 001; Dimitris Patouchas (Theor. Comput. Sci., 2021)

Evaluating approval-based multiwinner voting in terms of robustness to noise. - Ioannis Caragiannis; Christos Kaklamanis; Nikos Karanikolas; George A. Krimpas (Auton. Agents Multi Agent Syst., 2022)

"SHeMeD": An Application on Secure Computation of Medical Cloud Data Based on Homomorphic Encryption. - Hara Salaga; Nikos Karanikolas; Christos Kaklamanis (ICCSA (Workshops 6), 2023)