Publications


My complete list of publications follows with links to the full text. See also my entries at Google Scholar and DBLP.

Working papers

W4 Impartial selection with prior information.
Ioannis Caragiannis, George Christodoulou, and Nicos Protopapas.
Manuscript.
[ arXiv ]
W3 Simple posted pricing mechanisms for selling a divisible item.
Ioannis Caragiannis and Apostolis Kerentzis.
Manuscript.
[ arXiv ]
W2 Computing envy-freeable allocations with limited subsidies.
Ioannis Caragiannis and Stavros Ioannidis.
Manuscript.
[ arXiv ]
W1 Truthful ownership transfer with expert advice: Blending mechanism design with and without money.
Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, and Alexandros A. Voudouris.
Manuscript.
[ arXiv ]

2021 and forthcoming

J50 The efficiency of resource allocation mechanisms for budget-constrained users.
Ioannis Caragiannis and Alexandros A. Voudouris.
Mathematics of Operations Research, forthcoming.
[ mor paper | arXiv ]
J49 Stable fractional matchings.
Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, and Rohit Vaish.
Artificial Intelligence, 295: 103416, 2021
[ aij paper | arXiv ]
J48 On approximate pure Nash equilibria in weighted congestion games with polynomial latencies.
Ioannis Caragiannis and Angelo Fanelli.
Journal of Computer and System Sciences, , 117: 40-48, 2021
[ jcss paper | arXiv ]
C103 On interim envy-free allocation lotteries.
Ioannis Caragiannis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Proceedings of the 22nd ACM Conference on Economics and Computation (EC), 2021, forthcoming
[ ec paper coming soon | arXiv ]

2020

J47 How effective can simple ordinal peer grading be?
Ioannis Caragiannis, George A. Krimpas, and Alexandros A. Voudouris.
ACM Transactions on Economics and Computation, 8(3), 16:1-37, 2020
[ teac paper | arXiv ]
C102 Evaluating approval-based multiwinner voting in terms of robustness to noise.
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, and George A. Krimpas.
Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pages 74-80, 2020
[ ijcai paper ]

2019

J46 Optimizing positional scoring rules for rank aggregation.
Ιoannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas, and Alexandros A. Voudouris.
Artificial Intelligence, 267, pages 58-77, 2019.
[ aij paper ]
J45 The unreasonable fairness of the maximin Nash welfare.
Ιoannis Caragiannis, David Kurokawa, Herve Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang.
ACM Transactions on Economics and Computation, 7(6), article 12, 2019.
[ teac paper ]
J44 An almost ideal coordination mechanism for unrelated machine scheduling.
Ioannis Caragiannis and Angelo Fanelli.
Theory of Computing Systems, 63(1), pages 114-127, 2019.
[ tocs paper ]
C101 Impartial selection with additive approximation guarantees.
Ioannis Caragiannis, George Christodoulou, and Nicos Protopapas.
Proceedings of the 12th International Symposium on Algorithmic Game Theory (SAGT), LNCS 11801, Springer, pages 269-283, 2019
[ sagt paper ]
C100 A contribution to the critique of liquid democracy.
Ioannis Caragiannis and Evi Micha.
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 116-122, 2019
[ ijcai paper ]
C99 Fair allocation of combinations of indivisible goods and chores.
Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, and Toby Walsh.
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 53-59, 2019
[ ijcai paper | arXiv ]
C98 Portioning using ordinal preferences: fairness and efficiency.
Stephane Airiau, Haris Aziz, Ioannis Caragiannis, Justin Kruger, Dominik Peters, and Jerome Lang.
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 11-17, 2019
[ ijcai paper ]
C97 Deanonymization of social networks using structural information.
Ioannis Caragiannis and Evanthia Tsitsoka.
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pages 1213-1219, 2019
[ ijcai paper ]
C96 Stable fractional matchings.
Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, and Rohit Vaish.
Proceedings of the 20th ACM Conference on Economics and Computation (EC), pages 21-39, 2019
[ ec paper ]
C95 Envy-freeness up to any item with high Nash welfare: The virtue of donating items.
Ioannis Caragiannis, Nick Gravin, and Xin Huang.
Proceedings of the 20th ACM Conference on Economics and Computation (EC), pages 527-545, 2019
[ ec paper ]
C94 On approximate pure Nash equilibria in weighted congestion games with polynomial latencies.
Ioannis Caragiannis and Angelo Fanelli.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pages 133:1-12, 2019
[ icalp paper ]
C93 Almost envy-free allocations with connected bundles.
Vittorio Bilo, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William Zwicker.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS), pages 14:1-21, 2019
[ itcs paper ]
E2 Ioannis Caragiannis, Vahab S. Mirrokni, and Evdokia Nikolova, editors.
Proceedings of the 15th International Conference on Web and Internet Economics (WINE), LNCS 11920, Springer, 2019. [ proceedings ]

