default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIoannis Caragiannis
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i53]Ioannis Caragiannis, Kasper Green Larsen, Sudarshan Shyam:
A new lower bound for multi-color discrepancy with applications to fair division. CoRR abs/2502.10516 (2025)- [i52]Ioannis Caragiannis, Georgios Kalantzis:
Mechanisms for Selling an Item Among a Strategic Bidder and a Profiled Agent. CoRR abs/2502.12313 (2025) - [i51]Ioannis Caragiannis, Sanjukta Roy:
Quantile agent utility and implications to randomized social choice. CoRR abs/2502.13772 (2025) - 2024
- [j64]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas
:
Truthful aggregation of budget proposals with proportionality guarantees. Artif. Intell. 335: 104178 (2024) - [j63]Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, Alexandros A. Voudouris:
Truthful ownership transfer with expert advice. Math. Program. 203(1): 871-900 (2024) - [j62]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. Math. Program. 203(1): 901-930 (2024) - [j61]Ioannis Caragiannis, Nidhi Rathi:
Optimizing Over Serial Dictatorships. Theory Comput. Syst. 68(5): 1180-1206 (2024) - [j60]Ioannis Caragiannis, Shivika Narang:
Repeatedly matching items to agents fairly and efficiently. Theor. Comput. Sci. 981: 114246 (2024) - [c124]Jakob Burkhardt, Ioannis Caragiannis, Karl Fehrs, Matteo Russo, Chris Schwiegelshohn, Sudarshan Shyam:
Low-Distortion Clustering with Ordinal and Limited Cardinal Information. AAAI 2024: 9555-9563 - [c123]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi:
On the Complexity of Pareto-Optimal and Envy-Free Lotteries. AAMAS 2024: 244-252 - [c122]Ioannis Caragiannis, Evi Micha, Jannik Peters:
Can a Few Decide for Many? The Metric Distortion of Sortition. ICML 2024 - [c121]Ioannis Caragiannis, Georgios Kalantzis:
Randomized Learning-Augmented Auctions with Revenue Guarantees. IJCAI 2024: 2687-2694 - [c120]Ioannis Caragiannis, Evi Micha, Nisarg Shah:
Proportional Fairness in Non-Centroid Clustering. NeurIPS 2024 - [c119]Ioannis Caragiannis, Sebastian Homrighausen:
Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. SAGT 2024: 184-201 - [i50]Ioannis Caragiannis, Georgios Kalantzis:
Randomized learning-augmented auctions with revenue guarantees. CoRR abs/2401.13384 (2024) - [i49]Jakob Burkhardt, Ioannis Caragiannis, Karl Fehrs, Matteo Russo, Chris Schwiegelshohn, Sudarshan Shyam:
Low-Distortion Clustering with Ordinal and Limited Cardinal Information. CoRR abs/2402.04035 (2024) - [i48]Ioannis Caragiannis, Rob LeGrand, Evangelos Markakis, Emmanouil Pountourakis:
An impossibility result for strongly group-strategyproof multi-winner approval-based voting. CoRR abs/2402.08746 (2024) - [i47]Ioannis Caragiannis, Sebastian Homrighausen:
Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. CoRR abs/2405.14316 (2024) - [i46]Ioannis Caragiannis, Evi Micha, Jannik Peters:
Can a Few Decide for Many? The Metric Distortion of Sortition. CoRR abs/2406.02400 (2024) - [i45]Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi:
Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity. CoRR abs/2407.04474 (2024) - [i44]Ioannis Caragiannis, Evi Micha, Nisarg Shah:
Proportional Fairness in Non-Centroid Clustering. CoRR abs/2410.23273 (2024) - [i43]Ioannis Caragiannis, Nick Gravin, Zhile Jiang:
On the satisfiability of random 3-SAT formulas with k-wise independent clauses. CoRR abs/2411.03813 (2024) - 2023
- [j59]Stéphane Airiau, Haris Aziz, Ioannis Caragiannis, Justin Kruger, Jérôme Lang, Dominik Peters:
Portioning using ordinal preferences: Fairness and efficiency. Artif. Intell. 314: 103809 (2023) - [c118]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. AAMAS 2023: 2670-2672 - [c117]Christos Bouras, Ioannis Caragiannis, Apostolos Gkamas, Nicos Protopapas, Tasos Sardelis, Kyriakos N. Sgarbas:
State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks. ICOIN 2023: 632-637 - [c116]Ioannis Caragiannis, Nikolaj I. Schwartzbach:
Outsourcing Adjudication to Strategic Jurors. IJCAI 2023: 2546-2553 - [c115]Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio:
New Fairness Concepts for Allocating Indivisible Items. IJCAI 2023: 2554-2562 - [c114]Ioannis Caragiannis, Nidhi Rathi:
Optimizing over Serial Dictatorships. SAGT 2023: 329-346 - [c113]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. SAGT 2023: 347-364 - [c112]Ioannis Caragiannis, Zhile Jiang:
Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming. STOC 2023: 710-722 - [c111]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Prior Information. WWW 2023: 3614-3624 - [i42]Ioannis Caragiannis, Karl Fehrs:
Beyond the worst case: Distortion in impartial culture electorate. CoRR abs/2307.07350 (2023) - [i41]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi:
On the complexity of Pareto-optimal and envy-free lotteries. CoRR abs/2307.12605 (2023) - 2022
- [j58]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating approval-based multiwinner voting in terms of robustness to noise. Auton. Agents Multi Agent Syst. 36(1): 1 (2022) - [j57]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh:
Fair allocation of indivisible goods and chores. Auton. Agents Multi Agent Syst. 36(1): 3 (2022) - [j56]Ioannis Caragiannis, Nisarg Shah, Alexandros A. Voudouris:
The metric distortion of multiwinner voting. Artif. Intell. 313: 103802 (2022) - [j55]Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Bounding the Inefficiency of Compromise in Opinion Formation. Algorithmica 84(1): 234-271 (2022) - [j54]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131: 197-221 (2022) - [j53]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. Theory Comput. Syst. 66(3): 721-742 (2022) - [c110]Ioannis Caragiannis, Nisarg Shah, Alexandros A. Voudouris:
The Metric Distortion of Multiwinner Voting. AAAI 2022: 4900-4907 - [c109]Ioannis Caragiannis, Evi Micha, Nisarg Shah:
A Little Charity Guarantees Fair Connected Graph Partitioning. AAAI 2022: 4908-4916 - [c108]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Truthful Aggregation of Budget Proposals with Proportionality Guarantees. AAAI 2022: 4917-4924 - [c107]Ioannis Caragiannis, Karl Fehrs:
The Complexity of Learning Approval-Based Multiwinner Voting Rules. AAAI 2022: 4925-4932 - [c106]Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas, Daniel Schoepflin:
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. AAMAS 2022: 208-216 - [i40]Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas, Daniel Schoepflin:
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. CoRR abs/2201.04662 (2022) - [i39]Ioannis Caragiannis, Nikolaj I. Schwartzbach:
Adjudication with Rational Jurors. CoRR abs/2201.06597 (2022) - [i38]Ioannis Caragiannis, Nisarg Shah, Alexandros A. Voudouris:
The Metric Distortion of Multiwinner Voting. CoRR abs/2201.13332 (2022) - [i37]Ioannis Caragiannis, Nidhi Rathi:
Optimizing over Serial Dictatorships. CoRR abs/2202.08097 (2022) - [i36]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Truthful Aggregation of Budget Proposals with Proportionality Guarantees. CoRR abs/2203.09971 (2022) - [i35]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. CoRR abs/2207.01589 (2022) - [i34]Ioannis Caragiannis, Zhile Jiang:
Computing better approximate pure Nash equilibria in cut games via semidefinite programming. CoRR abs/2211.04117 (2022) - 2021
- [j52]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable fractional matchings. Artif. Intell. 295: 103416 (2021) - [j51]Ioannis Caragiannis, Angelo Fanelli:
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. J. Comput. Syst. Sci. 117: 40-48 (2021) - [j50]Ioannis Caragiannis, Alexandros A. Voudouris:
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users. Math. Oper. Res. 46(2): 503-523 (2021) - [c105]Ioannis Caragiannis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Interim Envy-Free Allocation Lotteries. EC 2021: 264-284 - [c104]Ioannis Caragiannis, Nick Gravin, Pinyan Lu, Zihe Wang:
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. WINE 2021: 131-148 - [c103]Ioannis Caragiannis, Stavros Ioannidis:
Computing Envy-Freeable Allocations with Limited Subsidies. WINE 2021: 522-539 - [e3]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen:
Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings. Lecture Notes in Computer Science 12885, Springer 2021, ISBN 978-3-030-85946-6 [contents] - [i33]Ioannis Caragiannis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Interim Envy-Free Allocation Lotteries. CoRR abs/2102.07839 (2021) - [i32]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial selection with prior information. CoRR abs/2102.09002 (2021) - [i31]Ioannis Caragiannis, Karl Fehrs:
The Complexity of Learning Approval-Based Multiwinner Voting Rules. CoRR abs/2110.00254 (2021) - 2020
- [j49]Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris:
How Effective Can Simple Ordinal Peer Grading Be? ACM Trans. Economics and Comput. 8(3): 16:1-16:37 (2020) - [c102]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise. IJCAI 2020: 74-80 - [i30]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating approval-based multiwinner voting in terms of robustness to noise. CoRR abs/2002.01776 (2020) - [i29]Ioannis Caragiannis, Stavros Ioannidis:
Computing envy-freeable allocations with limited subsidies. CoRR abs/2002.02789 (2020) - [i28]Ioannis Caragiannis, Apostolis Kerentzis:
Simple posted pricing mechanisms for selling a divisible item. CoRR abs/2007.08246 (2020)
2010 – 2019
- 2019
- [j48]Ioannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas, Alexandros A. Voudouris:
Optimizing positional scoring rules for rank aggregation. Artif. Intell. 267: 58-77 (2019) - [j47]Ioannis Caragiannis, Angelo Fanelli:
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. Theory Comput. Syst. 63(1): 114-127 (2019) - [j46]Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang:
The Unreasonable Fairness of Maximum Nash Welfare. ACM Trans. Economics and Comput. 7(3): 12:1-12:32 (2019) - [c101]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable Fractional Matchings. EC 2019: 21-39 - [c100]Ioannis Caragiannis, Nick Gravin, Xin Huang:
Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items. EC 2019: 527-545 - [c99]Ioannis Caragiannis, Angelo Fanelli:
On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies. ICALP 2019: 133:1-133:12 - [c98]Stéphane Airiau, Haris Aziz, Ioannis Caragiannis, Justin Kruger, Jérôme Lang, Dominik Peters:
Portioning Using Ordinal Preferences: Fairness and Efficiency. IJCAI 2019: 11-17 - [c97]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh:
Fair Allocation of Indivisible Goods and Chores. IJCAI 2019: 53-59 - [c96]Ioannis Caragiannis, Evi Micha:
A Contribution to the Critique of Liquid Democracy. IJCAI 2019: 116-122 - [c95]Ioannis Caragiannis, Evanthia Tsitsoka:
Deanonymizing Social Networks Using Structural Information. IJCAI 2019: 1213-1219 - [c94]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - [c93]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. SAGT 2019: 269-283 - [e2]Ioannis Caragiannis, Vahab S. Mirrokni, Evdokia Nikolova:
Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10-12, 2019, Proceedings. Lecture Notes in Computer Science 11920, Springer 2019, ISBN 978-3-030-35388-9 [contents] - [i27]Ioannis Caragiannis, Nick Gravin, Xin Huang:
Envy-freeness up to any item with high Nash welfare: The virtue of donating items. CoRR abs/1902.04319 (2019) - [i26]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable fractional matchings. CoRR abs/1902.06698 (2019) - [i25]Ioannis Caragiannis, Angelo Fanelli:
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. CoRR abs/1902.07173 (2019) - [i24]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. CoRR abs/1910.00135 (2019) - 2018
- [j45]Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris:
Near-Optimal Asymmetric Binary Matrix Partitions. Algorithmica 80(1): 48-72 (2018) - [c92]Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, Jérôme Lang:
Knowledge, Fairness, and Social Constraints. AAAI 2018: 4638-4645 - [c91]Ioannis Caragiannis, Alexandros A. Voudouris:
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users. EC 2018: 681-698 - [i23]Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, Alexandros A. Voudouris:
Truthful mechanisms for ownership transfer with expert advice. CoRR abs/1802.01308 (2018) - [i22]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi:
Fair allocation of combinations of indivisible goods and chores. CoRR abs/1807.10684 (2018) - [i21]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. CoRR abs/1808.09406 (2018) - 2017
- [j44]Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos, George A. Krimpas, Nikos Protopapas, Alexandros A. Voudouris:
Efficiency and complexity of price competition among single-product vendors. Artif. Intell. 248: 9-25 (2017) - [j43]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica 77(4): 1143-1158 (2017) - [j42]Ioannis Caragiannis, Swaprava Nath, Ariel D. Procaccia, Nisarg Shah:
Subset Selection Via Implicit Utilitarian Voting. J. Artif. Intell. Res. 58: 123-152 (2017) - [c90]Ioannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas, Alexandros A. Voudouris:
Optimizing Positional Scoring Rules for Rank Aggregation. AAAI 2017: 430-436 - [c89]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Robustness in Discrete Preference Games. AAMAS 2017: 1314-1322 - [c88]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco:
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP 2017: 125:1-125:13 - [c87]Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Bounding the Inefficiency of Compromise. IJCAI 2017: 142-148 - [c86]Ioannis Caragiannis, Evi Micha:
Learning a Ground Truth Ranking Using Noisy Approval Votes. IJCAI 2017: 149-155 - [c85]Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish:
Opting Into Optimal Matchings. SODA 2017: 2351-2363 - [c84]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Information Retention in Heterogeneous Majority Dynamics. WINE 2017: 30-43 - [c83]Ioannis Caragiannis, Vasilis Gkatzelis, Cosimo Vinci:
Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling. WINE 2017: 74-87 - [i20]Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Bounding the inefficiency of compromise. CoRR abs/1702.07309 (2017) - [i19]Ioannis Caragiannis, Alexandros A. Voudouris:
The efficiency of resource allocation mechanisms for budget-constrained users. CoRR abs/1707.03551 (2017) - 2016
- [j41]Ioannis Caragiannis, Alexandros A. Voudouris:
Welfare Guarantees for Proportional Allocations. Theory Comput. Syst. 59(4): 581-599 (2016) - [j40]Ioannis Caragiannis, Christos Kalaitzis:
Space lower bounds for low-stretch greedy embeddings. Theor. Comput. Sci. 610: 149-157 (2016) - [j39]Ioannis Caragiannis, Ariel D. Procaccia, Nisarg Shah:
When Do Noisy Votes Reveal the Truth? ACM Trans. Economics and Comput. 4(3): 15:1-15:30 (2016) - [j38]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Limitations of Deterministic Auction Design for Correlated Bidders. ACM Trans. Comput. Theory 8(4): 13:1-13:18 (2016) - [c82]Simina Brânzei, Ioannis Caragiannis, David Kurokawa, Ariel D. Procaccia:
An Algorithmic Framework for Strategic Fair Division. AAAI 2016: 418-424 - [c81]Ioannis Caragiannis, George A. Krimpas, Marianna Panteli, Alexandros A. Voudouris:
co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers. AAAI 2016: 4351-4352 - [c80]Ioannis Caragiannis, Ariel D. Procaccia, Nisarg Shah:
Truthful Univariate Estimators. ICML 2016: 127-135 - [c79]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Generalized Discrete Preference Games. IJCAI 2016: 53-59 - [c78]Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot:
Achieving Proportional Representation in Conference Programs. IJCAI 2016: 144-150 - [c77]Ioannis Caragiannis, Swaprava Nath, Ariel D. Procaccia, Nisarg Shah:
Subset Selection via Implicit Utilitarian Voting. IJCAI 2016: 151-157 - [c76]Ioannis Caragiannis, Angelo Fanelli:
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. SAGT 2016: 315-326 - [c75]Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang:
The Unreasonable Fairness of Maximum Nash Welfare. EC 2016: 305-322 - [c74]Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris:
How Effective Can Simple Ordinal Peer Grading Be? EC 2016: 323-340 - [c73]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. WINE 2016: 236-250 - [r3]Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra:
Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice 2016: 103-126 - [i18]Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris:
How effective can simple ordinal peer grading be? CoRR abs/1602.07985 (2016) - [i17]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. CoRR abs/1602.08023 (2016) - [i16]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Discrete Preference Games in Heterogeneous Social Networks: Subverted Majorities and the Swing Player. CoRR abs/1603.02971 (2016) - [i15]Ioannis Caragiannis, Angelo Fanelli:
An almost ideal coordination mechanism for unrelated machine scheduling. CoRR abs/1605.04674 (2016) - [i14]Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish:
Opting Into Optimal Matchings. CoRR abs/1609.04051 (2016) - [i13]Ioannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas, Alexandros A. Voudouris:
Optimizing positional scoring rules for rank aggregation. CoRR abs/1609.07460 (2016) - 2015
- [j37]Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet:
Optimal social choice functions: A utilitarian view. Artif. Intell. 227: 190-213 (2015) - [j36]John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing Efficient Equilibria in Network Design Games via Subsidies. Algorithmica 72(1): 44-82 (2015) - [j35]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
Bounding the inefficiency of outcomes in generalized second price auctions. J. Econ. Theory 156: 343-388 (2015) - [j34]Ioannis Caragiannis, Aris Filos-Ratsikas, Ariel D. Procaccia:
An improved 2-agent kidney exchange mechanism. Theor. Comput. Sci. 589: 53-60 (2015) - [j33]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. ACM Trans. Economics and Comput. 3(1): 2:1-2:32 (2015) - [c72]Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris:
Aggregating Partial Rankings with Applications to Peer Grading in Massive Online Open Courses. AAMAS 2015: 675-683 - [c71]Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos, George A. Krimpas, Nikos Protopapas, Alexandros A. Voudouris:
Efficiency and Complexity of Price Competition Among Single-Product Vendors. IJCAI 2015: 25-31 - [c70]Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris:
Near-Optimal Asymmetric Binary Matrix Partitions. MFCS (2) 2015: 1-13 - [c69]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Minority Becomes Majority in Social Networks. WINE 2015: 74-88 - [i12]Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos, George A. Krimpas, Nikos Protopapas, Alexandros A. Voudouris:
Efficiency and complexity of price competition among single-product vendors. CoRR abs/1502.03945 (2015) - 2014
- [j32]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia:
Socially desirable approximations for dodgson's voting rule. ACM Trans. Algorithms 10(2): 6:1-6:28 (2014) - [j31]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
Revenue Guarantees in the Generalized Second Price Auction. ACM Trans. Internet Techn. 14(2-3): 17:1-17:19 (2014) - [c68]Ioannis Caragiannis, David Kurokawa, Ariel D. Procaccia:
Biased Games. AAAI 2014: 609-615 - [c67]Ioannis Caragiannis, Ariel D. Procaccia, Nisarg Shah:
Modal Ranking: A Uniquely Robust Voting Rule. AAAI 2014: 616-622 - [c66]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. SAGT 2014: 49-60 - [c65]Ioannis Caragiannis, Alexandros A. Voudouris:
Welfare Guarantees for Proportional Allocations. SAGT 2014: 206-217 - [i11]Ioannis Caragiannis, Alexandros A. Voudouris:
Welfare guarantees for proportional allocations. CoRR abs/1402.3447 (2014) - [i10]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. CoRR abs/1402.3450 (2014) - [i9]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Discrete preference games: social influence through coordination, and beyond. CoRR abs/1402.4050 (2014) - [i8]Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris:
Near-optimal asymmetric binary matrix partitions. CoRR abs/1407.8170 (2014) - [i7]Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris:
Aggregating partial rankings with applications to peer grading in massive online open courses. CoRR abs/1411.4619 (2014) - 2013
- [j30]Ioannis Caragiannis:
Efficient Coordination Mechanisms for Unrelated Machine Scheduling. Algorithmica 66(3): 512-540 (2013) - [j29]Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25(1): 60-77 (2013) - [j28]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight approximation bounds for combinatorial frugal coverage algorithms. J. Comb. Optim. 26(2): 292-309 (2013) - [j27]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Energy-Efficient Communication in Multi-interface Wireless Networks. Theory Comput. Syst. 52(2): 285-296 (2013) - [j26]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) - [j25]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. IEEE/ACM Trans. Netw. 21(4): 1322-1331 (2013) - [c64]Simina Brânzei, Ioannis Caragiannis, Jamie Morgenstern, Ariel D. Procaccia:
How Bad Is Selfish Voting? AAAI 2013: 138-144 - [c63]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Limitations of Deterministic Auction Design for Correlated Bidders. ESA 2013: 277-288 - [c62]Ioannis Caragiannis, Ariel D. Procaccia, Nisarg Shah:
When do noisy votes reveal the truth? EC 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:
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 [contents] - [i6]Simina Brânzei, Ioannis Caragiannis, David Kurokawa, Ariel D. Procaccia:
Equilibria of Generalized Cut and Choose Protocols. CoRR abs/1307.2225 (2013) - 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 Exch. 11(1): 26-29 (2012) - [c61]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
Revenue Guarantees in Sponsored Search Auctions. ESA 2012: 253-264 - [c60]Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet:
Optimal social choice functions: a utilitarian view. EC 2012: 197-214 - [c59]Ioannis Caragiannis, Edith Elkind, Mario Szegedy, Lan Yu:
Mechanism design: from partial to probabilistic verification. EC 2012: 266-283 - [c58]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC 2012: 284-301 - [c57]Ioannis Caragiannis, Christos Kalaitzis:
Space Lower Bounds for Low-Stretch Greedy Embeddings. SIROCCO 2012: 1-12 - [c56]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) - [c55]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. FAW-AAIM 2011: 185-195 - [c54]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541 - [c53]Ioannis Caragiannis, John K. Lai, Ariel D. Procaccia:
Towards More Expressive Cake Cutting. IJCAI 2011: 127-132 - [c52]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On the efficiency of equilibria in generalized second price auctions. EC 2011: 81-90 - [c51]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 Trans. Algorithms 7(1): 13:1-13:31 (2010) - [c50]Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos Markakis:
Approximation Algorithms and Mechanism Design for Minimax Approval Voting. AAAI 2010: 737-742 - [c49]Ioannis Caragiannis, Ariel D. Procaccia:
Voting Almost Maximizes Social Welfare Despite Limited Communication. AAAI 2010: 743-748 - [c48]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 - [c47]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia:
Socially desirable approximations for Dodgson's voting rule. EC 2010: 253-262 - [c46]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 - [p3]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263 - [p2]Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing:
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. Graphs and Algorithms in Communication Networks 2010: 335-355
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. Discret. Math. 23(2): 959-978 (2009) - [c45]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Low-Envy Truthful Allocations. ADT 2009: 111-119 - [c44]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
An Improved Approximation Bound for Spanning Star Forest and Color Saving. MFCS 2009: 90-101 - [c43]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Energy-Efficient Communication in Multi-interface Wireless Networks. MFCS 2009: 102-111 - [c42]Ioannis Caragiannis:
Efficient coordination mechanisms for unrelated machine scheduling. SODA 2009: 815-824 - [c41]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 - [c40]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) - [c39]Geppino Pucci, Coromoto León, Ioannis Caragiannis, Kieran T. Herley:
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2008: 876 - [c38]Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. MFCS 2008: 205-216 - [c37]Ioannis Caragiannis:
Better bounds for online load balancing on unrelated machines. SODA 2008: 972-981 - [c36]Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese:
Communication in wireless networks with directional antennas. SPAA 2008: 344-351 - [c35]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. Discret. Appl. Math. 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) - [c34]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. FCT 2007: 52-63 - [c33]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 - [c32]Ioannis Caragiannis:
Wavelength Management in WDM Rings to Maximize the Number of Connections. STACS 2007: 61-72 - [r2]Ioannis Caragiannis, Panagiotis Kanellopoulos, Christos Kaklamanis:
Minimum Energy Communication in Ad Hoc Wireless Networks. Handbook of Parallel Computing 2007 - [r1]Ioannis Caragiannis, Evi Papaioannou, Christos Kaklamanis:
Online Call Admission Control in Wireless Cellular Networks. Handbook of Parallel Computing 2007 - 2006
- [j11]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design. Theory Comput. Syst. 39(5): 593-617 (2006) - [c31]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Taxes for Linear Atomic Congestion Games. ESA 2006: 184-195 - [c30]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322 - [c29]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou:
Scheduling to Maximize Participation. TGC 2006: 218-232 - [p1]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Approximation Algorithms for Path Coloring in Trees. Efficient Approximation and Online Algorithms 2006: 74-96 - 2005
- [c28]Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Geometric Clustering to Minimize the Sum of Cluster Sizes. ESA 2005: 460-471 - [c27]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. Euro-Par 2005: 1089-1099 - [c26]Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Basic Computations in Wireless Networks. ISAAC 2005: 533-542 - [c25]Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Network Load Games. ISAAC 2005: 809-818 - [c24]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. Discret. Appl. Math. 143(1-3): 54-61 (2004) - [c23]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 - [c22]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Online Algorithms for Disk Graphs. MFCS 2004: 215-226 - [c21]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) - [c20]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design. ISAAC 2003: 585-594 - [c19]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Simple On-Line Algorithms for Call Control in Cellular Networks. WAOA 2003: 67-80 - [c18]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 - [c17]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. Bull. 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) - [c16]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. Comput. Artif. Intell. 20(2): 95-120 (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) - [c15]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano:
Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743 - [c14]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Competitive Analysis of On-line Randomized Call Control in Cellular Networks. IPDPS 2001: 14 - [c13]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 - [c12]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 Process. Lett. 10(4): 305-314 (2000) - [c11]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Randomized path coloring on binary trees. APPROX 2000: 60-71 - [c10]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 - [c9]Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados:
Greedy Dynamic Hot-Potato Routing on Arrays. ISPAN 2000: 178-185 - [c8]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Efficient on-line communication in cellular networks. SPAA 2000: 46-53
1990 – 1999
- 1999
- [c7]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Edge Coloring of Bipartite Graphs with Constraints. MFCS 1999: 376-386 - [c6]Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis:
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. WAE 1999: 259-271 - 1998
- [c5]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Efficient wavelength routing in trees with low-degree converters. Multichannel Optical Networks: Theory and Practice 1998: 1-14 - [c4]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
On the Complexity of Wavelength Converters. MFCS 1998: 771-779 - [c3]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. SIROCCO 1998: 10-19 - 1997
- [c2]Vassilis C. Gerogiannis, Ioannis Caragiannis, Manthos A. Tsoukarellas:
A general framework for applying safety analysis to safety critical real-time applications using fault trees. RTS 1997: 168-175 - [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
[j58] [c102] [i30] [j38] [j35] [j32] [j31] [j28] [j27] [c63] [j24] [j23] [c61] [i5] [j20] [c55] [c52] [j19] [j18] [c47] [c46] [p3] [p2] [j17] [c45] [c44] [c43] [c41] [c40] [j15] [j14] [c36] [c35] [j13] [j12] [c34] [r2] [r1] [j11] [c31] [c30] [c29] [p1] [c28] [c27] [c26] [c25] [c24] [j10] [c23] [c22] [c21] [j9] [c20] [c19] [c18] [c17] [j8] [j7] [j6] [j5] [j4] [c16] [j3] [j2] [c15] [c14] [c13] [c12] [j1] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c1]
Giuseppe Persiano
aka: Pino Persiano
aka: Pino Persiano
Nikos Protopapas
aka: Nicos Protopapas
aka: Nicos Protopapas
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-21 02:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
