{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:50:07Z","timestamp":1763466607250,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"LDRD","award":["20160317ER"],"award-info":[{"award-number":["20160317ER"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,31]]},"DOI":"10.1145\/2915516.2915518","type":"proceedings-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T08:37:36Z","timestamp":1464338256000},"page":"9-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Shortest-Path Queries in Planar Graphs"],"prefix":"10.1145","author":[{"given":"Lyudmil","family":"Aleksandrov","sequence":"first","affiliation":[{"name":"IICT, Bulgarian Acad. of Sci., Sofia, Bulgaria"}]},{"given":"Guillaume","family":"Chapuis","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9204-0"},{"key":"e_1_3_2_1_2_1","volume-title":"Route planning in transportation networks. CoRR, abs\/1504.05140","author":"Bast H.","year":"2015","unstructured":"H. Bast, D. Delling, A. V. Goldberg, M. M\u00fcller-Hannemann, T. Pajor, P. Sanders, D. Wagner, and R. F. Werneck. Route planning in transportation networks. CoRR, abs\/1504.05140, 2015."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26520-9_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00021-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010016"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_7_1","unstructured":"B. Dawes D. Abrahams and R. Rivera. Boost C++ libraries. http:\/\/www. boost. org 35:36 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647677.731981"},{"key":"e_1_3_2_1_10_1","volume-title":"Los Alamos National Laboratory","author":"Djidjev H. N.","year":"2016","unstructured":"H. N. Djidjev, L. Aleksandrov, and G. J. Chapuis. Parallel shortest-path queries in planar graphs. Technical report, Los Alamos National Laboratory, 2016."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102788"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/330577"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765751.1765759"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/204865.204889"},{"key":"e_1_3_2_1_16_1","first-page":"277","volume-title":"Proceedings of the International Conference ParCo","author":"Nussbaum D.","year":"2005","unstructured":"D. Nussbaum, J. Sack, and H. Ye. Concurrent parallel shortest path computation. In Proceedings of the International Conference ParCo, pages 277--284, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"}],"event":{"name":"HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Kyoto Japan","acronym":"HPDC'16"},"container-title":["Proceedings of the ACM Workshop on High Performance Graph Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2915516.2915518","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2915516.2915518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:17:45Z","timestamp":1763457465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":17,"alternative-id":["10.1145\/2915516.2915518","10.1145\/2915516"],"URL":"https:\/\/doi.org\/10.1145\/2915516.2915518","relation":{},"subject":[],"published":{"date-parts":[[2016,5,31]]},"assertion":[{"value":"2016-05-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}