2018

J43 Near-optimal asymmetric binary matrix partitions.
Fida Abed, Ioannis Caragiannis, and Alexandros A. Voudouris.
Algorithmica, 80(1), pages 48-72, 2018.
[ algo paper ]
C92 The efficiency of resource allocation mechanisms for budget-constrained users.
Ioannis Caragiannis and Alexandros A. Voudouris.
Proceedings of the 19th ACM Conference on Economics and Computation (EC), pages 681–698, 2018
[ ec paper ]
C91 Knowledge, fairness, and social constraints.
Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, and Jerome Lang.
Proceedings of the 32nd Conference on Artificial Intelligence (AAAI)pages 4638–4645, 2018
[ aaai paper ]

2017

J42 Efficiency and complexity of price competition among single-product vendors.
Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos, George A. Krimpas, Nikos Protopapas, and Alexandros A. Voudouris.
Artificial Intelligence, volume 248, pages 9-25, 2017
[ aij paper ]
J41 Subset selection via implicit utilitarian voting.
Ioannis Caragiannis, Swaprava Nath, Ariel D. Procaccia, and Nisarg Shah.
Journal of Artificial Intelligence Research, volume 58, pages 123-152, 2017
[ jair paper ]
J40 Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games.
Ioannis Caragiannis, Angelo Fanelli, and Nick Gravin.
Algorithmica, volume 77(4), pages 1143-1158, 2017
[ algo paper ]
BC9 Recent advances in large-scale peer grading.
Ioannis Caragiannis.
Chapter in Trends in Computational Social Choice, U. Endriss (ed.), pages 327-344, AI Access, 2017.
[ chapter ]
C90 Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling.
Ioannis Caragiannis, Vasilis Gkatzelis, and Cosimo Vinci.
Proceedings of the 13th Conference on Web and Internet Economics (WINE), LNCS 10674, 2017
[ wine paper ]
C89 Information retention in heterogeneous majority dynamics.
Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Persiano.
Proceedings of the 13th Conference on Web and Internet Economics (WINE), LNCS 10674, 2017
[ wine paper ]
C88 Learning a ground truth ranking using noisy approval votes.
Ioannis Caragiannis and Evi Micha.
Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 149-155, 2017
[ ijcai paper ]
C87 Bounding the inefficiency of compromise.
Ioannis Caragiannis, Panagiotis Kanellopoulos, and Alexandros A. Voudouris.
Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 142-148, 2017
[ ijcai paper | arXiv ]
C86 Simple greedy algorithms for fundamental multidimensional graph problems.
Vittorio Bilo, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, and Gianpiero Monaco.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), pages 125:1--125:13, 2017
[ icalp paper ]
C85 Robustness in discrete preference games.
Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Persiano.
Proceedings of the 16th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1314-1322, 2017
[ aamas paper ]
C84 Optimizing positional scoring rules for rank aggregation.
Ioannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas, and Alexandros A. Voudouris.
Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI), pages 430-436, 2017
[ aaai paper | arXiv ]
C83 Opting into optimal matchings.
Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, and Rohit Vaish.
Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2351-2363, 2017
[ soda paper ]

2016

