{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:37:41Z","timestamp":1755599861093,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"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-38906-1_8","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"106-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dominator Coloring and\u00a0CD Coloring in\u00a0Almost Cluster Graphs"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prahlad Narasimhan","family":"Kasthurirangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25011-8_2","volume-title":"Combinatorial Algorithms","author":"S Arumugam","year":"2011","unstructured":"Arumugam, S., Chandrasekar, K.R., Misra, N., Philip, G., Saurabh, S.: Algorithmic aspects of dominator colorings in graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 19\u201330. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25011-8_2"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2017.06.013","volume":"230","author":"G Bagan","year":"2017","unstructured":"Bagan, G., Merouane, H.B., Haddad, M., Kheddouci, H.: On some domination colorings of graphs. Discret. Appl. Math. 230, 34\u201350 (2017)","journal-title":"Discret. Appl. Math."},{"key":"8_CR3","unstructured":"Dominator coloring and CD coloring in almost cluster graphs. arXiv arXiv:2210.17321 (2023)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, M., Hujter, M., Tuza, Z.: Precoloring extension. i. interval graphs. Discret. Math. 100(1-3), 267\u2013279 (1992)","DOI":"10.1016\/0012-365X(92)90646-W"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"52","key":"8_CR6","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: Going weighted: parameterized algorithms for cluster editing. Theor. Comput. Sci. 410(52), 5467\u20135480 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00373-010-1012-z","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Maffray, F.: Dominator colorings in some classes of graphs. Graphs Comb. 28(1), 97\u2013107 (2012)","journal-title":"Graphs Comb."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.7151\/dmgt.1635","volume":"32","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Merouane, H.B.: On the dominator colorings in trees. Discuss. Math. Graph Theory 32(4), 677\u2013683 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00373-016-1742-7","volume":"33","author":"Q Chen","year":"2017","unstructured":"Chen, Q., Zhao, C., Zhao, M.: Dominator colorings of certain cartesian products of paths and cycles. Graphs Comb. 33, 73\u201383 (2017)","journal-title":"Graphs Comb."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-09153-2_10","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"YH Chen","year":"2014","unstructured":"Chen, Y.H.: The dominated coloring problem and its application. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8584, pp. 132\u2013145. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09153-2_10"},{"issue":"1 &2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109(1 &2), 49\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"8_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"8_CR15","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_32"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M.P., Rosamond, F.A.: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3), 541\u2013566 (2013)","journal-title":"Eur. J. Comb."},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"issue":"7","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci. 80(7), 1430\u20131447 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR20","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci. 17 (2015)","DOI":"10.46298\/dmtcs.2136"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Gera, R.: On the dominator colorings in bipartite graphs (2007)","DOI":"10.1109\/ITNG.2007.142"},{"key":"8_CR23","first-page":"19","volume":"181","author":"R Gera","year":"2006","unstructured":"Gera, R., Rasmussen, C., Horton, S.: Dominator colorings and safe clique partitions. Congr. Numer. 181, 19\u201332 (2006)","journal-title":"Congr. Numer."},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-90530-3_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Goyal","year":"2018","unstructured":"Goyal, D., Jacob, A., Kumar, K., Majumdar, D., Raman, V.: Structural parameterizations of\u00a0dominating set variants. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 157\u2013168. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_14"},{"issue":"8\u201310","key":"8_CR25","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8\u201310), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/20M1323369","volume":"35","author":"GZ Gutin","year":"2021","unstructured":"Gutin, G.Z., Majumdar, D., Ordyniak, S., Wahlstr\u00f6m, M.: Parameterized pre-coloring extension and list coloring problems. SIAM J. Discret. Math. 35(1), 575\u2013596 (2021)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"8_CR27","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1007\/s00373-014-1425-1","volume":"31","author":"MA Henning","year":"2015","unstructured":"Henning, M.A.: Total dominator colorings and total domination in graphs. Graphs Comb. 31(4), 953\u2013974 (2015)","journal-title":"Graphs Comb."},{"issue":"1","key":"8_CR28","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theory Comput. Syst."},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ic.2013.08.005","volume":"231","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. Inf. Comput. 231, 70\u201388 (2013)","journal-title":"Inf. Comput."},{"key":"8_CR30","first-page":"125647","volume":"390","author":"S Klavzar","year":"2021","unstructured":"Klavzar, S., Tavakoli, M.: Dominated and dominator colorings over (edge) corona and hierarchical products. Appl. Math. Comput. 390, 125647 (2021)","journal-title":"Appl. Math. Comput."},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.dam.2020.12.015","volume":"291","author":"R Krithika","year":"2021","unstructured":"Krithika, R., Rai, A., Saurabh, S., Tale, P.: Parameterized and exact algorithms for class domination coloring. Discrete Appl. Math. 291, 86\u2013299 (2021)","journal-title":"Discrete Appl. Math."},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-59605-1_19","volume-title":"Frontiers in Algorithmics","author":"D Majumdar","year":"2017","unstructured":"Majumdar, D., Raman, V.: FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters. In: Xiao, M., Rosamond, F. (eds.) FAW 2017. LNCS, vol. 10336, pp. 209\u2013220. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59605-1_19"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10878-013-9631-y","volume":"30","author":"HB Merouane","year":"2015","unstructured":"Merouane, H.B., Chellali, M.: An algorithm for the dominator chromatic number of a tree. J. Comb. Optim. 30, 27\u201333 (2015)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"8_CR34","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00373-014-1407-3","volume":"31","author":"HB Merouane","year":"2015","unstructured":"Merouane, H.B., Haddad, M., Chellali, M., Kheddouci, H.: Dominated colorings of graphs. Graphs Comb. 31(3), 713\u2013727 (2015)","journal-title":"Graphs Comb."},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"1550043","DOI":"10.1142\/S1793830915500433","volume":"7","author":"BS Panda","year":"2015","unstructured":"Panda, B.S., Pandey, A.: On the dominator coloring in proper interval graphs and block graphs. Discrete Math. Algorithms Appl. 7, 1550043 (2015)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"4","key":"8_CR36","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:06:03Z","timestamp":1690473963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_8","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":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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.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":"10","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)"}}]}}