( en | de | ru )

 

Disambiguation of "Caragiannis, Ioannis"

Author of the publication

copydeleteadd this publication to your clipboard
Almost envy-free allocations with connected bundles.

, , , , , , , and . Games Econ. Behav., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ioannis Tzamichas

Ioannis Filippis

Ioannis Efthimiadis

Ioannis Vardoulakis

Ioannis Sikiotis

 

Other publications of authors with the same name

Wavelength Management in WDM Rings to Maximize the Number of Connections.. STACS, volume 4393 of Lecture Notes in Computer Science, page 61-72. Springer, (2007)Simple On-Line Algorithms for Call Control in Cellular Networks., , and . WAOA, volume 2909 of Lecture Notes in Computer Science, page 67-80. Springer, (2003)Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs., , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 52-63. Springer, (2007)Efficiency and Complexity of Price Competition Among Single-Product Vendors., , , , , and . IJCAI, page 25-31. AAAI Press, (2015)Minority Becomes Majority in Social Networks., , , , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 74-88. Springer, (2015)An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling., and . Theory Comput. Syst., 63 (1): 114-127 (2019)New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies., , and . SIROCCO, volume 8 of Proceedings in Informatics, page 77-88. Carleton Scientific, (2001)Tight approximation bounds for combinatorial frugal coverage algorithms., , and . J. Comb. Optim., 26 (2): 292-309 (2013)Tight Bounds for Selfish and Greedy Load Balancing., , , , and . Algorithmica, 61 (3): 606-637 (2011)Efficient on-line communication in cellular networks., , and . SPAA, page 46-53. ACM, (2000)