Author of the publication

Gerrymandering Planar Graphs.

, , , , and . AAMAS, page 463-471. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)

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

An Improved Bound for the Tree Conjecture in Network Creation Games., and . CoRR, (2021)One Dollar Each Eliminates Envy., , , , and . CoRR, (2019)One n Remains to Settle the Tree Conjecture., and . CoRR, (2023)An Improved Approximation Algorithm for the Matching Augmentation Problem., , , and . ISAAC, volume 212 of LIPIcs, page 38:1-38:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Gerrymandering Planar Graphs., , , , and . AAMAS, page 463-471. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)One Dollar Each Eliminates Envy., , , , and . EC, page 23-39. ACM, (2020)An Improved Approximation Algorithm for the Matching Augmentation Problem., , , and . SIAM J. Discret. Math., 37 (1): 163-190 (March 2023)An Improved Bound for the Tree Conjecture in Network Creation Games., and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 241-257. Springer, (2022)One n Remains to Settle the Tree Conjecture., and . STACS, volume 289 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)