J39 Welfare guarantees for proportional allocations.
Ioannis Caragiannis, and Alexandros A. Voudouris.
Theory of Computing Systems, volume 59 (4), pages 581–599, 2016.
[ tocs paper ]
J38 Limitations of deterministic auction design for correlated bidders.
Ioannis Caragiannis, Christos Kaklamanis, and Maria Kyropoulou.
ACM Transactions on Computation Theory, volume 8(4), article 13, 2016.
[ toct paper ]
J37 When do noisy votes reveal the truth?
Ioannis Caragiannis, Ariel D. Procaccia, and Nisarg Shah.
ACM Transactions on Economics and Computation, volume 4(3), art. 15, 2016.
[ teac paper ]
BC8 Dodgson's and Young's rule.
Ioannis Caragiannis, Edith Hemaspaandra, and Lane A. Hemaspaandra.
Chapter in Handbook of Computational Social Choice, F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia (eds.), 2016.
[ chapter ]
C82 Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship.
Ioannis Caragiannis, Aris Filos-Ratsikas, Soren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, and Zihan Tan.
Proceedings of the 10th International Workshop on Internet and Network Economics (WINE), LNCS 10123, Springer, pages 236-250, 2016.
[ wine paper ]
C81 An almost ideal coordination mechanism for unrelated machine scheduling.
Ioannis Caragiannis, and Angelo Fanelli.
Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT), LNCS 9928, Springer, pages 315-326, 2016.
[ sagt paper ]
C80 The unreasonable fairness of the maximin Nash welfare.
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang.
Proceedings of the 17th ACM Conference on Economics and Computation (EC), pages 305-322, 2016.
[ ec paper ]
C79 How effective can simple ordinal peer grading be?
Ioannis Caragiannis, George A. Krimpas, and Alexandros A. Voudouris.
Proceedings of the 17th ACM Conference on Economics and Computation (EC), pages 323-340, 2016.
[ ec paper ]
C78 Truthful univariate estimators.
Ioannis Caragiannis, Ariel D. Procaccia, and Nisarg Shah.
Proceedings of the 33rd International Conference on Machine Learning (ICML), pages 127–135, 2016.
[ icml paper ]
C77 Subset Selection via Implicit Utilitarian Voting.
Ioannis Caragiannis, Swaprava Nath, Ariel D. Procaccia, and Nisarg Shah.
Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 151-157, 2016.
[ ijcai paper ]
C76 Generalized discrete preference games.
Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Persiano.
Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 53–59, 2016.
[ ijcai paper ]
C75 Achieving proportional representation in conference programs.
Ioannis Caragiannis, Laurent Gourvès, and Jérôme Monnot.
Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 144–150, 2016.
[ ijcai paper ]
C74 co-rank: an online tool for collectively deciding efficient rankings among peers.
Ioannis Caragiannis, George A. Krimpas, Marianna Panteli, and Alexandros A. Voudouris.
Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pages 4351–4352, 2016.
[ aaai paper ]
C73 An algorithmic framework for strategic fair division.
Simina Branzei, Ioannis Caragiannis, David Kurokawa, and Ariel D. Procaccia.
Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pages 418-424, 2016.
[ aaai paper ]

2015

