Author of the publication

Online Conflict-Free Colorings for Hypergraphs.

, , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 219-230. Springer, (2007)

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.

 

Other publications of authors with the same name

Beyond myopic best response (in Cournot competition)., , , , and . SODA, page 993-1005. SIAM, (2012)Truth and Envy in Capacitated Allocation Games, , , , and . CoRR, (2010)On the Interplay between Incentive Compatibility and Envy Freeness, , , , and . CoRR, (2010)Online Conflict-Free Colouring for Hypergraphs., , , and . Comb. Probab. Comput., 19 (4): 493-516 (2010)Weakening the online adversary just enough to get optimal conflict-free colorings for intervals., , , and . SPAA, page 194-195. ACM, (2007)Envy-Free Makespan Approximation, , , , and . CoRR, (2009)Truth, Envy, and Truthful Market Clearing Bundle Pricing., , , , and . WINE, volume 7090 of Lecture Notes in Computer Science, page 97-108. Springer, (2011)On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations., , , , and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 608-618. Springer, (2006)Online Conflict-Free Colorings for Hypergraphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 219-230. Springer, (2007)Envy-free makespan approximation: extended abstract., , , , and . EC, page 159-166. ACM, (2010)