Author of the publication

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.

, , and . FCT, volume 8070 of Lecture Notes in Computer Science, page 171-182. Springer, (2013)

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

Approximate Maximin Share Allocations in Matroids., and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 310-321. (2017)On the Performance of Congestion Games for Optimum Satisfiability Problems., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 233-246. Springer, (2011)The Complexity of Bottleneck Labeled Graph Problems., , and . WG, volume 4769 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)The Minimum Reload s-tPath/Trail/Walk Problems., , , and . SOFSEM, volume 5404 of Lecture Notes in Computer Science, page 621-632. Springer, (2009)Extension and Its Price for the Connected Vertex Cover Problem., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 315-326. Springer, (2019)Cost allocation protocols for network formation on connection situations., , , and . VALUETOOLS, page 228-234. ICST/IEEE, (2012)Extension of Vertex Cover and Independent Set in Some Classes of Graphs., , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 124-136. Springer, (2019)On the complexity of the selective graph coloring problem in some special classes of graphs., , , and . Theor. Comput. Sci., (2014)Weighted Upper Edge Cover: Complexity and Approximability., , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 235-247. Springer, (2019)