J36 Space lower bounds for low-stretch greedy embeddings.
Ioannis Caragiannis, and Christos Kalaitzis.
Theoretical Computer Science, volume 610, pages 149-157, 2016.
[ tcs paper ]
J35 Optimal social choice functions: a utilitarian view.
Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, and Or Sheffet.
Artificial Intelligence, volume 227, pages 190-213, 2015.
[ aij paper ]
J34 An improved 2-agent kidney exchange mechanism.
Ioannis Caragiannis, Aris Filos-Ratsikas, and Ariel D. Procaccia.
Theoretical Computer Science, volume 589, pages 53-60, 2015.
[ tcs paper ]
J33 Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure.
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
ACM Transactions on Economics and Computation, volume 3(1), art. 2, 2015 (ACM EC '12 special issue).
[ teac paper ]
J32 Bounding the inefficiency of outcomes in generalized second price auctions.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, and Éva Tardos.
Journal of Economic Theory, volume 156, pages 343-388, 2015.
[ jet paper ]
J31 Enforcing efficient equilibria in network design games via subsidies.
John Augustine, Ioannis Caragiannis, Angelo Fanelli, and Christos Kalaitzis.
Algorithmica, volume 72(1), pages 44-82, 2015.
[ algo paper ]
C72 Minority becomes majority in social networks.
Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Persiano.
Proceedings of the 11th International Conference on Web and Internet Economics (WINE), LNCS 9470, Springer, pages 74-88, 2015.
[ wine paper ]
C71 Near-optimal asymmetric binary matrix partitions.
Fidaa Abed, Ioannis Caragiannis, and Alexandros A. Voudouris.
Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS, Springer, pages 1-13, 2015.
[ mfcs paper ]
C70 Efficiency and complexity of price competition among single-product vendors.
Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos, George A. Krimpas, Nikos Protopapas, and Alexandros A. Voudouris.
Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pages 25-33, 2015.
[ ijcai paper ]
C69 Aggregating partial rankings with applications to peer grading in massive online open courses.
Ioannis Caragiannis, George A. Krimpas, and Alexandros A. Voudouris.
Proceedings of the 14th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 675-683, 2015.
[ aamas paper | arXiv]

2014

J30 Revenue guarantees in the generalized second price auction.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
ACM Transactions on Internet Technology, volume 14(2-3), art. 17, 19 pages, 2014.
[ toit paper ]
J29 Socially desirable approximations for Dodgson's voting rule.
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, and Ariel D. Procaccia.
ACM Transactions on Algorithms, volume 10(2), art. 6, 2014.
[ talg paper ]
C68 Welfare guarantees for proportional allocations.
Ioannis Caragiannis, and Alexandros A. Voudouris.
Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), LNCS 8768, Springer, pages 206-217, 2014.
[ sagt paper | arXiv]
C67 Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games.
Ioannis Caragiannis, Angelo Fanelli, and Nick Gravin.
Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), LNCS 8768, Springer, pages 49-60, 2014.
[ sagt paper | arXiv]
C66 Modal ranking: a uniquely robust voting rule.
Ioannis Caragiannis, Ariel D. Procaccia, and Nisarg Shah.
Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI),pages 616-622, 2014.
[ aaai paper ]
C65 Biased games.
Ioannis Caragiannis, David Kurokawa, and Ariel D. Procaccia.
Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 609-615, 2014.
[ aaai paper ]

2013

J28 An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks.
Ioannis Caragiannis, Michele Flammini, and Luca Moscardelli.
IEEE/ACM Transactions on Networking, volume 21(4), pages 1322-1331, 2013.
[ ton paper ]
J27 Improved lower bounds on the price of stability of undirected network design games.
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, and Gianpiero Monaco.
Theory of Computing Systems, volume 52(4), pages 668-686, 2013.
[ tocs paper ]
J26 Efficient coordination mechanisms for unrelated machine scheduling.
Ioannis Caragiannis.
Algorithmica, volume 66(3), pages 512-540, 2013.
[ algo paper ]
J25 Tight approximation bounds for combinatorial frugal coverage algorithms.
Ioannis Caragiannis, Christos Kaklamanis, and Maria Kyropoulou.
Journal of Combinatorial Optimization, volume 26(2), pages 292-309, 2013.
[ jco paper ]
J24 Energy-efficient communication in multi-interface wireless networks.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Theory of Computing Systems, volume 52(2), pages 285-296, 2013.
[ tocs paper ]
J23 A 6/5-approximation algorithm for the maximum 3-cover problem.
Ioannis Caragiannis, and Gianpiero Monaco.
Journal of Combinatorial Optimization, volume 25(1), pages 60-77, 2013.
[ jco paper ]
C64 Limitations of deterministic auction design for correlated bidders.
Ioannis Caragiannis, Christos Kaklamanis, and Maria Kyropoulou.
Proceedings of the 21st Annual European Symposium on Algorithms (ESA), LNCS 8125, Springer, pages 277-288, 2013.
[ esa paper ]
C63 When do noisy votes reveal the truth?
Ioannis Caragiannis, Ariel D. Procaccia, and Nisarg Shah.
Proceedings of the 14th ACM Conference on Electronic Commerce (EC), pages 143-160, 2013
[ ec paper ]
C62 How bad is selfish voting?
Simina Brânzei, Ioannis Caragiannis, Jamie Morgenstern, and Ariel D. Procaccia.
Proceedings of the 27th AAAI Conference of Artificial Intelligence (AAAI), pages 138-144, 2013.
[ aaai paper ]
E1 Ioannis Caragiannis, Michael Alexander, Rosa M. Badia, Mario Cannataro, Alexandru Costan, Marco Danelutto, Frédéric Desprez, Bettina Krammer, Julio Sahuquillo, Stephen L. Scott, and Josef Weidendorfer, editors.
Proceedings of Euro-Par 2012 Parallel Processing Workshops, LNCS 7640, Springer, 2013.
[ proceedings ]

