Research Profile for Kaklamanis Christos


«Return to previous page
General
Foundations and Applications of Computer Science
Department of Computer Engineering and Informatics
Research Activity
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
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
Research Infrastructure
Ioannis Caragiannis, Dr, Lecturer
Evi Papaioannou, Dr
Panagiotis Kanellopoulos, Dr
Stavros Athanassopoulos, Dr
Nikos Karanikolas, MSc, PhD student
Maria Kyropoulou, MSc, PhD student
 
Research Activities
IST FET 2001-33135 CRESCCO "Critical resource sharing for cooperation in complex systems" (2001–2005)

IST FET IP-001907 DELIS "Dynamically Evolving Large Scale Information Systems" (2004–2008)

IST FET IP-015964 AEOLUS "Algorithmic principles for building efficient overlay computers" (2005–2010)

ICT-2008-215270 FRONTS "Foundations of adaptive networked societies of tiny artefacts" (2008–σήμερα)

ICT-2010-258307 EULER "Experimental UpdateLess Evolutive Routing" (2010-σήμερα)

COST Action 295 DYNAMO "Dynamic Communication Networks: Foundations and Algorithms" (2005–2009)

COST Action 293 GRAAL "Graphs and algorithms in communication networks" (2005–2008)

ΠΕΝΕΔ 2003 «Θεωρητική Ανάλυση και Πειραματική Μελέτη Αλγορίθμων για Ενεργειακά Αποδοτική Επικοινωνία σε Ασύρματα Δίκτυα Τύπου Ad Hoc» χρηματοδοτούμενο από τη ΓΓΕΤ (2005–σήμερα)

NoE-FP6 Project e-Photon/One+ "Optical Networks: Towards Bandwidth Manageability and Cost Efficiency" (Ιανουάριος 2006 – Φεβρουάριος 2008)

Improving RTN Project ARACNE "Approximation and Randomization Algorithms in Communication Networks" (Μάιος 2000 – Απρίλιος 2004), Επιστημονικός Υπεύθυνος

Improving RTN Project COMBSTRU "Combinatorial Structure of Intractable Problems" (Σεπτέμβριος 2002 – Αύγουστος 2006)

IST Project ALCOM-FT "Algorithms and Complexity – Future Technologies" (Μάρτιος 2000 – Νοέμβριος 2003)

«The Efficiency of Distributed Systems: Their Potential and Restrictions» στα πλαίσια του προγράμματος Ελληνοκυπριακής Συνεργασίας χρηματοδοτούμενο από ΓΓΕΤ και την Κυπριακή Κυβέρνηση (Ιανουάριος 2001 – Δεκέμβριος 2002)

«Αλγόριθμοι και Πρωτόκολλα για Οπτικά Δίκτυα Υψηλών Επιδόσεων» στα πλαίσια του Προγράμματος Ελληνογαλλικής Συνεργασίας ΠΛΑΤΩΝ, χρηματοδοτούμενο από την ΓΓΕΤ και τη Γαλλική Κυβέρνηση (Νοέμβριος 1997 – Φεβρουάριος 2000), Επιστημονικός Υπεύθυνος

«Εγκατάσταση και Λειτουργία Εργαστηρίου ΑΤΜ», χρηματοδοτούμενο από τον Τομέα Ερευνάς και Ανάπτυξης του ΟΤΕ (Οκτώβριος 1998 – Μάρτιος 2000), Επιστημονικός Υπεύθυνος

«Σχεδιασμός σε VLSI ενός Hypercube Παράλληλου Συσχετιστικού Επεξεργαστή» στα πλαίσια του προγράμματος ΠΕΝΕΔ 95, χρηματοδοτούμενο από την ΓΓΕΤ (Σεπτέμβριος 1996 – Αύγουστος 1998), Επιστημονικός Υπεύθυνος

ESPRIT LTR Project ALCOM-IT "Algorithms and Complexity in Information Technology" (Ιανουάριος 1996 – Ιούνιος 1999)

ESPRIT LTR Project ALCOM ΙΙ "Algorithms and Complexity ΙΙ" (1995)

ESPRIT LTR Project GEPPCOM "General Purpose Parallel Computing" (1994 – 1997)

DIMACS Program for "Massively Parallel Computation", (1992 – 1994)






Chapters in Books

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

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.

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, P. Persiano, Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, Vol. 10(4), pp. 305-314, 2000.
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.

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.

V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, 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, P. Persiano. Randomized Path Coloring on Binary Trees. Theoretical Computer Science, Vol. 289 (1), pp. 355-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.

I. Caragiannis, C. Kaklamanis, 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, 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, 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, G. Persiano. Station Placement in Networks. Parallel Processing Letters, Vol. 15(1-2), pp. 117-130, 2005.

I. Caragiannis, C. Kaklamanis, 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, 2006. (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, 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, to appear.

I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. ACM Transactions on Algorithms, to appear.

I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, to appear.

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, July 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, October 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, July 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, July 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, July 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, July 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, July 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, July 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, November 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), October 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, September 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, August 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, July 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, July 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, April 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, July 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, August 1998.

I. Caragiannis, C. Kaklamanis, 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, June 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, November 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, January 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, August 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. 258-270, July 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), December 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, December 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, February 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, January 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), May 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, July 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. 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, August 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, August 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 2000), LNCS 1913, Springer, pp. 60-71, September 2000.

I. Caragiannis, C. Kaklamanis, 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, 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, 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, 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, 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.
Christos 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), 2009, to appear.

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, 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 Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 475-482, 2009.

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, Springer, 2010, to appear.




Centre National de la Recherche Scientifique (CNRS)
Università degli Studi di Salerno
Institut National De Recherche en Informatique et en Automatique (INRIA)
Max-Planck Institut für Informatik
University of Paderborn
Università degli Studi di Padova
Eidgenössische Technische Hochschule Zürich
Universitat Politècnica de Catalunya
Università degli Studi di Roma "La Sapienza"
Katholieke Universiteit Leuven
Centre Universitaire d' Informatique
Christian-Albrechts-Universität zu Kiel
Università degli Studi di Roma "Tor Vergata"
DIMATIA, Charles University
University of Cyprus
University of Athens
University of Ioannina
Research Academic Computer Technology Institute
Wesleyan University
Columbia University
Ecole normale supérieure
Cybernetica
Telecom Italia Learning Services S.p.A.
Radiolabs
Additional Information