{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:06:26Z","timestamp":1742929586593,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_52","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"651-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Temporal Twins in Time Logarithmic in History Length"],"prefix":"10.1007","author":[{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Hourcade","sequence":"additional","affiliation":[]},{"given":"C\u00e9dric","family":"Miachon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"E Akrida","year":"2020","unstructured":"Akrida, E., Mertzios, G., Spirakis, P., Zamaraev, V.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"52_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BM Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B.M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Godard, E., Santoro, N., Yamashita, M.: Expressivity of time-varying graphs. In: Proceedings of the 19th International Symposium on Fundamentals of Computation Theory, pp. 95\u2013106 (2013)","key":"52_CR3","DOI":"10.1007\/978-3-642-40164-0_12"},{"unstructured":"Dean, B.: Continuous-time dynamic shortest path algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1999)","key":"52_CR4"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274661","volume":"23","author":"J Dibbelt","year":"2018","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithmics 23, 1\u201356 (2018)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"52_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/4197","volume-title":"The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs","author":"A Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs. World Scientific, River Edge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 9134, pp. 444\u2013455 (2015)","key":"52_CR7","DOI":"10.1007\/978-3-662-47672-7_36"},{"issue":"4","key":"52_CR8","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00453-012-9714-7","volume":"68","author":"L Foschini","year":"2014","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica 68(4), 1075\u20131097 (2014)","journal-title":"Algorithmica"},{"issue":"1","key":"52_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"52_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: an interesting algorithmic tool kit. Int. J. Found. Comput. Sci. 10(2), 147\u2013170 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"52_CR11","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Klimt, B., Yang, Y.: Introducing the enron corpus. In: CEAS (2004)","key":"52_CR12"},{"issue":"61","key":"52_CR13","first-page":"611","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for themodeling of interactions over time. Soc. Netw. Anal. Min. 8(61), 611\u20136129 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"52_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TMC.2010.253","volume":"11","author":"F Ros","year":"2012","unstructured":"Ros, F., Ruiz, P., Stojmenovic, I.: Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Trans. Mob. Comput. 11(1), 33\u201346 (2012)","journal-title":"IEEE Trans. Mob. Comput."},{"doi-asserted-by":"crossref","unstructured":"Spinrad, J.: Efficient Graph Representations. Field Institute Monographs, vol.\u00a019. American Mathematical Society (2003)","key":"52_CR15","DOI":"10.1090\/fim\/019"},{"doi-asserted-by":"crossref","unstructured":"Tournoux, P.U., Leguay, J., Benbadis, F., Conan, V., De\u00a0Amorim, M.D., Whitbeck, J.: The Accordion phenomenon: analysis, characterization, and impact on DTN routing. In: Proceedings of the 28th IEEE Conference on Computer Communications (2009)","key":"52_CR16","DOI":"10.1109\/INFCOM.2009.5062024"},{"key":"52_CR17","first-page":"1","volume":"9","author":"I Tsalouchidou","year":"2019","unstructured":"Tsalouchidou, I., Baeza-Yates, R., Bonchi, F., Liao, K., Sellis, T.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Analytics 9, 1\u201316 (2019)","journal-title":"Int. J. Data Sci. Analytics"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ipl.2018.01.006","volume":"133","author":"T Viard","year":"2018","unstructured":"Viard, T., Magnien, C., Latapy, M.: Enumerating maximal cliques in link streams with durations. Inf. Proc. Lett. 133, 44\u201348 (2018)","journal-title":"Inf. Proc. Lett."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T07:05:43Z","timestamp":1609830343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_52","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","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"}}]}}