{"id":"https://openalex.org/W2624110221","doi":"https://doi.org/10.1145/3085504.3085538","title":"Computing Isochrones in Multimodal Spatial Networks using Tile Regions","display_name":"Computing Isochrones in Multimodal Spatial Networks using Tile Regions","publication_year":2017,"publication_date":"2017-06-05","ids":{"openalex":"https://openalex.org/W2624110221","doi":"https://doi.org/10.1145/3085504.3085538","mag":"2624110221"},"language":"en","primary_location":{"id":"doi:10.1145/3085504.3085538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3085504.3085538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075236496","display_name":"Nikolaus Krismer","orcid":null},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Nikolaus Krismer","raw_affiliation_strings":["University of Innsbruck, Department of Computer Science, Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Department of Computer Science, Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003176374","display_name":"Doris Silbernagl","orcid":null},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Doris Silbernagl","raw_affiliation_strings":["University of Innsbruck, Department of Computer Science, Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Department of Computer Science, Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073412960","display_name":"G\u00fcnther Specht","orcid":"https://orcid.org/0000-0003-0978-7201"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G\u00fcnther Specht","raw_affiliation_strings":["University of Innsbruck, Department of Computer Science, Innsbruck, Austria"],"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Department of Computer Science, Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043864804","display_name":"Johann Gamper","orcid":"https://orcid.org/0000-0002-7128-507X"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Johann Gamper","raw_affiliation_strings":["Free University of Bozen-Bolzano, Bolzano, Italy"],"affiliations":[{"raw_affiliation_string":"Free University of Bozen-Bolzano, Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075236496"],"corresponding_institution_ids":["https://openalex.org/I190249584"],"apc_list":null,"apc_paid":null,"fwci":0.3698,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55599255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9753000140190125,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.821277379989624},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5831277966499329},{"id":"https://openalex.org/keywords/memory-footprint","display_name":"Memory footprint","score":0.5821858048439026},{"id":"https://openalex.org/keywords/tile","display_name":"Tile","score":0.5440291166305542},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5431820750236511},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5129660964012146},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.48781898617744446},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3744135797023773},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3715723156929016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37137371301651},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17414501309394836},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11540278792381287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.821277379989624},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5831277966499329},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.5821858048439026},{"id":"https://openalex.org/C2780728851","wikidata":"https://www.wikidata.org/wiki/Q468402","display_name":"Tile","level":2,"score":0.5440291166305542},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5431820750236511},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5129660964012146},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.48781898617744446},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3744135797023773},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3715723156929016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37137371301651},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17414501309394836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11540278792381287},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3085504.3085538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3085504.3085538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.39UBZ_INST:11235422210001241","is_oa":false,"landing_page_url":"http://doi.acm.org/10.1145/3085504.3085538","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W58623172","https://openalex.org/W1581541037","https://openalex.org/W1977170904","https://openalex.org/W2110152355","https://openalex.org/W2124885561","https://openalex.org/W2153973689","https://openalex.org/W2169528473","https://openalex.org/W2300133183","https://openalex.org/W2470519227","https://openalex.org/W2593919608"],"related_works":["https://openalex.org/W2114959296","https://openalex.org/W38346124","https://openalex.org/W2502442966","https://openalex.org/W2138666621","https://openalex.org/W2383936314","https://openalex.org/W1992771654","https://openalex.org/W2022661278","https://openalex.org/W2777914781","https://openalex.org/W4246369972","https://openalex.org/W4244869112"],"abstract_inverted_index":{"This":[0,130],"paper":[1,109],"describes":[2],"a":[3,17,157],"new":[4,166],"method":[5,105,146],"to":[6,53,88,120,149],"compute":[7,150],"isochrones":[8,151],"in":[9,45,64,95,107,153],"multimodal":[10],"spatial":[11],"networks,":[12,38],"which":[13,98],"aims":[14],"at":[15,156],"finding":[16],"good":[18],"trade-off":[19],"between":[20],"memory":[21,83,142],"usage":[22,143],"and":[23,176],"runtime.":[24],"In":[25],"the":[26,39,49,55,70,74,82,90,96,134,141,165],"past,":[27],"approaches":[28,67,172],"based":[29],"on":[30],"Dijkstra's":[31],"algorithm":[32,167],"have":[33,77,87],"been":[34,78],"proposed.":[35,79],"For":[36,57],"small":[37],"entire":[40],"network":[41,50,71],"is":[42,51,147],"first":[43],"loaded":[44],"main":[46,65],"memory,":[47,66],"where":[48],"expanded":[52],"determine":[54],"isochrone.":[56],"large":[58,154],"networks":[59,155],"that":[60,68,164],"do":[61],"not":[62],"fit":[63],"load":[69],"vertex-by-vertex":[72],"during":[73],"expansion":[75],"phase":[76],"They":[80],"keep":[81],"footprint":[84],"minimal,":[85],"but":[86],"query":[89],"database":[91,137],"for":[92],"each":[93],"node":[94],"isochrone,":[97],"can":[99],"be":[100],"very":[101],"time":[102],"consuming.":[103],"The":[104],"presented":[106],"this":[108],"uses":[110],"tiles":[111],"(which":[112],"are":[113],"well":[114],"known":[115],"from":[116],"interactive":[117],"online":[118],"maps)":[119],"realize":[121],"chunk-loading":[122],"of":[123,136],"vertices":[124],"by":[125],"utilizing":[126],"so-called":[127],"tile":[128],"regions.":[129],"approach":[131],"significantly":[132],"reduces":[133],"number":[135],"requests,":[138],"while":[139],"keeping":[140],"low.":[144],"Our":[145],"able":[148],"even":[152],"reasonable":[158],"time.":[159],"An":[160],"experimental":[161],"evaluation":[162],"shows":[163],"clearly":[168],"outperforms":[169],"previous":[170],"competitive":[171],"such":[173],"as":[174],"MINE":[175],"MINEX.":[177]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}