{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:27:43Z","timestamp":1765960063311,"version":"3.41.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2019,12,17]]},"abstract":"<jats:p>We study the problem of computing isocontours in static and dynamic road networks, where the objective is to identify the boundary of the region that is reachable from a given source within a certain amount of time (or another limited resource). Although there is a wide range of practical applications for this problem\u00a0(e.g., urban planning, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast algorithms for large, realistic inputs, and existing approaches tend to compute more information than necessary. Our contribution is twofold: (1) We propose compact but sufficient definitions of isocontours, based on which (2) we provide several easy-to-parallelize, scalable algorithmic approaches for faster computation. By extensive experimental analysis, we demonstrate that our techniques enable interactive isocontour computation within milliseconds even on continental networks, significantly faster than the state of the art.<\/jats:p>","DOI":"10.1145\/3355514","type":"journal-article","created":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T16:35:58Z","timestamp":1571157358000},"page":"1-26","source":"Crossref","is-referenced-by-count":2,"title":["Fast Exact Computation of Isocontours in Road Networks"],"prefix":"10.1145","volume":"24","author":[{"given":"Moritz","family":"Baum","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Buchhold","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[{"name":"Sunnyvale, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"volume-title":"Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS\u201912)","author":"Abraham Ittai","key":"e_1_2_1_1_1","unstructured":"Ittai Abraham , Daniel Delling , Amos Fiat , Andrew V. Goldberg , and Renato F. Werneck . 2012. HLDB: Location-based services in databases . In Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS\u201912) . ACM, New York, NY, 339--348. Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck. 2012. HLDB: Location-based services in databases. In Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS\u201912). ACM, New York, NY, 339--348."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2985473"},{"key":"e_1_2_1_3_1","volume-title":"Werneck","author":"Bast Hannah","year":"2016","unstructured":"Hannah Bast , Daniel Delling , Andrew V. Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2016 . Route planning in transportation networks. In Algorithm Engineering. Lecture Notes in Computer Science, Vol. 9220 . Springer , 19--80. Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route planning in transportation networks. In Algorithm Engineering. Lecture Notes in Computer Science, Vol. 9220. Springer, 19--80."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.003"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463524"},{"key":"e_1_2_1_6_1","first-page":"24","article-title":"Scalable exact visualization of isocontours in road networks via minimum-link paths","volume":"9","author":"Baum Moritz","year":"2018","unstructured":"Moritz Baum , Thomas Bl\u00e4sius , Andreas Gemsa , Ignaz Rutter , and Franziska Wegner . 2018 . Scalable exact visualization of isocontours in road networks via minimum-link paths . Journal of Computational Geometry 9 , 1 (2018), 24 -- 70 . Moritz Baum, Thomas Bl\u00e4sius, Andreas Gemsa, Ignaz Rutter, and Franziska Wegner. 2018. Scalable exact visualization of isocontours in road networks via minimum-link paths. Journal of Computational Geometry 9, 1 (2018), 24--70.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_2_1_7_1","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","author":"Baum Moritz","unstructured":"Moritz Baum , Valentin Buchhold , Julian Dibbelt , and Dorothea Wagner . 2016. Fast exact computation of isochrones in road networks . In Experimental Algorithms . Lecture Notes in Computer Science , Vol. 9685 . Springer , 17--32. Moritz Baum, Valentin Buchhold, Julian Dibbelt, and Dorothea Wagner. 2016. Fast exact computation of isochrones in road networks. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 9685. Springer, 17--32."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820826"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201914)","volume":"42","author":"Baum Moritz","year":"2014","unstructured":"Moritz Baum , Julian Dibbelt , Lorenz H\u00fcbschle-Schneider , Thomas Pajor , and Dorothea Wagner . 2014 . Speed-consumption tradeoff for electric vehicle route planning . In Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201914) . OpenAccess Series in Informatics (OASIcs) , Vol. 42 . 138--151. Moritz Baum, Julian Dibbelt, Lorenz H\u00fcbschle-Schneider, Thomas Pajor, and Dorothea Wagner. 2014. Speed-consumption tradeoff for electric vehicle route planning. In Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201914). OpenAccess Series in Informatics (OASIcs), Vol. 42. 138--151."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525361"},{"key":"e_1_2_1_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","author":"Baum Moritz","unstructured":"Moritz Baum , Julian Dibbelt , Thomas Pajor , and Dorothea Wagner . 2016. Dynamic time-dependent route planning in road networks with user preferences . In Experimental Algorithms . Lecture Notes in Computer Science , Vol. 9685 . Springer , 33--49. Moritz Baum, Julian Dibbelt, Thomas Pajor, and Dorothea Wagner. 2016. Dynamic time-dependent route planning in road networks with user preferences. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 9685. Springer, 33--49."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917). Leibniz International Proceedings in Informatics (LIPIcs)","volume":"75","author":"Baum Moritz","year":"2017","unstructured":"Moritz Baum , Jonas Sauer , Dorothea Wagner , and Tobias Z\u00fcndorf . 2017 . Consumption profiles in route planning for electric vehicles: Theory and applications . In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917). Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 75 . Article 19, 18 pages. Moritz Baum, Jonas Sauer, Dorothea Wagner, and Tobias Z\u00fcndorf. 2017. Consumption profiles in route planning for electric vehicles: Theory and applications. In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 75. Article 19, 18 pages."},{"volume-title":"Fast Computation of Isochrones in Road Networks. Master\u2019s Thesis","author":"Buchhold Valentin","key":"e_1_2_1_13_1","unstructured":"Valentin Buchhold . 2015. Fast Computation of Isochrones in Road Networks. Master\u2019s Thesis . Karlsruhe Institute of Technology . Valentin Buchhold. 2015. Fast Computation of Isochrones in Road Networks. Master\u2019s Thesis. Karlsruhe Institute of Technology."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3226663.3227073"},{"volume-title":"Dynamic Cruising Range Prediction for Electric Vehicles","author":"Conradi Peter","key":"e_1_2_1_15_1","unstructured":"Peter Conradi , Philipp Bouteiller , and Sascha Han\u00dfen . 2011. Dynamic Cruising Range Prediction for Electric Vehicles . Springer , 269--277. Peter Conradi, Philipp Bouteiller, and Sascha Han\u00dfen. 2011. Dynamic Cruising Range Prediction for Electric Vehicles. Springer, 269--277."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"volume-title":"Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201911)","author":"Delling Daniel","key":"e_1_2_1_18_1","unstructured":"Daniel Delling , Andrew V. Goldberg , Ilya Razenshteyn , and Renato F. Werneck . 2011. Graph partitioning with natural cuts . In Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201911) . IEEE, Los Alamitos, CA, 1135--1146. Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck. 2011. Graph partitioning with natural cuts. In Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201911). IEEE, Los Alamitos, CA, 1135--1146."},{"key":"e_1_2_1_19_1","first-page":"52","article-title":"Faster batched shortest paths in road networks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911)","volume":"20","author":"Delling Daniel","year":"2011","unstructured":"Daniel Delling , Andrew V. Goldberg , and Renato F. Werneck . 2011 . Faster batched shortest paths in road networks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911) . OpenAccess Series in Informatics (OASIcs) , Vol. 20. 52 -- 63 . Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011. Faster batched shortest paths in road networks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911). OpenAccess Series in Informatics (OASIcs), Vol. 20. 52--63.","journal-title":"OpenAccess Series in Informatics (OASIcs)"},{"volume-title":"High-Performance Multi-Level Routing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"Delling Daniel","key":"e_1_2_1_20_1","unstructured":"Daniel Delling , Martin Holzer , Kirill M\u00fcller , Frank Schulz , and Dorothea Wagner . 2009. High-Performance Multi-Level Routing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science , Vol. 74 . American Mathematical Society , Providence, RI , 73--92. Daniel Delling, Martin Holzer, Kirill M\u00fcller, Frank Schulz, and Dorothea Wagner. 2009. High-Performance Multi-Level Routing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 74. American Mathematical Society, Providence, RI, 73--92."},{"key":"e_1_2_1_21_1","volume-title":"Werneck","author":"Delling Daniel","year":"2013","unstructured":"Daniel Delling and Renato F . Werneck . 2013 . Faster customization of road networks. In Experiental Algorithms. Lecture Notes in Computer Science, Vol. 7933 . Springer , 30--42. Daniel Delling and Renato F. Werneck. 2013. Faster customization of road networks. In Experiental Algorithms. Lecture Notes in Computer Science, Vol. 7933. Springer, 30--42."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345386"},{"key":"e_1_2_1_23_1","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"74","author":"Demetrescu Camil","unstructured":"Camil Demetrescu , Andrew V. Goldberg , and David S . Johnson (Eds.). 2009 . The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science , Vol. 74 . American Mathematical Society, Providence, RI. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.). 2009. The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 74. American Mathematical Society, Providence, RI."},{"key":"e_1_2_1_24_1","volume-title":"Customizable contraction hierarchies. ACM Journal of Experimental Algorithmics 21","author":"Dibbelt Julian","year":"2016","unstructured":"Julian Dibbelt , Ben Strasser , and Dorothea Wagner . 2016. Customizable contraction hierarchies. ACM Journal of Experimental Algorithmics 21 ( 2016 ), Article 1.5, 49 pages. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. 2016. Customizable contraction hierarchies. ACM Journal of Experimental Algorithmics 21 (2016), Article 1.5, 49 pages."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2533828.2533835"},{"key":"e_1_2_1_27_1","series-title":"Lecture Notes in Computer Science","volume-title":"Spatial and Temporal Databases","author":"Efentakis Alexandros","unstructured":"Alexandros Efentakis , Christodoulos Efstathiades , and Dieter Pfoser . 2015. COLD. Revisiting hub labels on the database for large-scale graphs . In Spatial and Temporal Databases . Lecture Notes in Computer Science , Vol. 9239 . Springer , 22--39. Alexandros Efentakis, Christodoulos Efstathiades, and Dieter Pfoser. 2015. COLD. Revisiting hub labels on the database for large-scale graphs. In Spatial and Temporal Databases. Lecture Notes in Computer Science, Vol. 9239. Springer, 22--39."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525325"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_30"},{"key":"e_1_2_1_30_1","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","author":"Efentakis Alexandros","unstructured":"Alexandros Efentakis , Dieter Pfoser , and Yannis Vassiliou . 2015. SALT. A unified framework for all shortest-path query variants on road networks . In Experimental Algorithms . Lecture Notes in Computer Science , Vol. 9125 . Springer , 298--311. Alexandros Efentakis, Dieter Pfoser, and Yannis Vassiliou. 2015. SALT. A unified framework for all shortest-path query variants on road networks. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 9125. Springer, 298--311."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424383"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934675"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI\u201911)","author":"Eisner Jochen","year":"2011","unstructured":"Jochen Eisner , Stefan Funke , and Sabine Storandt . 2011 . Optimal route planning for electric vehicles in large networks . In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI\u201911) . 1108--1113. Jochen Eisner, Stefan Funke, and Sabine Storandt. 2011. Optimal route planning for electric vehicles in large networks. In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI\u201911). 1108--1113."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 4th Transportation Research Board Conference on Innovations in Travel Modeling (ITM\u201912)","author":"Foti Fletcher","year":"2012","unstructured":"Fletcher Foti , Paul Waddell , and Dennis Luxen . 2012 . A generalized computational framework for accessibility: From the pedestrian to the metropolitan scale . In Proceedings of the 4th Transportation Research Board Conference on Innovations in Travel Modeling (ITM\u201912) . Fletcher Foti, Paul Waddell, and Dennis Luxen. 2012. A generalized computational framework for accessibility: From the pedestrian to the metropolitan scale. In Proceedings of the 4th Transportation Research Board Conference on Innovations in Travel Modeling (ITM\u201912)."},{"key":"e_1_2_1_36_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms and Computation","author":"Funke Stefan","unstructured":"Stefan Funke and Sabine Storandt . 2015. Provable efficiency of contraction hierarchies with randomized preprocessing . In Algorithms and Computation . Lecture Notes in Computer Science , Vol. 9472 . Springer , 479--490. Stefan Funke and Sabine Storandt. 2015. Provable efficiency of contraction hierarchies with randomized preprocessing. In Algorithms and Computation. Lecture Notes in Computer Science, Vol. 9472. Springer, 479--490."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063972"},{"key":"e_1_2_1_38_1","series-title":"Lecture Notes in Computer Science","volume-title":"Scientific and Statistical Database Management","author":"Gamper Johann","unstructured":"Johann Gamper , Michael B\u00f6hlen , and Markus Innerebner . 2012. Scalable computation of isochrones with network expiration . In Scientific and Statistical Database Management . Lecture Notes in Computer Science , Vol. 7338 . Springer , 526--543. Johann Gamper, Michael B\u00f6hlen, and Markus Innerebner. 2012. Scalable computation of isochrones with network expiration. In Scientific and Statistical Database Management. Lecture Notes in Computer Science, Vol. 7338. Springer, 526--543."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201910)","volume":"14","author":"Geisberger Robert","year":"2010","unstructured":"Robert Geisberger , Dennis Luxen , Peter Sanders , Sabine Neubauer , and Lars Volker . 2010 . Fast detour computation for ride sharing . In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201910) . OpenAccess Series in Informatics (OASIcs) , Vol. 14 . 88--99. Robert Geisberger, Dennis Luxen, Peter Sanders, Sabine Neubauer, and Lars Volker. 2010. Fast detour computation for ride sharing. In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201910). OpenAccess Series in Informatics (OASIcs), Vol. 14. 88--99."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916)","volume":"9685","author":"Andrew","unstructured":"Andrew V. Goldberg and Alexander S. Kulikov (Eds.). 2016 . In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916) . Lecture Notes in Computer Science , Vol. 9685 . Springer. Andrew V. Goldberg and Alexander S. Kulikov (Eds.). 2016. In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916). Lecture Notes in Computer Science, Vol. 9685. Springer."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/VPPC.2014.7007121"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"e_1_2_1_44_1","series-title":"Lecture Notes in Economics and Mathematical Systems","volume-title":"Multiple Criteria Decision Making Theory and Application","author":"Hansen Pierre","unstructured":"Pierre Hansen . 1980. Bicriterion path problems . In Multiple Criteria Decision Making Theory and Application . Lecture Notes in Economics and Mathematical Systems , Vol. 177 . Springer , 109--127. Pierre Hansen. 1980. Bicriterion path problems. In Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, Vol. 177. Springer, 109--127."},{"key":"e_1_2_1_45_1","unstructured":"Stefan Hausberger Martin Rexeis Michael Zallinger and Raphael Luz. 2009. Emission Factors from the Model PHEM for the HBEFA Version 3. Available at https:\/\/www.hbefa.net.  Stefan Hausberger Martin Rexeis Michael Zallinger and Raphael Luz. 2009. Emission Factors from the Model PHEM for the HBEFA Version 3. Available at https:\/\/www.hbefa.net."},{"key":"e_1_2_1_46_1","volume-title":"Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics 13","author":"Holzer Martin","year":"2009","unstructured":"Martin Holzer , Frank Schulz , and Dorothea Wagner . 2009. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics 13 ( 2009 ), Article 2.5, 26 pages. Martin Holzer, Frank Schulz, and Dorothea Wagner. 2009. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics 13 (2009), Article 2.5, 26 pages."},{"key":"e_1_2_1_47_1","series-title":"Lecture Notes in Computer Science","volume-title":"ISOGA: A system for geographical reachability analysis. In Web and Wireless Geographical Information Systems","author":"Innerebner Markus","year":"2013","unstructured":"Markus Innerebner , Michael B\u00f6hlen , and Johann Gamper . 2013 . ISOGA: A system for geographical reachability analysis. In Web and Wireless Geographical Information Systems . Lecture Notes in Computer Science , Vol. 7820 . Springer , 180--189. Markus Innerebner, Michael B\u00f6hlen, and Johann Gamper. 2013. ISOGA: A system for geographical reachability analysis. In Web and Wireless Geographical Information Systems. Lecture Notes in Computer Science, Vol. 7820. Springer, 180--189."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90001-0"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791192"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 8th International Conference on Advances in System Simulation (SIMUL\u201916)","author":"Krajzewicz Daniel","year":"2016","unstructured":"Daniel Krajzewicz and Dirk Heinrichs . 2016 . UrMo accessibility computer\u2014A tool for computing contour accessibility measures . In Proceedings of the 8th International Conference on Advances in System Simulation (SIMUL\u201916) . 56--60. Daniel Krajzewicz and Dirk Heinrichs. 2016. UrMo accessibility computer\u2014A tool for computing contour accessibility measures. In Proceedings of the 8th International Conference on Advances in System Simulation (SIMUL\u201916). 56--60."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085538"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 26th GI-Workshop on Foundations of Databases (GvDB\u201914)","volume":"1313","author":"Krismer Nikolaus","year":"2014","unstructured":"Nikolaus Krismer , G\u00fcnter Specht , and Johann Gamper . 2014 . Incremental calculation of isochrones regarding duration . In Proceedings of the 26th GI-Workshop on Foundations of Databases (GvDB\u201914) , Vol. 1313 . 41--46. Nikolaus Krismer, G\u00fcnter Specht, and Johann Gamper. 2014. Incremental calculation of isochrones regarding duration. In Proceedings of the 26th GI-Workshop on Foundations of Databases (GvDB\u201914), Vol. 1313. 41--46."},{"key":"e_1_2_1_54_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Databases and Information Systems","author":"Marciuska Sarunas","unstructured":"Sarunas Marciuska and Johann Gamper . 2010. Determining objects within isochrones in spatial network databases . In Advances in Databases and Information Systems . Lecture Notes in Computer Science , Vol. 6295 . Springer , 392--405. Sarunas Marciuska and Johann Gamper. 2010. Determining objects within isochrones in spatial network databases. In Advances in Databases and Information Systems. Lecture Notes in Computer Science, Vol. 6295. Springer, 392--405."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810701587891"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2014.6856572"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS\u201914)","author":"Ondr\u00fa\u0161ka Peter","year":"2014","unstructured":"Peter Ondr\u00fa\u0161ka and Ingmar Posner . 2014 . The route not taken: Driver-centric estimation of electric vehicle range . In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS\u201914) . 413--420. Peter Ondr\u00fa\u0161ka and Ingmar Posner. 2014. The route not taken: Driver-centric estimation of electric vehicle range. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS\u201914). 413--420."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1080\/136588100240976"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790265.2790267"},{"key":"e_1_2_1_61_1","volume-title":"Accessibility Measures: Overview and Practical Applications.","author":"Scheurer Jan","year":"2007","unstructured":"Jan Scheurer and Carey Curtis . 2007 . Accessibility Measures: Overview and Practical Applications. Available at https:\/\/urbanet.curtin.edu.au. Jan Scheurer and Carey Curtis. 2007. Accessibility Measures: Overview and Practical Applications. Available at https:\/\/urbanet.curtin.edu.au."},{"key":"e_1_2_1_62_1","unstructured":"Christian Schulz. 2013. High Quality Graph Partitioning. Available at https:\/\/www.cc.gatech.edu.  Christian Schulz. 2013. High Quality Graph Partitioning. Available at https:\/\/www.cc.gatech.edu."},{"key":"e_1_2_1_63_1","volume-title":"Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics 5","author":"Schulz Frank","year":"2000","unstructured":"Frank Schulz , Dorothea Wagner , and Karsten Weihe . 2000. Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics 5 ( 2000 ), Article 12, 23 pages. Frank Schulz, Dorothea Wagner, and Karsten Weihe. 2000. Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics 5 (2000), Article 12, 23 pages."},{"key":"e_1_2_1_64_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithm Engineering and Experiments","author":"Schulz Frank","unstructured":"Frank Schulz , Dorothea Wagner , and Christos Zaroliagis . 2002. Using multi-level graphs for timetable information in railway systems . In Algorithm Engineering and Experiments . Lecture Notes in Computer Science , Vol. 2409 . Springer , 43--59. Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. 2002. Using multi-level graphs for timetable information in railway systems. In Algorithm Engineering and Experiments. Lecture Notes in Computer Science, Vol. 2409. Springer, 43--59."},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the 28th GI-Workshop on Foundations of Databases (GvDB\u201916)","volume":"1594","author":"Tesfaye Bezaye","year":"2016","unstructured":"Bezaye Tesfaye and Nikolaus Augsten . 2016 . Reachability queries in public transport networks . In Proceedings of the 28th GI-Workshop on Foundations of Databases (GvDB\u201916) , Vol. 1594 . 109--114. Bezaye Tesfaye and Nikolaus Augsten. 2016. Reachability queries in public transport networks. In Proceedings of the 28th GI-Workshop on Foundations of Databases (GvDB\u201916), Vol. 1594. 109--114."}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3355514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3355514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:34Z","timestamp":1750202614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3355514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":65,"alternative-id":["10.1145\/3355514"],"URL":"https:\/\/doi.org\/10.1145\/3355514","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2019,10,15]]}}}