Author of the publication

Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms.

, , , and . J. Comput. Geom., 11 (1): 26-59 (2020)

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

Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains., , , , , , , and . CoRR, (2019)New Applications of the Nearest-Neighbor Chain Algorithm.. University of California, Irvine, USA, (2019)Taming the knight's tour: Minimizing turns and crossings., , , , and . Theor. Comput. Sci., (2022)Taming the Knight's Tour: Minimizing Turns and Crossings., , , and . CoRR, (2019)Taming the Knight's Tour: Minimizing Turns and Crossings., , , and . FUN, volume 157 of LIPIcs, page 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Defining Equitable Geographic Districts in Road Networks via Stable Matching., , , and . SIGSPATIAL/GIS, page 52:1-52:4. ACM, (2017)Reactive Proximity Data Structures for Graphs., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 777-789. Springer, (2018)Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms., , , and . J. Comput. Geom., 11 (1): 26-59 (2020)New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs., , , , , , , and . ISAAC, volume 149 of LIPIcs, page 51:1-51:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)SANA NetGO: a combinatorial approach to using Gene Ontology (GO) terms to score network alignments., and . Bioinform., 34 (8): 1345-1352 (2018)