{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:07:29Z","timestamp":1768590449705,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067050","type":"print"},{"value":"9783032067067","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06706-7_1","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:49:21Z","timestamp":1759276161000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interval-Constrained Bipartite Matching over\u00a0Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5997-6636","authenticated-orcid":false,"given":"Andreas","family":"Abels","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8364-0446","authenticated-orcid":false,"given":"Mariia","family":"Anapolska","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3394-2788","authenticated-orcid":false,"given":"Christina","family":"B\u00fcsing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abels, A., Anapolska, M., B\u00fcsing, C.: Interval-constrained bipartite matching over time (2025). https:\/\/arxiv.org\/abs\/2402.18469","DOI":"10.1007\/978-3-032-06706-7_1"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1007\/s10878-020-00641-w","volume":"40","author":"S Angelopoulos","year":"2020","unstructured":"Angelopoulos, S., D\u00fcrr, C., Jin, S.: Online maximum matching with recourse. J. Comb. Optim. 40(4), 974\u20131007 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00641-w","journal-title":"J. Comb. Optim."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. In: 15th Real-Time Systems Symposium, RTSS, pp. 228\u2013236 (1994)","DOI":"10.1109\/REAL.1994.342713"},{"key":"1_CR4","unstructured":"Bernstein, A., Dudeja, A.: Online matching with recourse: random edge arrivals. In: 40th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 11:1\u201311:16 (2020)"},{"issue":"5","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3344999","volume":"66","author":"A Bernstein","year":"2019","unstructured":"Bernstein, A., Holm, J., Rotenberg, E.: Online bipartite matching with amortized O (log$$^{2}$$n) replacements. J. ACM 66(5), 1\u201323 (2019)","journal-title":"J. ACM"},{"key":"1_CR6","unstructured":"Bernstein, A., Kopelowitz, T., Pettie, S., Porat, E., Stein, C.: Simultaneously load balancing for every p-norm, with reassignments. In: 8th Innovations in Theoretical Computer Science Conference, ITCS, vol.\u00a067, pp. 51:1\u201351:14 (2017)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"BE Birnbaum","year":"2008","unstructured":"Birnbaum, B.E., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bosek, B., Leniowski, D., Sankowski, P., Zych, A.: Online bipartite matching in offline time. In: 55th Annual Symposium on Foundations of Computer Science, FOCS, pp. 384\u2013393 (2014)","DOI":"10.1109\/FOCS.2014.48"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2021.11.025","volume":"901","author":"B Bosek","year":"2022","unstructured":"Bosek, B., Leniowski, D., Sankowski, P., Zych-Pawlewicz, A.: A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901, 45\u201361 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Daskalakis, C., Kleinberg, R.D., Lin, H.: Online bipartite perfect matching with augmentations. In: 28th International Conference on Computer Communications, INFOCOM. pp. 1044\u20131052 (2009)","DOI":"10.1109\/INFCOM.2009.5062016"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: randomization and restarts help. SIAM J. Comput. 36(6), 1709\u20131728 (2007)","journal-title":"SIAM J. Comput."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Kleinberg, R.D.: Randomized primal-dual analysis of RANKING for online bipartite matching. In: 24th Annual Symposium on Discrete Algorithms, SODA, pp. 101\u2013107 (2013)","DOI":"10.1137\/1.9781611973105.7"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(83)90117-5","volume":"16","author":"GN Frederickson","year":"1983","unstructured":"Frederickson, G.N.: Scheduling unit-time tasks with integer release times and deadlines. Inf. Process. Lett. 16(4), 171\u2013173 (1983)","journal-title":"Inf. Process. Lett."},{"key":"1_CR14","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: 19th Annual Symposium on Discrete Algorithms, SODA, pp. 982\u2013991 (2008)"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Online perfect matching and mobile computing. In: Akl, S.G., Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 194\u2013205. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60220-8_62","DOI":"10.1007\/3-540-60220-8_62"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Stein, C.: Maintaining assignments online: matching, scheduling, and flows. In: 25th Annual Symposium on Discrete Algorithms, SODA, pp. 468\u2013479 (2014)","DOI":"10.1137\/1.9781611973402.35"},{"key":"1_CR17","unstructured":"Gupta, V., Krishnaswamy, R., Sandeep, S.: Permutation strikes back: the power of recourse in online metric matching. In: Approximation, Randomization, and Combinatorial Optimization, APPROX\/RANDOM.,pp. 40:1\u201340:20 (2020)"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n$$ ^{{5\/2}}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: 22nd Annual Symposium on Theory of Computing, STOC, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"1_CR20","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. AC, vol. 21. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-56039-6"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Liu, A.H., Toole-Charignon, J.: The power of amortized recourse for online graph problems. In: In: Chalermsook, P., Laekhanukit, B. (eds) Approximation and Online Algorithms. WAOA 2022. LNCS, vol. 13538. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18367-6_7","DOI":"10.1007\/978-3-031-18367-6_7"},{"key":"1_CR22","unstructured":"Megow, N., N\u00f6lke, L.: Online minimum cost matching with recourse on the line. In: Approximation, Randomization, and Combinatorial Optimization, APPROX\/RANDOM, pp. 37:1\u201337:16 (2020)"},{"key":"1_CR23","unstructured":"Shin, Y., Kim, K., Lee, S., An, H.: Online graph matching problems with a worst-case reassignment budget. CoRR abs\/ arXiv: 2003.05175 (2020)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0020-0190(93)90241-Z","volume":"47","author":"G Steiner","year":"1993","unstructured":"Steiner, G., Yeomans, S.: A note on \u201cscheduling unit-time tasks with integer release times and deadlines\u2019\u2019. Inf. Process. Lett. 47, 165\u2013166 (1993)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06706-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:07:21Z","timestamp":1768547241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06706-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032067050","9783032067067"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06706-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}