{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:44Z","timestamp":1750306844690,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,8]]},"DOI":"10.1145\/2582112.2595650","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"96-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometric kth Shortest Paths"],"prefix":"10.1145","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[{"name":"Mentor Graphics Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[{"name":"Helsinki Institute for IT, CS Dept, University of Helsinki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[{"name":"Dep. Mathematics and Computer Science, TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Topi","family":"Talvitie","sequence":"additional","affiliation":[{"name":"Helsinki Institute for IT, CS Dept, University of Helsinki"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Geometric kth shortest paths","author":"Eriksson-Bique S.","year":"2013","unstructured":"S. Eriksson-Bique , J. Hershberger , V. Polishchuk , B. Speckmann , S. Suri , T. Talvitie , K. Verbeek , and H. Yildiz . Geometric kth shortest paths , 2013 . Available at http:\/\/www.cs.helsinki.fi\/group\/compgeom\/ksp\/socg2014_submission_32.pdf. S. Eriksson-Bique, J. Hershberger, V. Polishchuk, B. Speckmann, S. Suri, T. Talvitie, K. Verbeek, and H. Yildiz. Geometric kth shortest paths, 2013. Available at http:\/\/www.cs.helsinki.fi\/group\/compgeom\/ksp\/socg2014_submission_32.pdf."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/S0097539795289604"}],"event":{"sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"SOCG'14","name":"SOCG'14: Annual Symposium on Computational Geometry","location":"Kyoto Japan"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2595650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2595650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:10Z","timestamp":1750234210000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2595650"}},"subtitle":["the Applet"],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":2,"alternative-id":["10.1145\/2582112.2595650","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2595650","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}