Journal publications

  • I. Caragiannis, X. Chatzigeorgiou, P. Kanellopoulos, G. A. Krimpas, N. Protopapas, and A. A. Voudouris. Efficiency and complexity of price competition among single-product vendors. Artificial Intelligence, 248, pages 9-25, 2017.
  • I. Caragiannis, S. Nath, A. D. Procaccia, and N. Shah. Subset selection via implicit utilitarian voting. Journal of Artificial Intelligence Research, 58, pages 123-152, 2017.
  • F. Abed, I. Caragiannis, and A. A. Voudouris. Near-optimal asymmetric binary matrix partitions. Algorithmica, forthcoming.
  • I. Caragiannis, A. Fanelli, and N. Gravin. Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. Algorithmica, 77(4), pages 1143-1158, 2017.
  • I. Caragiannis and A. A. Voudouris. Welfare guarantees for proportional allocations. Theory of Computing Systems, 59 (4), pages 581–599, 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.
  • I. Caragiannis, A. D. Procaccia, and N. Shah. When do noisy votes reveal the truth? ACM Transactions on Economics and Computation, 4(3), art. 15, 2016.
  • C. Boutilier, I. Caragiannis, S. Haber, T. Lu, A. D. Procaccia, and O. Sheffet. Optimal social choice functions: a utilitarian view. Artificial Intelligence, 227, pages 190-213, 2015.
  • I. Caragiannis, A. Filos-Ratsikas, and Ariel D. Procaccia. An improved 2-agent kidney exchange mechanism. Theoretical Computer Science, 589, pages 53-60, 2015.
  • I. Caragiannis and C. Kalaitzis. Space lower bounds for low-stretch greedy embeddings. Theoretical Computer Science, 610, pages 149-157, 2016.
  • . Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. Revenue guarantees in the generalized second price auction. ACM Transactions on Internet Technology, 14(2-3), art. 17, 19 pages, 2015.
  • 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, pages 343-388, 2015. Full version: arXiv:1201.6429.
  • I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Transactions on Economics and Computation, 3(1), art. 2, 2015 (ACM EC '12 special issue).
  • J. Augustine, I. Caragiannis, A. Fanelli, and C. Kalaitzis. Enforcing efficient equilibria in network design games via subsidies. Algorithmica, 72(1), pages 44-82, 2015.
  • I. Caragiannis, M. Flammini, and L. Moscardelli. An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. IEEE/ACM Transactions on Networking, 21(4), pages 1322-1331, 2013.
  • V. Bilo, I. Caragiannis, A. Fanelli, and G. Monaco. Improved lower bounds on the price of stability of undirected network design games. Theory of Computing Systems, 52(4), pages 668-686, 2013.
  • I. Caragiannis. Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica, 66(3), pages 512-540, 2013.
  • I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for combinatorial frugal coverage algorithms. Journal of Combinatorial Optimization, 26(2), pages 292-309, 2013.
  • S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Energy-efficient communication in multi-interface wireless networks. Theory of Computing Systems, 52(2), pages 285-296, 2013.
  • I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, 10(2), art. 6, 2014.
  • I. Caragiannis and G. Monaco. A 6/5-approximation algorithm for the maximum 3-cover problem. Journal of Combinatorial Optimization, 25(1), pages 60-77, 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, pages 31-51, 2012.
  • I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. Theory of Computing Systems, 50(4), pages 589-610, 2012.
  • I. Caragiannis and A. D. Procaccia. Voting almost maximizes social welfare despite limited communication. Artificial Intelligence , 175(9-10), pages 1655-1671, 2011.
  • I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3), pages 606-637, 2011.
  • I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. ACM Transactions on Algorithms, 7(1), art. 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), pages 516-540, 2010.
  • I. Caragiannis. Wavelength management in WDM rings to maximize the number of connection. SIAM Journal on Discrete Mathematics, 23 (2), pages 959-978, 2009.
  • 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), pages 555-576, 2009.
  • I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. Theoretical Computer Science, 402 (2-3), pages 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), pages 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), pages 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), pages 119-136, 2006. (MFCS '04 special issue)
  • I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Energy-Efficient Wireless Network Design. Theory of Computing Systems, 39(5), pages 593-617, 2006.
  • I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 143(1-3), pages 54-61, 2004.
  • I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. A Logarithmic Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph Problem. Information Processing Letters, 86(3), pages 149-154, 2003.
  • V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. Theoretical Computer Science, 289(1), pages 355-399, 2002.
  • I. Caragiannis, C. Kaklamanis, E. Papaioannou. Efficient On-line Frequency Allocation and Call Control in Cellular Networks Theory of Computing Systems, 35(5), pages 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, 83(5), pages 275-280, 2002.
  • I. Caragiannis, C. Kaklamanis, P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. Theoretical Computer Science, 270(1-2), pages 361-399, 2002.
  • V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, P. Persiano. Sparse and Limited Wavelength Conversion in All-Optical Tree Networks. Theoretical Computer Science, 266(1-2), pages 887-934, 2001.
  • I. Caragiannis, C. Kaklamanis, P. Persiano. Wavelength Routing in All-Optical Tree Networks: A Survey. Computing and Informatics (formerly Computers and Artificial Intelligence), 20(2), pages 95-120, 2001.
  • I. Caragiannis, C. Kaklamanis, P. Persiano. Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, 10(4), pages 305-313, 2000.

Edited volumes

  • I. Caragiannis, M. Alexander, R. M. Badia, M. Cannataro, A. Costan, M. Danelutto, F. Desprez, B. Krammer, J. Sahuquillo, S. L. Scott, and J. Weidendorfer, editors. Euro-Par 2012: Parallel Processing Workshops, LNCS 7640, Springer, 2013.

Book chapters and surveys

  • I. Caragiannis, E. Hemaspaandra, and L. Hemaspaandra. Dodgson's and Young's rule. Chapter in Handbook of Computational Social Choice, F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia (eds.), 2016.
  • I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Computing approximate pure Nash equilibria in congestion games. SIGecom Exchangesi, 11(1): 26-29 , 2012.
  • 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, Springer, pages 241-263, 2009.
  • A. Navarra, I. Caragiannis, M. Flammini, C. Kaklamanis, and R. Klasing. Energy consumption minimization in ad hoc wireless, and multi-interface networks. Chapter in Graphs and Algorithms in Communication Networks, Springer, pages 335-355, 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, pages 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, pages 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, LNCS 3484, Springer, pages 74-96, 2006.
  • V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Efficient Wavelength Routing in Trees with Low-Degree Converters. Multichannel Optical Networks: Theory and Practice, DIMACS Series in Discrete Mathematics and Computer Science, American Mathematical Society, 46, pages 1-14, 1998.

Conference publications

  • I. Caragiannis, A. A. Voudouris, and P. Kanellopoulos. Bounding the inefficiency of compromise. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), 2017, forthcoming.
  • I. Caragiannis and E. Micha. Learning a ground truth ranking using noisy approval votes. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), 2017, forthcoming.
  • V. Bilo, I. Caragiannis, A. Fanelli, M. Flammini, and G. Monaco. Simple greedy algorithms for fundamental multidimensional graph problems. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, forthcoming.
  • V. Auletta, I. Caragiannis, C. Galdi, D. Ferraioli, and G. Persiano. Robustness in discrete preference games. In Proceedings of the 16th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2017, forthcoming.
  • I. Caragiannis, X. Chatzigeorgiou, G. A. Krimpas, and A. A. Voudouris. Optimizing positional scoring rules for rank aggregation. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI), pages 430-436, 2017.
  • A. Blum, I. Caragiannis, N. Haghtalab, A. D. Procaccia, E. B. Procaccia, and R. Vaish. Opting into optimal matchings. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2351-2363, 2017.
  • Ι. Caragiannis, A. Filos-Ratsikas, S. K. S. Frederiksen, K. A. Hansen, and Z. Tan. Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. In Proceedings of the 10th International Workshop on Internet and Network Economics (WINE), LNCS 10123, Springer, pages 236-250, 2016.
  • I. Caragiannis and A. Fanelli. An almost ideal coordination mechanism for unrelated machine scheduling. In Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT), LNCS 9928, Springer, pages 315-326, 2016.
  • Ι. Caragiannis, D. Kurokawa, H. Moulin, A. D. Procaccia, N. Shah, and J. Wang. The unreasonable fairness of the maximin Nash welfare. In Proceedings of the 17th ACM Conference of Electronic Commerce (EC), pages 305-322, 2016.
  • Ι. Caragiannis, G. A. Krimpas, and A. A. Voudouris. How effective can simple ordinal peer grading be? In Proceedings of the 17th ACM Conference of Electronic Commerce (EC), pages 323-340, 2016.
  • I. Caragiannis, A. D. Procaccia, and N. Shah. Truthful univariate estimators. In Proceedings of the 33rd International Conference on Machine Learning (ICML), pages 127–135, 2016.
  • I. Caragiannis, S. Nath, A. D. Procaccia, and N. Shah. Subset selection via implicit utilitarian voting. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 151–157, 2016.
  • V. Auletta, I. Caragiannis, C. Galdi, D. Ferraioli, and G. Persiano. Generalized discrete preference games. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 53–59, 2016.
  • I. Caragiannis, L. Gourves, and J. Monnot. Achieving proportional representation in conference programs. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 144–150, 2016.
  • I. Caragiannis, G. A. Krimpas, M. Panteli, and A. Voudouris. co-rank: an online tool for collectively deciding efficient rankings among peers. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pages 4351–4352, 2016.
  • S. Branzei, I. Caragiannis, D. Kurokawa, and A. D. Procaccia. An algorithmic framework for strategic fair division. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pages 418-424, 2016.
  • V. Auletta, I. Caragiannis, D. Ferraioli, C. Galdi, and G. Persiano. Minority becomes majority in social networks. In Proceedings of the 11th International Conference on Web and Internet Economics (WINE), LNCS 9470, Springer, pages 74-88, 2015.
  • F. Abed, I. Caragiannis, and A. A. Voudouris. Near-optimal asymmetric binary matrix partitions. In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS, Springer, pages 1-13, 2015. Full version: arXiv:1407.8170.
  • I. Caragiannis, X. Chatzigeorgiou, P. Kanellopoulos, G. A. Krimpas, N. Protopapas, and A. A. Voudouris. Efficiency and complexity of price competition among single-product vendors. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pages 25-33, 2015. Full version: arXiv:1502.03945.
  • I. Caragiannis, G. A. Krimpas, and A. A. Voudouris. Aggregating partial rankings with applications to peer grading in massive online open courses. In Proceedings of the 14th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 675-683, 2015. Full version: arXiv:1411.4619.
  • I. Caragiannis, A. Fanelli, and N. Gravin. Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), LNCS 8768, Springer, pages 49-60, 2014. Full version: arXiv:1402.3450.
  • I. Caragiannis and A. A. Voudouris. Welfare guarantees for proportional allocations. In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), LNCS 8768, Springer, pages 206-217, 2014. Full version: arXiv:1402.3447.
  • I. Caragiannis, D. Kurokawa, and A. D. Procaccia. Biased games. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 609-615, 2014.
  • I. Caragiannis, A. D. Procaccia, and N. Shah. Modal ranking: a uniquely robust voting rule. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 616-622, 2014.
  • 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), LNCS 8125, Springer, pages 277-288, 2013.
  • I. Caragiannis, A. D. Procaccia, and N. Shah. When do noisy votes reveal the truth? In Proceedings of the 14th ACM Conference on Electronic Commerce (EC), pages 143-160, 2013.
  • S. Brânzei, I. Caragiannis, J. Morgenstern, and A. D. Procaccia. How bad is selfish voting? In Proceedings of the 27th AAAI Conference of Artificial Intelligence (AAAI), pages 138-144, 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), LNCS 7501, Springer, pages 253-264, 2012.
  • J. Augustine, I. Caragiannis, A. Fanelli, and C. Kalaitzis. Enforcing efficient equilibria in network design games via subsidies. In Proceedings of the 24th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 277-286, 2012. Full version: arXiv:1104.4423v2.
  • I. Caragiannis and C. Kalaitzis. Space lower bounds for low-stretch greedy embeddings. In Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 7355, Springer, pages 1-12, 2012.
  • I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 284-301, 2012.
  • C. Boutilier, I. Caragiannis, S. Haber, T. Lu, A. D. Procaccia, and O. Sheffet. Optimal social choice functions: a utilitarian view. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 197-214, 2012.
  • I. Caragiannis, E. Elkind, M. Szegedy, and L. Yu. Mechanism design: from partial to probabilistic verification. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 266-283, 2012.
  • I. Caragiannis, A. Filos-Ratsikas, and A. D. Procaccia. An improved 2-agent kidney exchange mechanism. In Proceedings of the 7th Workshop on Internet and Network Economics (WINE), LNCS 7090, Springer, pages 37-48, 2011.
  • I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Efficient computation of approximate pure Nash equilibria in congestion games. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 532-541, 2011. Full version: arXiv:1104.2690.
  • I. Caragiannis, J. K. Lai, and A. D. Procaccia. Towards more expressive cake-cutting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 127-132, 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), pages 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) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM), LNCS 6681, Springer, pages 185-195, 2011.
  • V. Bilo, I. Caragiannis, A. Fanelli, and G. Monaco. Improved lower bounds on the price of stability of undirected network design games. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), LNCS 6386, Springer, pages 90-101, 2010.
  • I. Caragiannis, D. Kalaitzis, and E. Markakis. Approximation algorithms and mechanism design for minimax approval voting. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pages 737-742, 2010.
  • I. Caragiannis and A. D. Procaccia. Voting almost maximizes social welfare despite limited communication. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pages 743-748, 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), pages 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), LNCS 6094, Springer, pages 172-188, 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), LNCS 5929, Springer, pages 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), LNCS 5783, Springer, pages 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), LNCS 5734, Springer, pages 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), LNCS 5734, Springer, pages 102-111, 2009.
  • I. Caragiannis. Efficient coordination mechanisms for unrelated machine scheduling. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 815-824, 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 Procedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 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), LNCS 5385, Springer, pages 374-385, 2008.
  • I. Caragiannis and G. Monaco. A 6/5-approximation algorithm for the maximum 3-cover problem. In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 5162, Springer, pages 205-216, 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), pages 344-351, 2008.
  • I. Caragiannis. Better bounds for online load balancing on unrelated machines. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 972-981, 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), LNCS 4639, Springer, pages 52-63, 2007.
  • I. Caragiannis, M. Flammini, and L. Moscardelli. An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. In Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 4596, Springer, pages 447-458, 2007.
  • I. Caragiannis. Wavelength management in WDM rings to maximize the number of connections. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 4393, Springer, pages 61-72, 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), LNCS 4661, Springer, pages 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), LNCS 4168, Springer, pages 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), LNCS 4051, Springer, Part I, pages 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), LNCS 3827, Springer, pages 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), LNCS 3827, Springer, pages 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), LNCS 3669, Springer, pages 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, pages 1089-1099, 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), LNCS 3499, Springer, pages 78-88, 2005.
  • 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), LNCS 3153, Springer, pages 215-226, 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), LNCS 3158, Springer, pages 183-196, 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), LNCS 2996, Springer, pages 258-269, 2004.
  • 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), LNCS 2909, Springer, pages 252-255, 2003.
  • I. Caragiannis, C. Kaklamanis, G. 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), LNCS 2909, Springer, pages 81-94, 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), LNCS 2909, Springer, pages 67-80, 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), LNCS 2906, Springer, pages 585-594, 2003.
  • 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), LNCS 2518, Springer, pages 332-343, 2002.
  • 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), pages 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), LNCS 2076, Springer, pages 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), LNCS 2204, Springer, pages 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), pages 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), IEEE Computer Society Press, 2001.
  • I. Caragiannis, C. Kaklamanis, and I. Vergados. Greedy Dynamic Hot-Potato Routing on Arrays. In Proceedings of 2000 International Symposium on Parallel Algorithms and Networks (I-SPAN), IEEE Computer Society Press, pages 178-185, 2000.
  • V. Auletta, I. Caragiannis, C. Kaklamanis, and G. Persiano. Randomized Path Coloring on Binary Trees. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), LNCS 1913, Springer, pages 60-71, 2000.
  • C. Bartzis, I. Caragiannis, C. Kaklamanis, and I. Vergados. Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays. In Proceedings of EUROPAR 2000 Parallel Processing, LNCS 1900, Springer, pages 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), pages 46-53, 2000.
  • 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 Algorithmic Engineering (WAE), LNCS 1668, Springer, pages 259-271, 1999.
  • I. Caragiannis, C. Kaklamanis, and G. Persiano. Edge Coloring of Bipartite Graphs with Constraints. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 1672, Springer, pages 376-386, 1999.
  • V. Auletta, I. Caragiannis, C, Kaklamanis, and G. Persiano. On the Complexity of Wavelength Converters. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 1450, Springer, pages 771-779, 1998.
  • I. Caragiannis, C. Kaklamanis, and G. 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), pages 10-19, 1998.
  • V. Auletta, I. Caragiannis, C. Kaklamanis, and G. Persiano. Efficient Wavelength Routing in Trees with Low-Degree Converters. Multichannel Optical Networks: Theory and Practice, DIMACS Series in Discrete Mathematics and Computer Science, AMS, Vol. 46, pages 1-14, 1998.
  • I. Caragiannis, A. Katsoulis, P. Spirakis, and B. Tampakas. Indexing and Retrieval in Large Dynamic Document Collections. In Proceedings of the 6th Hellenic Conference on Informatics, pages 653-666, 1997.
  • V. Auletta, I. Caragiannis, C. Kaklamanis, and G. Persiano. Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. In Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 24-39, 1997.
  • V. Gerogiannis, I. Caragiannis, and M. Tsoukarellas. A General Framework for Applying Safety Analysis to Safety Critical Real-Time Applications Using Fault Trees. In Proceedings of the 9th EUROMICRO Workshop on Real Time Systems, IEEE Computer Society Press, pages 153-160, 1997.
  • I. Caragiannis, C. Kaklamanis, and G. Persiano. Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies. 2nd Workshop on Optics and Computer Science, part of IPPS 97, 1997.