{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:40:01Z","timestamp":1749422401483,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030505776"},{"type":"electronic","value":"9783030505783"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50578-3_21","type":"book-chapter","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T08:02:39Z","timestamp":1591689759000},"page":"305-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Geospatial Partitioning of Open Transit Data"],"prefix":"10.1007","author":[{"given":"Harm","family":"Delva","sequence":"first","affiliation":[]},{"given":"Juli\u00e1n Andr\u00e9s","family":"Rojas","sequence":"additional","affiliation":[]},{"given":"Pieter-Jan","family":"Vandenberghe","sequence":"additional","affiliation":[]},{"given":"Pieter","family":"Colpaert","sequence":"additional","affiliation":[]},{"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,10]]},"reference":[{"key":"21_CR1","unstructured":"Antrim, A., Barbeau, S.J., et al.: The many uses of GTFS data\u2013opening the door to transit and multimodal applications 4 (2013). Location-Aware Information Systems Laboratory at the University of South Florida"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams\u2013a survey of a fundamental geometric data structure. ACM Comput. Surv. (CSUR) 23(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-15775-2_25","volume-title":"Algorithms \u2013 ESA 2010","author":"H Bast","year":"2010","unstructured":"Bast, H., et al.: Fast routing in very large public transportation networks using transfer patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 290\u2013301. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_25"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bast, H., Hertel, M., Storandt, S.: Scalable transfer patterns. In: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 15\u201329. SIAM (2016)","DOI":"10.1137\/1.9781611974317.2"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.20382","volume":"57","author":"R Bauer","year":"2011","unstructured":"Bauer, R., Delling, D., Wagner, D.: Experimental study of speed up techniques for timetable information systems. Networks 57(1), 38\u201352 (2011)","journal-title":"Networks"},{"key":"21_CR6","unstructured":"Berger, A., Delling, D., Gebhardt, A., M\u00fcller-Hannemann, M.: Accelerating time-dependent multi-criteria timetable information is harder than expected. In: 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2009). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"key":"21_CR7","unstructured":"Berners-Lee, T.: Linked data-design issues (2006). http:\/\/www.w3.org\/DesignIssues\/LinkedData.html"},{"key":"21_CR8","unstructured":"Colpaert, P., Llaves, A., Verborgh, R., Corcho, O., Mannens, E., Van de Walle, R.: Intermodal public transit routing using liked connections. In: International Semantic Web Conference: Posters and Demos, pp. 1\u20135 (2015)"},{"key":"21_CR9","unstructured":"European Commission: mobile broadband prices in Europe 2019 (2019). http:\/\/www.w3.org\/DesignIssues\/LinkedData.html"},{"key":"21_CR10","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Z\u00fcndorf, T.: Faster transit routing by hyper partitioning. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: 2011 IEEE International Parallel & Distributed Processing Symposium, pp. 1135\u20131146. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm (2017)","DOI":"10.1145\/3274661"},{"key":"21_CR13","unstructured":"Flanders: population: size and growth (2019). https:\/\/www.statistiekvlaanderen.be\/en\/population-size-and-growth-0"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"key":"21_CR15","unstructured":"Hofmann, H., Kafadar, K., Wickham, H.: Letter-value plots: boxplots for large data. Technical report, had.co.nz (2011)"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-11964-9_12","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"R Verborgh","year":"2014","unstructured":"Verborgh, R., et al.: Querying datasets on the web with high availability. In: MikaMika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 180\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_12"}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50578-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:02:17Z","timestamp":1749420137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50578-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030505776","9783030505783"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50578-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icwe2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icwe2020.webengineering.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition there are 4 PhD and 7 Demo papers. The conference was held virtually due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}