Author of the publication

On the Hardness of Network Design for Bottleneck Routing Games.

, , , and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 156-167. Springer, (2012)

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

Thresholds of Random k-Sat., and . Encyclopedia of Algorithms, Springer, (2008)Οριακά φαινόμενα αλλαγής φάσης σε συνδυαστικά προβλήματα. University of Patras, Greece, (2003)National Archive of PhD Theses: oai:10442/26364.Experimental Results for Stackelberg Scheduling Strategies., , , and . WEA, volume 3503 of Lecture Notes in Computer Science, page 77-88. Springer, (2005)Selecting Complementary Pairs of Literals., , and . Electron. Notes Discret. Math., (2003)The Price of Optimum in Stackelberg Games, , and . Electron. Colloquium Comput. Complex., (2005)Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time., , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 193-202. Springer, (2009)Thresholds of Random k-Sat., and . Encyclopedia of Algorithms, (2016)Resolving Braess's Paradox in Random Networks., , , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 188-201. Springer, (2013)Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold., , , , and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 328-338. Springer, (2001)Efficient Methods for Selfish Network Design., , and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 459-471. Springer, (2009)