2012

J22 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, and Jeffrey S. Rosenschein.
Artificial Intelligence, volume 187-188, pages 31-51, 2012.
[ aij paper ]
J21 The efficiency of fair division.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Theory of Computing Systems, volume 50(4), pages 589-610, 2012.
[ tocs paper ]
BC7 Computing approximate pure Nash equilibria in congestion games.
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
SIGecom Exchanges., volume 11(1), pages 26-29, 2012.
[ survey paper ]
C61 Revenue guarantees in sponsored search auctions.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Proceedings of the 20th Annual European Symposium on Algorithms (ESA), LNCS 7501, Springer, pages 253-264, 2012.
[ esa paper ]
C60 Enforcing efficient equilibria in network design games via subsidies.
John Augustine, Ioannis Caragiannis, Angelo Fanelli, and Christos Kalaitzis.
Proceedings of the 24th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 277-286, 2012.
[ spaa paper | arxiv ]
C59 Space lower bounds for low-stretch greedy embeddings.
Ioannis Caragiannis, and Christos Kalaitzis.
Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 7355, Springer, pages 1-12, 2012.
[ sirocco paper]
C58 Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure.
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 284-301, 2012.
[ ec paper]
C57 Optimal social choice functions: a utilitarian view.
Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, and Or Sheffet.
Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 197-214, 2012.
[ ec paper]
C56 Mechanism design: from partial to probabilistic verification.
Ioannis Caragiannis, Edith Elkind, Mario Szegedy, and Lan Yu.
Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 266-283, 2012.
[ ec paper]

2011

J20 Tight bounds for selfish and greedy load balancing.
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, and Luca Moscardelli.
Algorithmica, volume 61(3), pages 606-637, 2011.
[ algo paper ]
J19 Voting almost maximizes social welfare despite limited communication.
Ioannis Caragiannis, and Ariel D. Procaccia.
Artificial Intelligence, volume 175(9-10), pages 1655-1671, 2011.
[ aij paper ]
C55 An improved 2-agent kidney exchange mechanism.
Ioannis Caragiannis, Aris Filos-Ratsikas, and Ariel D. Procaccia.
Proceedings of the 7th Workshop on Internet and Network Economics (WINE), LNCS 7090, Springer, pages 37-48, 2011.
[ wine paper]
C54 Efficient computation of approximate pure Nash equilibria in congestion games.
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 532-541, 2011.
[ focs paper | arXiv ]
C53 Towards more expressive cake-cutting.
Ioannis Caragiannis, John K. Lai, and Ariel D. Procaccia.
Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 127-132, 2011.
[ ijcai paper ]
C52 On the efficiency of equilibria in generalized second price auctions.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Proceedings of the 12th ACM Conference on Electronic Commerce (EC), pages 81-90, 2011.
[ ec paper ]
C51 Tight approximation bounds for greedy frugal coverage algorithms.
Ioannis Caragiannis, Christos Kaklamanis, and Maria Kyropoulou.
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.
[ aaim paper ]

2010

J18 Taxes for linear atomic congestion games.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
ACM Transactions on Algorithms, volume 7(1), art. 13, 2010.
[ talg paper ]
J17 Fractional path coloring in bounded degree trees with applications.
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, and Hervé Rivano.
Algorithmica, volume 58(2), pages 516-540, 2010
[ algo paper ]
C50 Improved lower bounds on the price of stability of undirected network design games.
Vittorio Bilo, Ioannis Caragiannis, Angelo Fanelli, and Gianpiero Monaco.
Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), LNCS 6386, Springer, pages 90-101, 2010.
[ sagt paper ]
C49 Voting almost maximizes social welfare despite limited communication.
Ioannis Caragiannis, and Ariel D. Procaccia.
Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pages 743-748, 2010.
[ aaai paper ]
C48 Approximation algorithms and mechanism design for minimax approval voting.
Ioannis Caragiannis, Dimitris Kalaitzis, and Evangelos Markakis.
Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pages 737-742, 2010.
[ aaai paper ]
C47 Socially desirable approximations for Dodgson's voting rule.
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, and Ariel D. Procaccia.
Proceedings of the 11th ACM Conference on Electronic Commerce (EC), pages 253-262, 2010.
[ ec paper ]
C46 The impact of altruism on the efficiency of atomic congestion games.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, and Evi Papaioannou.
Proceedings of the 5th Symposium on Trustworthy Global Computing (TGC), LNCS 6094, Springer, pages 172-188, 2010.
[ ec paper ]

