{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:03Z","timestamp":1743049623227,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_40","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"478-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data Structures for Incremental Interval Coloring"],"prefix":"10.1007","author":[{"given":"J. Girish","family":"Raguvir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manas Jyoti","family":"Kashyop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"40_CR1","unstructured":"Dutot, A., Olivier, D., Guinand, F., Pign, Y.: On the decentralized dynamic graph coloring problem. In: Complex Systems and Self Organization Modelling, pp. 259\u2013261 (2007)"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-62127-2_9","volume-title":"Algorithms and Data Structures","author":"L Barba","year":"2017","unstructured":"Barba, L., et al.: Dynamic graph coloring. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 10389, pp. 97\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_9"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.procs.2017.05.098","volume":"108","author":"Leonid Barenboim","year":"2017","unstructured":"Barenboim, L., Maimon, T.: Fully-dynamic graph algorithms with sublinear time inspired by distributed computing. In: International Conference on Computational Science, ICCS 2017, Zurich, Switzerland, 12\u201314 June 2017, pp. 89\u201398 (2017)","journal-title":"Procedia Computer Science"},{"key":"40_CR4","first-page":"1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Sayan Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Chakrabarty, D., Henzinger, M., Nanongkai, D.: Dynamic algorithms for graph coloring. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 1\u201320 (2018)"},{"key":"40_CR5","first-page":"1","volume":"24","author":"B Hardy","year":"2017","unstructured":"Hardy, B., Lewis, R., Thompson, J.: Tackling the edge dynamic graph coloring problem with and without future adjacency information. J. Heuristics 24, 1\u201323 (2017)","journal-title":"J. Heuristics"},{"key":"40_CR6","first-page":"463","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn, pp. 463\u2013467. The MIT Press, Cambridge (2009). Chapter 17","edition":"3"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11523468_49","volume-title":"Automata, Languages and Programming","author":"L Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 602\u2013613. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_49"},{"key":"40_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D., Saranurak, T.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 21\u201330 (2015)","DOI":"10.1145\/2746539.2746609"},{"issue":"143\u2013153","key":"40_CR10","first-page":"98","volume":"33","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33(143\u2013153), 98 (1981)","journal-title":"Congressus Numerantium"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Williams, R.: Faster online matrix-vector multiplication. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January 2017, pp. 2182\u20132189 (2017)","DOI":"10.1137\/1.9781611974782.142"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-27798-9_36","volume-title":"Computing and Combinatorics","author":"NS Narayanaswamy","year":"2004","unstructured":"Narayanaswamy, N.S.: Dynamic storage allocation and on-line colouring interval graphs. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 329\u2013338. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27798-9_36"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Ouerfelli, L., Bouziri, H.: Greedy algorithm for dynamic graph coloring. In: Communications, Computing and Control Applications, pp. 1\u20135 (2011)","DOI":"10.1109\/CCCA.2011.6031437"},{"key":"40_CR14","unstructured":"Poudel, S., Gokhale, M., Ripeanu, M., Sallinen, S., Iwabuchi, K., Pearce, R.A.: Graph coloring as a challenge problem for dynamic graph processing on distributed systems. In: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 347\u2013358 (2016)"},{"key":"40_CR15","unstructured":"Solomon, S., Wein, N.: Improved dynamic graph coloring. In: 26th Annual European Symposium on Algorithms, ESA 2018, 20\u201322 August 2018, Helsinki, Finland, pp. 72:1\u201372:16 (2018)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:14:23Z","timestamp":1709824463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}