Author of the publication

Approximation and Hardness of Token Swapping.

, , , , , and . ESA, volume 57 of LIPIcs, page 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Tight Exact and Approximate Algorithmic Results on Token Swapping., , , , , and . CoRR, (2016)Treewidth and Pure Nash Equilibria., and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 348-360. Springer, (2013)The Complexity of Recognizing Unique Sink Orientations., and . STACS, volume 30 of LIPIcs, page 341-353. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Deterministic Algorithms for Unique Sink Orientations of Grids., , , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 357-369. Springer, (2016)Advertising network formation based on stochastic diffusion search and market equilibria., , , and . SIGDOC, page 81-87. ACM, (2010)The Complexity of Optimization on Grids., , , , , , and . Algorithmica, 81 (9): 3494-3518 (2019)The Niceness of Unique Sink Orientations., and . APPROX-RANDOM, volume 60 of LIPIcs, page 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Pure Nash Equilibria in Graphical Games and Treewidth., and . Algorithmica, 71 (3): 581-604 (2015)Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes.. ESA, volume 87 of LIPIcs, page 69:1-69:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximation and Hardness of Token Swapping., , , , , and . ESA, volume 57 of LIPIcs, page 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)