{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:27:22Z","timestamp":1748492842804,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_9","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"112-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Coloring on\u00a0Restricted Graph Classes"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[]},{"given":"Swati","family":"Kumari","sequence":"additional","affiliation":[]},{"given":"I. Vinod","family":"Reddy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"issue":"15","key":"9_CR1","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1016\/j.dam.2012.05.017","volume":"160","author":"M Alishahi","year":"2012","unstructured":"Alishahi, M.: Dynamic chromatic number of regular graphs. Discret. Appl. Math. 160(15), 2098\u20132103 (2012)","journal-title":"Discret. Appl. Math."},{"key":"9_CR2","first-page":"273","volume":"67","author":"A Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67, 273\u2013281 (2003)","journal-title":"Ars Comb."},{"issue":"7\u20138","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.dam.2012.01.012","volume":"160","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Fan, S., Lai, H.-J., Song, H., Sun, L.: On dynamic coloring for planar graphs and graphs of higher genus. Discret. Appl. Math. 160(7\u20138), 1064\u20131071 (2012)","journal-title":"Discret. Appl. Math."},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 4. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"9_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/13090465X","volume":"28","author":"JA Enright","year":"2014","unstructured":"Enright, J.A., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discret. Math. 28(4), 1675\u20131685 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2016.01.016","volume":"206","author":"S Jahanbekam","year":"2016","unstructured":"Jahanbekam, S., Kim, J., Suil, O., West, D.B.: On r-dynamic coloring of graphs. Discrete Appl. Math. 206, 65\u201372 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"13","key":"9_CR10","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1016\/j.dam.2013.03.005","volume":"161","author":"SJ Kim","year":"2013","unstructured":"Kim, S.J., Lee, S.J., Park, W.J.: Dynamic coloring and list dynamic coloring of planar graphs. Discrete Appl. Math. 161(13), 2207\u20132212 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.aml.2008.04.003","volume":"22","author":"X Li","year":"2009","unstructured":"Li, X., Yao, X., Zhou, W., Broersma, H.: Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3), 320\u2013324 (2009)","journal-title":"Appl. Math. Lett."},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.33915\/etd.1397","volume-title":"Dynamic Coloring of Graphs","author":"B Montgomery","year":"2001","unstructured":"Montgomery, B.: Dynamic Coloring of Graphs. West Virginia University, Morgantown (2001)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR16","first-page":"249","volume":"26","author":"S Saqaeeyan","year":"2016","unstructured":"Saqaeeyan, S., Mollaahamdi, E.: Dynamic chromatic number of bipartite graphs. Sci. Ann. Comput. Sci. 26(2), 249 (2016)","journal-title":"Sci. Ann. Comput. Sci."}],"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-031-30448-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:03:44Z","timestamp":1684191824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","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":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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":"6","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":"3 invited papers","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)"}}]}}