{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:03:16Z","timestamp":1729627396010,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/iscc.2017.8024502","type":"proceedings-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T20:26:54Z","timestamp":1504556814000},"page":"42-47","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic timetable information in smart cities"],"prefix":"10.1109","author":[{"given":"Kalliopi","family":"Giannakopoulou","sequence":"first","affiliation":[]},{"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Paraskevopoulos","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) (SIAM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_7"},{"journal-title":"Transport for London","year":"0","key":"ref10"},{"journal-title":"MOVESMART project","year":"0","key":"ref6"},{"journal-title":"General Transit Feed Specification","year":"0","key":"ref11"},{"journal-title":"HaCon Ingenieurgesellschaft mbH","year":"2008","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227166"},{"journal-title":"ORGANICITY project","year":"0","key":"ref7"},{"key":"ref2","first-page":"46","article-title":"Engineering graph-based models for dynamic timetable information systems","volume":"42","author":"cionini","year":"2014","journal-title":"Algorithmic Approaches for Transportation Modelling Optimization and Systems — ATMOS 2014 OASICS"},{"journal-title":"Transit Feeds","year":"0","key":"ref9"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","article-title":"Route planning in transportation networks","volume":"9220","author":"bast","year":"2016","journal-title":"Algorithm Engineering - Selected Results and Surveys Lecture Notes in Computer Science"}],"event":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2017,7,3]]},"location":"Heraklion, Greece","end":{"date-parts":[[2017,7,6]]}},"container-title":["2017 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8016448\/8024490\/08024502.pdf?arnumber=8024502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T03:51:37Z","timestamp":1570074697000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8024502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iscc.2017.8024502","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}