( en | de | ru )

 

Disambiguation of "Oh, Eunjin"

Author of the publication

copydeleteadd this publication to your clipboard
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

, , , , , and . SoCG, volume 34 of LIPIcs, page 209-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

Eunjin Kim

Erika Oh

Eunkyong Oh

Alexander Oh

Jinsook Oh

 

Other publications of authors with the same name

The Geodesic 2-center Problem in a Simple Polygon., , and . CoRR, (2017)Effects of speaker gender on voice onset time in Korean stops.. J. Phonetics, 39 (1): 59-67 (2011)A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms., and . ISAAC, volume 92 of LIPIcs, page 61:1-61:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimizing Distance-to-Sight in Polygonal Domains.. ISAAC, volume 123 of LIPIcs, page 59:1-59:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Constrained Geodesic Centers of a Simple Polygon., , and . SWAT, volume 53 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The 2-Center Problem in a Simple Polygon., , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 307-317. Springer, (2015)The geodesic 2-center problem in a simple polygon., , and . Comput. Geom., (2018)Reachability Problems for Transmission Graphs., and . Algorithmica, 84 (10): 2820-2841 (2022)Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs., and . ESA, volume 274 of LIPIcs, page 85:1-85:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximate Range Queries for Clustering., and . SoCG, volume 99 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)