{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:20Z","timestamp":1787017340556,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["288094"],"award-info":[{"award-number":["288094"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WA 654\/16-1"],"award-info":[{"award-number":["WA 654\/16-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002765","name":"Bundesministerium fur Wirtschaft und Technologie","doi-asserted-by":"publisher","award":["01ME12013"],"award-info":[{"award-number":["01ME12013"]}],"id":[{"id":"10.13039\/501100002765","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,5]]},"DOI":"10.1145\/2525314.2525361","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"54-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Energy-optimal routes for electric vehicles"],"prefix":"10.1145","author":[{"given":"Moritz","family":"Baum","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT)"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882150.1882190"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444020"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_5_1","volume-title":"Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis","author":"Dean B. C.","year":"1999","unstructured":"B. C. Dean . Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis , Massachusetts Institute of Technology , 1999 . B. C. Dean. Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis, Massachusetts Institute of Technology, 1999."},{"key":"e_1_3_2_1_6_1","volume-title":"Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Technical report","author":"Dean B. C.","year":"2004","unstructured":"B. C. Dean . Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Technical report , Massachusetts Institute Of Technology , 2004 . B. C. Dean. Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Technical report, Massachusetts Institute Of Technology, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008657"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074\/04"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_5"},{"key":"e_1_3_2_1_13_1","volume-title":"Arkaya. Machine-Learning Methodology for Energy Efficient Routing. In the 19th World Congress on Intelligent Transport Systems","author":"Demestichas K.","year":"2012","unstructured":"K. Demestichas , M. Masikos , E. Adamopoulou , S. Dreher , and A. D. de Arkaya. Machine-Learning Methodology for Energy Efficient Routing. In the 19th World Congress on Intelligent Transport Systems , October 2012 . K. Demestichas, M. Masikos, E. Adamopoulou, S. Dreher, and A. D. de Arkaya. Machine-Learning Methodology for Energy Efficient Routing. In the 19th World Congress on Intelligent Transport Systems, October 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140208"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900599"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_19_1","first-page":"100","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)","author":"Gutman R. J.","year":"2004","unstructured":"R. J. Gutman . Reach-Based Routing : A New Approach to Shortest Path Algorithms Optimized for Road Networks . In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04) , pages 100 -- 111 . SIAM, 2004 . R. J. Gutman. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04), pages 100--111. SIAM, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_21_1","unstructured":"S. Hausberger. Simulation of Real World Vehicle Exhaust Emissions 2003.  S. Hausberger. Simulation of Real World Vehicle Exhaust Emissions 2003."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412239"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094062"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900645"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790265.2790267"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384254"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/646680.702320"},{"key":"e_1_3_2_1_31_1","volume-title":"Shortest-Path Queries in Static Networks","author":"Sommer C.","year":"2012","unstructured":"C. Sommer . Shortest-Path Queries in Static Networks , 2012 . submitted. Preprint available at http:\/\/www.sommer.jp\/spq-survey.htm. C. Sommer. Shortest-Path Queries in Static Networks, 2012. submitted. Preprint available at http:\/\/www.sommer.jp\/spq-survey.htm."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442942.2442947"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/19397038.2011.592956"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITST.2012.6425172"}],"event":{"name":"SIGSPATIAL'13: 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Orlando Florida","acronym":"SIGSPATIAL'13","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525361","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2525314.2525361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:23Z","timestamp":1750217303000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":33,"alternative-id":["10.1145\/2525314.2525361","10.1145\/2525314"],"URL":"https:\/\/doi.org\/10.1145\/2525314.2525361","relation":{},"subject":[],"published":{"date-parts":[[2013,11,5]]},"assertion":[{"value":"2013-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}