2009

J16 Wavelength management in WDM rings to maximize the number of connection.
Ioannis Caragiannis.
SIAM Journal on Discrete Mathematics, 23 (2), pages 959-978, 2009.
[ jdm paper ]
J15 Analysis of approximation algorithms for k-set cover using factor-revealing linear programs.
Stavros Athanassopoulos, Christos Kaklamanis, and Ioannis Caragiannis.
Theory of Computing Systems, 45(3), pages 555-576, 2009.
[ tocs paper ]
BC6 Energy consumption minimization in ad hoc wireless, and multi-interface networks.
A. Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, and R. Klasing.
Chapter in Graphs and Algorithms in Communication Networks, Springer, pages 335-355, 2009.
[ chapter ]
BC5 Game-theoretic approaches to optimization problems in communication netwotks.
Vittorio Bilo, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, and Luca Moscardelli.
Chapter in Graphs and Algorithms in Communication Networks, Springer, pages 241-263, 2009.
[ chapter ]
C45 The efficiency of fair division.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Proceedings of the 5th Workshop on Internet and Network Economics (WINE), LNCS 5929, Springer, pages 475-482, 2009.
[ wine paper ]
C44 On low-envy truthful allocations.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou.
Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT), LNCS 5783, Springer, pages 111-119, 2009.
[ adt paper ]
C43 An improved approximation bound for spanning star forest and color saving.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Maria Kyropoulou.
Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 5734, Springer, pages 90-101, 2009.
[ mfcs paper ]
C42 Energy-efficient communication in multi-interface wireless networks.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 5734, Springer, pages 102-111, 2009.
[ mfcs paper ]
C41 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, and Jeffrey S. Rosenschein.
Procedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1058-1067, 2009.
[ soda paper ]
C40 Efficient coordination mechanisms for unrelated machine scheduling.
Ioannis Caragiannis.
Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 815-824, 2009.
[ soda paper ]

2008

J14 Scheduling to maximize participation.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Evi Papaioannou.
Theoretical Computer Science, volume 402 (2-3), pages 142-155, 2008. (TGC '06 special issue)
[ tcs paper ]
J13 Competitive Algorithms and Lower Bounds for Online Randomized Call Control in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Networks, 52(4), pages 235-251, 2008.
[ net paper ]
C39 Improving the efficiency of load balancing games through taxes.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 4th International Workshop on Internet and Network Economics (WINE), LNCS 5385, Springer, pages 374-385, 2008.
[ wine paper ]
C38 A 6/5-approximation algorithm for the maximum 3-cover problem.
Ioannis Caragiannis, and Gianpiero Monaco.
Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 5162, Springer, pages 205-216, 2008.
[ mfcs paper ]
C37 Communication in wireless networks with directional antennas.
Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese.
Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 344-351, 2008.
[ spaa paper ]
C36 Better bounds for online load balancing on unrelated machines.
Ioannis Caragiannis.
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 972-981, 2008.
[ soda paper ]

2007

J12 A tight bound for on-line coloring of disk graphs.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou.
Theoretical Computer Science, 384 (2-3), pages 152-160, 2007. (SIROCCO '05 special issue)
[ tcs paper ]
J11 Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou.
Discrete Applied Mathematics volume 155(2), pages 119-136 2007.
[ dam paper ]
BC4 Minimum energy Communication in ad hoc wireless networks: A survey.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapman & Hall/CRC Computer & Information Science Series, pages 39:1-20, 2007.
[ chapter ]
BC3 Online call admission control in wireless cellular networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapman & Hall/CRC Computer & Information Science Series, pages 38:1-20, 2007.
[ chapter ]
C35 Analysis of approximation algorithms for k-set cover using factor-revealing linear programs.
Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis.
Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT), LNCS 4639, Springer, pages 52-63, 2007.
[ fct paper ]
C34 An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks.
Ioannis Caragiannis, Michele Flammini, and Luca Moscardelli.
Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 4596, Springer, pages 447-458, 2007.
[ icalp paper ]
C33 Wavelength management in WDM rings to maximize the number of connections.
Ioannis Caragiannis.
Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 4393, Springer, pages 61-72, 2007.
[ stacs paper ]

2006

J10 Energy-Efficient Wireless Network Design.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Theory of Computing Systems, volume 39(5), pages 593-617, 2006.
[ tocs paper ]
BC2 Approximation Algorithms for Path Coloring in Trees.
Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Chapter in Efficient Approximation and Online Algorithms, LNCS 3484, Springer, pages 74-96, 2006.
[chapter]
C32 Scheduling to maximize participation.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Evi Papaioannou.
Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC), LNCS 4661, Springer, pages 218-232, 2006.
[ tgc paper ]
C31 Taxes for linear atomic congestion games.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 14th Annual European Symposium on Algorithms (ESA), LNCS 4168, Springer, pages 184-195, 2006.
[ esa paper ]
C30 Tight bounds for selfish and greedy load balancing.
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, and Luca Moscardelli.
Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 4051, Springer, Part I, pages 311-322, 2006.
[ icalp paper ]

