{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T05:41:54Z","timestamp":1761716514892},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","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-36683-4_40","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:08:15Z","timestamp":1574806095000},"page":"494-506","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints"],"prefix":"10.1007","author":[{"given":"Anne-Sophie","family":"Himmel","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Bentert","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"key":"40_CR1","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. In: Algorithm Engineering, pp. 19\u201380. Springer (2016)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"40_CR3","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: The computational complexity of finding temporal paths under waiting time constraints. arXiv preprint \narXiv:1909.06437\n\n (2019)"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"BC Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44, 41\u201346 (2004)","journal-title":"Networks"},{"issue":"2","key":"40_CR5","doi-asserted-by":"publisher","first-page":"022305","DOI":"10.1103\/PhysRevE.94.022305","volume":"94","author":"P Holme","year":"2016","unstructured":"Holme, P.: Temporal network structures controlling disease spreading. Phys. Rev. E 94(2), 022305 (2016)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"40_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"12357","DOI":"10.1038\/s41598-018-29577-2","volume":"8","author":"M Kivel\u00e4","year":"2018","unstructured":"Kivel\u00e4, M., Cambe, J., Saram\u00e4ki, J., Karsai, M.: Mapping temporal-network percolation to weighted, static event graphs. Sci. Rep. 8(1), 12357 (2018)","journal-title":"Sci. Rep."},{"key":"40_CR8","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. \nhttp:\/\/snap.stanford.edu\/data\n\n (2014)"},{"key":"40_CR9","unstructured":"Lightenberg, W., Pei, Y., Fletcher, G., Pechenizkiy, M.: Tink: a temporal graph analytics library for Apache Flink. In: Proceedings of WWW 2018, pp. 71\u201372. International World Wide Web Conferences Steering Committee (2018)"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.12703\/P5-6","volume":"5","author":"N Masuda","year":"2013","unstructured":"Masuda, N., Holme, P.: Predicting and controlling infectious disease epidemics using temporal networks. F1000prime Rep. 5, 6 (2013)","journal-title":"F1000prime Rep."},{"key":"40_CR11","unstructured":"Modiri, A.B., Karsai, M., Kivel\u00e4, M.: Efficient limited time reachability estimation in temporal networks. arXiv preprint \narXiv:1908.11831\n\n (2019)"},{"key":"40_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"MEJ Newman","year":"2018","unstructured":"Newman, M.E.J.: Networks. Oxford University Press, Oxford (2018)"},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"016105","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"RK Pan","year":"2011","unstructured":"Pan, R.K., Saram\u00e4ki, J.: Path lengths, correlations, and centrality in temporal networks. Phys. Rev. E 84(1), 016105 (2011)","journal-title":"Phys. Rev. E"},{"issue":"51","key":"40_CR14","doi-asserted-by":"publisher","first-page":"22020","DOI":"10.1073\/pnas.1009094108","volume":"107","author":"M Salath\u00e9","year":"2010","unstructured":"Salath\u00e9, M., Kazandjieva, M., Lee, J.W., Levis, P., Feldman, M.W., Jones, J.H.: A high-resolution human contact network for infectious disease transmission. Proc. Nat. Acad. Sci. 107(51), 22020\u201322025 (2010)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"11","key":"40_CR15","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","volume":"28","author":"H Wu","year":"2016","unstructured":"Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927\u20132942 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"02","key":"40_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(02), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, A., Liu, G., Zheng, B., Zhao, Y., Zheng, K.: Temporal paths discovery with multiple constraints in attributed dynamic graphs. World Wide Web, 1\u201324 (2019)","DOI":"10.1007\/s11280-019-00670-4"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:14:10Z","timestamp":1574806450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_40","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}