{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:04:56Z","timestamp":1779602696649,"version":"3.53.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-26465-7_2","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:48:44Z","timestamp":1779601724000},"page":"21-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maintaining Bipartite Colourings on\u00a0Temporal Graphs on\u00a0a\u00a0Budget"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3343-2435","authenticated-orcid":false,"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7182-585X","authenticated-orcid":false,"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Adamson, D.: Harmonious colourings of temporal matchings. Theoret. Comput. Sci., 115437 (2025)","DOI":"10.1016\/j.tcs.2025.115437"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: $${O}(\\sqrt{ \\log (n)})$$ approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp. 339\u2013348. IEEE (2005)","DOI":"10.1109\/SFCS.2005.35"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Kale, S.: A combinatorial, primal-dual approach to semidefinite programs. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 227\u2013236 (2007)","DOI":"10.1145\/1250790.1250823"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Barba, L., et al.: Dynamic graph coloring. In: Workshop on Algorithms and Data Structures, pp. 97\u2013108. Springer (2017)","DOI":"10.1007\/978-3-319-62127-2_9"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2478\/v10209-011-0012-y","volume":"37","author":"P Formanowicz","year":"2012","unstructured":"Formanowicz, P., Tana\u015b, K.: A survey of graph coloring - its types, methods and applications. Found. Comput. Decis. Sci. 37(3), 223 (2012)","journal-title":"Found. Comput. Decis. Sci."},{"key":"2_CR7","unstructured":"Fuchs, M., Kuhn, F.: Distributed $$(\\delta + 1)$$-coloring in graphs of bounded neighborhood independence. arXiv preprint arXiv:2510.21549 (2025)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F.: Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1009\u20131020. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00101"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Kuhn, F., Nolin, A., Tonoyan, T.: Near-optimal distributed degree+1 coloring. In: Leonardi, S., Gupta, A. (eds.) STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, 20\u201424 June 2022, pp. 450\u2013463. ACM (2022)","DOI":"10.1145\/3519935.3520023"},{"key":"2_CR10","unstructured":"Ibiapina, A., Nguyen, M.H., Rabie, M., Robin, C.: How to color temporal graphs to ensure proper transitions. arXiv preprint arXiv:2505.10207 (2025)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Lewis, R.: Guide to Graph Colouring. Springer (2021)","DOI":"10.1007\/978-3-030-81054-2"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2021.08.004","volume":"123","author":"A Marino","year":"2022","unstructured":"Marino, A., Silva, A.: Coloring temporal graphs. J. Comput. Syst. Sci. 123, 171\u2013185 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Matula, D.W., Marble, G., Isaacson, J.D.: Graph coloring algorithms. In: Graph Theory and Computing, pp. 109\u2013122. Elsevier (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Molter, H., Zamaraev, V.: Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120, 97\u2013115 (2021)","DOI":"10.1016\/j.jcss.2021.03.005"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Yu, F., Bar-Noy, A., Basu, P., Ramanathan, R.: Algorithms for channel assignment in mobile wireless networks using temporal coloring. In: Proceedings of the 16th ACM International Conference on Modeling, Analysis & Simulation of Wireless and Mobile Systems, pp. 49\u201358 (2013)","DOI":"10.1145\/2507924.2507965"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:48:46Z","timestamp":1779601726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}