{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:46:19Z","timestamp":1770072379728,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030752415","type":"print"},{"value":"9783030752422","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-75242-2_28","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"394-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Temporal Matching on Geometric Graph Data"],"prefix":"10.1007","author":[{"given":"Timothe","family":"Picavet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ngoc-Trung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"key":"28_CR1","unstructured":"XP. http:\/\/www.extremeprogramming.org"},{"key":"28_CR2","unstructured":"Airbus Industrie. Fello\u2019fly demonstrator. Dubai Airshow (2019)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"EC Akrida","year":"2020","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Zamaraev, V.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR4","unstructured":"Baste, J., Bui-Xuan, B.-M.: Temporal matching in link stream: kernel and approximation. In: 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2018)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2019.03.026","volume":"806","author":"J Baste","year":"2020","unstructured":"Baste, J., Bui-Xuan, B.-M., Roux, A.: Temporal matching. Theor. Comput. Sci. 806, 184\u2013196 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B-M 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."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Godard, E., Santoro, N., Yamashita, M.: Expressivity of time-varying graphs. In: 19th International Symposium on Fundamentals of Computation Theory, pp. 95\u2013106 (2013)","DOI":"10.1007\/978-3-642-40164-0_12"},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2736283","volume":"62","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Gabow, H.N., Sankowski, P.: Algorithmic applications of Baur-Strassen\u2019s theorem Shortest cycles, diameter, and matchings. J. ACM. 62(4), 28:1\u201328:30 (2015)","journal-title":"J. ACM."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Experimental Algorithmics 23 (2018)","DOI":"10.1145\/3274661"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. In: Downey, R.G. (ed.) Monographs in Computer Science. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Dufoss\u00e9, F., Kaya, K., Panagiotas, I., U\u00e7ar, B.: Approximation algorithms for maximum matchings in undirected graphs. In: SIAM Workshop on Combinatorial Scientific Computing (2018)","DOI":"10.1137\/1.9781611975215.6"},{"key":"28_CR12","unstructured":"D\u00fcrr, C., Konrad, C., Renault, M.P.: On the power of advice and randomization for online bipartite matching. In: 24th Annual European Symposium on Algorithms, LIPIcs, vol. 57, pp. 37:1\u201337:16 (2016)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-47672-7_36","volume-title":"Automata, Languages, and Programming","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 444\u2013455. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_36"},{"issue":"4","key":"28_CR15","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":"4","key":"28_CR16","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."},{"key":"28_CR17","unstructured":"Klimt, B., Yang, Y.: Introducing the enron corpus. In: CEAS (2004)"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Network Anal. Min. 8(1), 1\u201329 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0537-7","journal-title":"Soc. Network Anal. Min."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"28_CR20","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. In: 37th International Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 154, pp. 27:1\u201327:14 (2020)"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2018.04.004","volume":"97","author":"GB Mertzios","year":"2018","unstructured":"Mertzios, G.B., Spirakis, P.G.: Strong bounds for evolution in networks. J. Comput. Syst. Sci. 97, 60\u201382 (2018)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"28_CR22","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.ipl.2014.06.013","volume":"114","author":"S Miyazaki","year":"2014","unstructured":"Miyazaki, S.: On the advice complexity of online bipartite matching and online stable marriage. Inf. Process. Lett. 114(12), 714\u2013717 (2014)","journal-title":"Inf. Process. Lett."},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 248\u2013255 (2004)","DOI":"10.1007\/978-3-540-30140-0_48"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"28_CR25","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1), 39\u201361 (1983)"},{"issue":"1","key":"28_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TMC.2010.253","volume":"11","author":"FJ Ros","year":"2012","unstructured":"Ros, F.J., Ruiz, P.M., Stojmenovic, I.: Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Trans. Mobile Comput. 11(1), 33\u201346 (2012)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Tournoux, P.-U., Leguay, J., Benbadis, F., Conan, V., De Amorim, M.D., Whitbeck, J.: The accordion phenomenon: analysis, characterization, and impact on DTN routing. In: 28th IEEE Conference on Computer Communications (2009)","DOI":"10.1109\/INFCOM.2009.5062024"},{"issue":"3","key":"28_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","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. Anal. 9(3), 257\u2013272 (2019). https:\/\/doi.org\/10.1007\/s41060-019-00189-x","journal-title":"Int. J. Data Sci. Anal."},{"key":"28_CR29","unstructured":"van Leeuwen, E.J.: Optimization and Approximation on Systems of Geometric Objects. PhD thesis, Utrecht University (2009)"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1007\/978-3-662-47672-7_87","volume-title":"Automata, Languages, and Programming","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Wong, S.C.: Two-sided online bipartite matching and vertex cover: beating the greedy algorithm. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 1070\u20131081. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_87"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"W\u00f8hlk, S., Laporte, G.: Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Comput. Oper. Res. 87(C), 107\u2013113 (2017)","DOI":"10.1016\/j.cor.2017.06.006"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T04:47:09Z","timestamp":1724993229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"27","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":"0","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":"35% - 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","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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}