{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:03:23Z","timestamp":1762211003981,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"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-79987-8_39","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"558-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Multistage Matching Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-5550","authenticated-orcid":false,"given":"Markus","family":"Chimani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7412-2770","authenticated-orcid":false,"given":"Niklas","family":"Troost","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-4114","authenticated-orcid":false,"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"39_CR1","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). https:\/\/doi.org\/10.1016\/j.jcss.2019.08.002","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Bampis, E., Escoffier, B., Kononov, A.: LP-based algorithms for multistage minimization problems. arXiv (2019). https:\/\/arxiv.org\/abs\/org\/abs\/1909.10354","key":"39_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bampis, E., Escoffier, B., Lampis, M., Paschos, V.T.: Multistage matchings. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), vol. 101, pp. 7:1\u20137:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2018.7","key":"39_CR3","DOI":"10.4230\/LIPIcs.SWAT.2018.7"},{"doi-asserted-by":"publisher","unstructured":"Bampis, E., Escoffier, B., Schewior, K., Teiller, A.: Online multistage subset maximization problems. In: 27th Annual European Symposium on Algorithms (ESA 2019), vol. 144, pp. 11:1\u201311:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.11","key":"39_CR4","DOI":"10.4230\/LIPIcs.ESA.2019.11"},{"doi-asserted-by":"publisher","unstructured":"Bampis, E., Escoffier, B., Teiller, A.: Multistage knapsack. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), vol. 138, pp. 22:1\u201322:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.22","key":"39_CR5","DOI":"10.4230\/LIPIcs.MFCS.2019.22"},{"key":"39_CR6","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). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.026","journal-title":"Theor. Comput. Sci."},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-662-47672-7_14","volume-title":"Automata, Languages, and Programming","author":"A Bernstein","year":"2015","unstructured":"Bernstein, A., Stein, C.: Fully dynamic matching in bipartite graphs. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 167\u2013179. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_14"},{"issue":"3","key":"39_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/140998925","volume":"47","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Henzinger, M., Italiano, G.F.: Deterministic fully dynamic data structures for vertex cover and matching. SIAM J. Comput. 47(3), 859\u2013887 (2018). https:\/\/doi.org\/10.1137\/140998925","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Bosek, B., Leniowski, D., Sankowski, P., Zych, A.: Online bipartite matching in offline time. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 384\u2013393 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.48","key":"39_CR9","DOI":"10.1109\/FOCS.2014.48"},{"unstructured":"Casteigts, A.: A Journey through Dynamic Networks (with Excursions). Habilitation, Universit\u00e9 de Bordeaux (2018). https:\/\/tel.archives-ouvertes.fr\/tel-01883384","key":"39_CR10"},{"unstructured":"Chimani, M., Troost, N., Wiedera, T.: Approximating multistage matching problems. arXiv (2020). https:\/\/arxiv.org\/abs\/2002.06887","key":"39_CR11"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BFb0028278","volume-title":"Algorithms and Data Structures","author":"D Eppstein","year":"1991","unstructured":"Eppstein, D.: Offline algorithms for dynamic minimum spanning tree problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 392\u2013399. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0028278"},{"doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Niedermeier, R., Rohm, V., Zschoche, P.: Multistage vertex cover. In: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), vol. 148, pp. 14:1\u201314:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.14","key":"39_CR13","DOI":"10.4230\/LIPIcs.IPEC.2019.14"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-43948-7_47","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2014","unstructured":"Gupta, A., Talwar, K., Wieder, U.: Changing bases: multistage optimization for matroids and matchings. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 563\u2013575. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_47"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2021.04.002","volume":"868","author":"K Heeger","year":"2021","unstructured":"Heeger, K., Himmel, A.S., Kammer, F., Niedermeier, R., Renken, M., Sajenko, A.: Multistage graph problems on a global budget. Theor. Comput. Sci. 868, 46\u201364 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.04.002","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 504\u2013513 (2000). https:\/\/doi.org\/10.1145\/335305.335364","key":"39_CR16","DOI":"10.1145\/335305.335364"},{"unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory. American Mathematical Society (1986)","key":"39_CR17"},{"doi-asserted-by":"publisher","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 (STACS 2020), pp. 27:1\u201327:14 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2020.27","key":"39_CR18","DOI":"10.4230\/LIPIcs.STACS.2020.27"},{"key":"39_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-662-44465-8_47","volume-title":"Mathematical Foundations of Computer Science 2014","author":"O Michail","year":"2014","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 553\u2013564. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_47"},{"doi-asserted-by":"publisher","unstructured":"Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization. J. Algorithms. 10, 557\u2013567 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90005-9","key":"39_CR20","DOI":"10.1016\/0196-6774(89)90005-9"},{"unstructured":"Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 118\u2013126 (2007)","key":"39_CR21"},{"doi-asserted-by":"publisher","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 343\u2013350 (2000). https:\/\/doi.org\/10.1145\/335305.335345","key":"39_CR22","DOI":"10.1145\/335305.335345"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:16:01Z","timestamp":1625008561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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":"The workshop 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)"}}]}}