2005

C29 Basic Computations in Wireless Networks.
Ioannis Caragiannis, Clemente Galdi, and Christos Kaklamanis.
Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 3827, Springer, pages 533-542, 2005.
[ isaac paper ]
C28 Network Load Games.
Ioannis Caragiannis, Clemente Galdi, and Christos Kaklamanis.
Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 3827, Springer, pages 809-818, 2005.
[ isaac paper ]
C27 Geometric Clustering to Minimize the Sum of Cluster Sizes.
Vittorio Bilo, Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 13th Annual European Symposium on Algorithms (ESA), LNCS 3669, Springer, pages 460-471, 2005.
[ esa paper ]
C26 New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of EUROPAR 2005 Parallel Processing, LNCS 3648, Springer, pages 1089-1099, 2005.
[ europar paper ]
C25 A Tight Bound for Online Coloring of Disk Graphs.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 3499, Springer, pages 78-88, 2005.
[ sirocco paper ]

2004

J9 Approximate Constrained Bipartite Edge Coloring.
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, and Hervé Rivano.
Discrete Applied Mathematics, volume 143(1-3), pages 54-61, 2004.
[ dam paper ]
C24 On-line Algorithms for Disk Graphs.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 3153, Springer, pages 215-226, 2004.
[ mfcs paper ]
C23 Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 3rd International Conference for Ad Hoc Networks and Wireless (ADHOC-NOW), LNCS 3158, Springer, pages 183-196, 2004.
[ adhoc paper ]
C22 Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.
Ioannis Caragiannis, and Christos Kaklamanis.
Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 2996, Springer, pages 258-269, 2004.
[ stacs paper ]

2003

J8 A Logarithmic Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph Problem.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Information Processing Letters, volume 86(3), pages 149-154, 2003.
[ ipl paper ]
C21 Power Consumption Problems in Ad Hoc Wireless Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA), LNCS 2909, Springer, pages 252-255, 2003.
[ waoa paper ]
C20 Simple On-line Algorithms for Call Control in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA), LNCS 2909, Springer, pages 67-80, 2003.
[ waoa paper ]
C19 Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, and Anastasios Sidiropoulos.
Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA), LNCS 2909, Springer, pages 81-94, 2003.
[ waoa paper ]
C18 Energy-Efficient Wireless Network Design.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 2906, Springer, pages 585-594, 2003.
[ isaac paper ]

2002

J7 Randomized Path Coloring on Binary Trees.
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Theoretical Computer Science, volume 289(1), pages 355-399, 2002.
[ tcs paper ]
J6 Efficient On-line Frequency Allocation and Call Control in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Theory of Computing Systems, volume 35(5), pages 521-543, 2002.
[ tocs paper ]
J5 New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Information Processing Letters, volume 83(5), pages 275-280, 2002.
[ ipl paper ]
J4 Edge Coloring of Bipartite Graphs with Constraints.
Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Theoretical Computer Science, volume 270(1-2), pages 361-399, 2002.
[ tcs paper ]
C17 New Results for Energy-Efficient Broadcasting in Wireless Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 2518, Springer, pages 332-343, 2002.
[ isaac paper ]

