Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ioannis Caragiannis
2010 – today
- 2013
[j28]Ioannis Caragiannis: Efficient Coordination Mechanisms for Unrelated Machine Scheduling. Algorithmica 66(3): 512-540 (2013)- [j27]Ioannis Caragiannis, Gianpiero Monaco: A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25(1): 60-77 (2013)
- [j26]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Energy-Efficient Communication in Multi-interface Wireless Networks. Theory Comput. Syst. 52(2): 285-296 (2013)
- [j25]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52(4): 668-686 (2013)
- [c60]Ioannis Caragiannis, Ariel D. Procaccia, Nisarg Shah: When do noisy votes reveal the truth? ACM Conference on Electronic Commerce 2013: 143-160
- [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, Josef Weidendorfer (Eds.): Euro-Par 2012: Parallel Processing Workshops - BDMC, CGWS, HeteroPar, HiBB, OMHI, Paraphrase, PROPER, Resilience, UCHPC, VHPC, Rhodes Islands, Greece, August 27-31, 2012. Revised Selected Papers. Lecture Notes in Computer Science 7640, Springer 2013, ISBN 978-3-642-36948-3
- 2012
- [j24]Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the approximability of Dodgson and Young elections. Artif. Intell. 187: 31-51 (2012)
- [j23]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: The Efficiency of Fair Division. Theory Comput. Syst. 50(4): 589-610 (2012)
- [j22]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Computing approximate pure Nash equilibria in congestion games. SIGecom Exchanges 11(1): 26-29 (2012)
- [c59]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: Revenue Guarantees in Sponsored Search Auctions. ESA 2012: 253-264
- [c58]Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet: Optimal social choice functions: a utilitarian view. ACM Conference on Electronic Commerce 2012: 197-214
- [c57]Ioannis Caragiannis, Edith Elkind, Mario Szegedy, Lan Yu: Mechanism design: from partial to probabilistic verification. ACM Conference on Electronic Commerce 2012: 266-283
- [c56]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Conference on Electronic Commerce 2012: 284-301
- [c55]Ioannis Caragiannis, Christos Kalaitzis: Space Lower Bounds for Low-Stretch Greedy Embeddings. SIROCCO 2012: 1-12
- [c54]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis: Enforcing efficient equilibria in network design games via subsidies. SPAA 2012: 277-286
- [i5]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos: On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012)
- 2011
- [j21]Ioannis Caragiannis, Ariel D. Procaccia: Voting almost maximizes social welfare despite limited communication. Artif. Intell. 175(9-10): 1655-1671 (2011)
- [j20]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli: Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61(3): 606-637 (2011)
- [c53]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou: Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. FAW-AAIM 2011: 185-195
- [c52]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541
- [c51]Ioannis Caragiannis, John K. Lai, Ariel D. Procaccia: Towards More Expressive Cake Cutting. IJCAI 2011: 127-132
- [c50]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: On the efficiency of equilibria in generalized second price auctions. ACM Conference on Electronic Commerce 2011: 81-90
- [c49]Ioannis Caragiannis, Aris Filos-Ratsikas, Ariel D. Procaccia: An Improved 2-Agent Kidney Exchange Mechanism. WINE 2011: 37-48
- [i4]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Efficient computation of approximate pure Nash equilibria. CoRR abs/1104.2690 (2011)
- [i3]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis: Enforcing efficient equilibria in network design games via subsidies. CoRR abs/1104.4423 (2011)
- [i2]Ioannis Caragiannis: Efficient coordination mechanisms for unrelated machine scheduling. CoRR abs/1107.1814 (2011)
- [i1]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions. CoRR abs/1107.2248 (2011)
- 2010
- [j19]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano: Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58(2): 516-540 (2010)
- [j18]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Taxes for linear atomic congestion games. ACM Transactions on Algorithms 7(1): 13 (2010)
- [c48]Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos Markakis: Approximation Algorithms and Mechanism Design for Minimax Approval Voting. AAAI 2010
- [c47]Ioannis Caragiannis, Ariel D. Procaccia: Voting Almost Maximizes Social Welfare Despite Limited Communication. AAAI 2010
- [c46]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT 2010: 90-101
- [c45]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia: Socially desirable approximations for Dodgson's voting rule. ACM Conference on Electronic Commerce 2010: 253-262
- [c44]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Evi Papaioannou: The Impact of Altruism on the Efficiency of Atomic Congestion Games. TGC 2010: 172-188
2000 – 2009
- 2009
- [j17]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Theory Comput. Syst. 45(3): 555-576 (2009)
- [j16]Ioannis Caragiannis: Wavelength Management in WDM Rings to Maximize the Number of Connections. SIAM J. Discrete Math. 23(2): 959-978 (2009)
- [c43]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: On Low-Envy Truthful Allocations. ADT 2009: 111-119
- [c42]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou: An Improved Approximation Bound for Spanning Star Forest and Color Saving. MFCS 2009: 90-101
- [c41]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Energy-Efficient Communication in Multi-interface Wireless Networks. MFCS 2009: 102-111
- [c40]Ioannis Caragiannis: Efficient coordination mechanisms for unrelated machine scheduling. SODA 2009: 815-824
- [c39]Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the approximability of Dodgson and Young elections. SODA 2009: 1058-1067
- [c38]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou: The Efficiency of Fair Division. WINE 2009: 475-482
- 2008
- [j15]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Competitive algorithms and lower bounds for online randomized call control in cellular networks. Networks 52(4): 235-251 (2008)
- [j14]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou: Scheduling to maximize participation. Theor. Comput. Sci. 402(2-3): 142-155 (2008)
- [c37]Geppino Pucci, Coromoto León, Ioannis Caragiannis, Kieran T. Herley: Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2008: 876
- [c36]Ioannis Caragiannis, Gianpiero Monaco: A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. MFCS 2008: 205-216
- [c35]Ioannis Caragiannis: Better bounds for online load balancing on unrelated machines. SODA 2008: 972-981
- [c34]Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese: Communication in wireless networks with directional antennas. SPAA 2008: 344-351
- [c33]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Improving the Efficiency of Load Balancing Games through Taxes. WINE 2008: 374-385
- 2007
- [j13]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discrete Applied Mathematics 155(2): 119-136 (2007)
- [j12]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2-3): 152-160 (2007)
- [c32]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. FCT 2007: 52-63
- [c31]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli: An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ICALP 2007: 447-458
- [c30]Ioannis Caragiannis: Wavelength Management in WDM Rings to Maximize the Number of Connections. STACS 2007: 61-72
- 2006
- [j11]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Energy-Efficient Wireless Network Design. Theory Comput. Syst. 39(5): 593-617 (2006)
- [c29]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Taxes for Linear Atomic Congestion Games. ESA 2006: 184-195
- [c28]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli: Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322
- [c27]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou: Scheduling to Maximize Participation. TGC 2006: 218-232
- 2005
- [c26]Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Geometric Clustering to Minimize the Sum of Cluster Sizes. ESA 2005: 460-471
- [c25]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. Euro-Par 2005: 1089-1099
- [c24]Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis: Basic Computations in Wireless Networks. ISAAC 2005: 533-542
- [c23]
- [c22]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: A Tight Bound for Online Coloring of Disk Graphs. SIROCCO 2005: 78-88
- 2004
- [j10]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate constrained bipartite edge coloring. Discrete Applied Mathematics 143(1-3): 54-61 (2004)
- [c21]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. ADHOC-NOW 2004: 183-196
- [c20]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou: Online Algorithms for Disk Graphs. MFCS 2004: 215-226
- [c19]Ioannis Caragiannis, Christos Kaklamanis: Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. STACS 2004: 258-269
- 2003
- [j9]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. Inf. Process. Lett. 86(3): 149-154 (2003)
- [c18]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Energy-Efficient Wireless Network Design. ISAAC 2003: 585-594
- [c17]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Simple On-Line Algorithms for Call Control in Cellular Networks. WAOA 2003: 67-80
- [c16]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos: Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94
- [c15]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: Power Consumption Problems in Ad-Hoc Wireless Networks. WAOA 2003: 252-255
- 2002
- [j8]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano: Wavelength Routing in All-Optical Tree Networks: A Survey. Bulletin of the EATCS 76: 104-124 (2002)
- [j7]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New bounds on the size of the minimum feedback vertex set in meshes and butterflies. Inf. Process. Lett. 83(5): 275-280 (2002)
- [j6]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. Theory Comput. Syst. 35(5): 521-543 (2002)
- [j5]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Edge coloring of bipartite graphs with constraints. Theor. Comput. Sci. 270(1-2): 361-399 (2002)
- [j4]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Randomized path coloring on binary trees. Theor. Comput. Sci. 289(1): 355-399 (2002)
- [c14]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New Results for Energy-Efficient Broadcasting in Wireless Networks. ISAAC 2002: 332-343
- 2001
- [j3]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano: Wavelength Routing in All-optical Tree Networks: A Survey. Computers and Artificial Intelligence 20(2) (2001)
- [j2]Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano: Sparse and limited wavelength conversion in all-optical tree networks. Theor. Comput. Sci. 266(1-2): 887-934 (2001)
- [c13]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano: Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743
- [c12]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Competitive Analysis of On-line Randomized Call Control in Cellular Networks. IPDPS 2001: 14
- [c11]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos: New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. SIROCCO 2001: 77-88
- [c10]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31
- 2000
- [j1]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters 10(4): 305-314 (2000)
- [c9]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Randomized path coloring on binary trees. APPROX 2000: 60-71
- [c8]Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados: Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note). Euro-Par 2000: 877-881
- [c7]Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados: Greedy Dynamic Hot-Potato Routing on Arrays. ISPAN 2000: 178-185
- [c6]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou: Efficient on-line communication in cellular networks. SPAA 2000: 46-53
1990 – 1999
- 1999
- [c5]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Edge Coloring of Bipartite Graphs with Constraints. MFCS 1999: 376-386
- [c4]Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis: Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. Algorithm Engineering 1999: 259-271
- 1998
- [c3]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: On the Complexity of Wavelength Converters. MFCS 1998: 771-779
- [c2]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. SIROCCO 1998: 10-19
- 1997
- [c1]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. SIROCCO 1997: 24-39
Coauthor Index
[j26] [j24] [j23] [c59] [i5] [j20] [c53] [c50] [j19] [j18] [c45] [c44] [j17] [c43] [c42] [c41] [c39] [c38] [j15] [j14] [c34] [c33] [j13] [j12] [c32] [j11] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [j10] [c21] [c20] [c19] [j9] [c18] [c17] [c16] [c15] [j8] [j7] [j6] [j5] [j4] [c14] [j3] [j2] [c13] [c12] [c11] [c10] [j1] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:57 CEST by the dblp team