2001

J3 Wavelength Routing in All-Optical Tree Networks: A Survey Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Computing and Informatics (formerly Computers and Artificial Intelligence), volume 20(2), pages 95-120, 2001.
[ cai paper ]
J2 Sparse and limited wavelength conversion in all-optical tree networks. Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, and Pino Persiano.
Theoretical Computer Science, volume 266(1-2): 887-934 (2001).
[ tcs paper ]
C16 Randomized Call Control in Sparse Wireless Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 8th International Conference on Advances in Communications and Control (COMCON), pages 73-82, 2001.
[ comcon paper ]
C15 New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies.
Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos.
Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 77-88, 2001.
[ sirocco paper ]
C14 Approximate Constrained Bipartite Edge Coloring.
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, and Hervé Rivano.
roceedings of the 27th International Workshop on Graph-Theoretic Concepts of Computer Science (WG), LNCS 2204, Springer, pages 21-31, 2001.
[ wg paper ]
C13 Fractional Path Coloring with Applications to WDM Networks.
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, and Hervé Rivano.
Proceedings of the 28th International Colloquium on Automata, Languages,and Programming (ICALP), LNCS 2076, Springer, pages 732-743, 2001.
[ icalp paper ]
C12 Competitive Analysis of On-line Randomized Call Control in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society Press, 2001.
[ ipdps paper ]

2000

J1 Symmetric Communication in All-Optical Tree Networks. Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Parallel Processing Letters, volume 10(4), pages 305-313, 2000.
[ ppl paper ]
C11 Greedy Dynamic Hot-Potato Routing on Arrays.
Ioannis Caragiannis, Christos Kaklamanis, and Ioannis Vergados.
Proceedings of 2000 International Symposium on Parallel Algorithms and Networks (I-SPAN), IEEE Computer Society Press, pages 178-185, 2000.
[ ispan paper ]
C10 Randomized Path Coloring on Binary Trees.
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano.
Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), LNCS 1913, Springer, pages 60-71, 2000.
[ approx paper ]
C9 Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays.
Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, and Ioannis Vergados.
Proceedings of EUROPAR 2000 Parallel Processing, LNCS 1900, Springer, pages 877-881, 2000.
[ europar paper ]
C8 Efficient On-line Communication in Cellular Networks.
Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou.
Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 46-53, 2000.
[ spaa paper ]

1999

C7 Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.
Athanasios Bouganis, Ioannis Caragiannis, and Christos Kaklamanis.
Proceedings of the 3rd Workshop on Algorithmic Engineering (WAE), LNCS 1668, Springer, pages 259-271, 1999.
[ wae paper ]
C6 Edge Coloring of Bipartite Graphs with Constraints.
Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 1672, Springer, pages 376-386, 1999.
[ mfcs paper ]

1998

BC1 Efficient Wavelength Routing in Trees with Low-Degree Converters.
Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Multichannel Optical Networks: Theory and Practice, DIMACS Series in Discrete Mathematics and Computer Science, AMS, Vol. 46, pages 1-14, 1998.
[ chapter ]
C5 Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 10-19, 1998.
[ sirroco paper ]
C4 On the Complexity of Wavelength Converters.
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 1450, Springer, pages 771-779, 1998.
[ mfcs paper ]

1997

C3 A General Framework for Applying Safety Analysis to Safety Critical Real-Time Applications Using Fault Trees.
Vassilis C. Gerogiannis, Ioannis Caragiannis, Manthos A. Tsoukarellas.
Proceedings of the 9th EUROMICRO Workshop on Real Time Systems, IEEE Computer Society Press, pages 153-160, 1997.
[ rts paper ]
C2 Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 24-39, 1997.
[ sirocco paper ]
C1 Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies.
Ioannis Caragiannis, Christos Kaklamanis, and Giuseppe Persiano.
Proceedings of the 2nd Workshop on Optics and Computer Science, part of IPPS 97, 1997.
[ wocs paper ]