{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:02Z","timestamp":1742912762698,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_3","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:50Z","timestamp":1738706210000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of\u00a0Coupon Coloring of\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradyun","family":"Devarakonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiven","family":"Phogat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swaroop A. Ram","family":"Rayala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Sherin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1002\/jgt.21898","volume":"82","author":"W Abbas","year":"2016","unstructured":"Abbas, W., Egerstedt, M., Liu, C.-H., Thomas, R., Whalen, P.: Deploying robots with two sensors in $$k_{1,6}$$ -free graphs. J. Graph Theory 82(3), 236\u2013252 (2016). https:\/\/doi.org\/10.1002\/jgt.21898","journal-title":"J. Graph Theory"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.dam.2024.03.012","volume":"351","author":"S Akbari","year":"2024","unstructured":"Akbari, S., Azimian, M., Fazli Khani, A., Samimi, B., Zahiri, E.: 2-coupon coloring of cubic graphs containing 3-cycle or 4-cycle. Discrete Appl. Math. 351, 105\u2013110 (2024). https:\/\/doi.org\/10.1016\/j.dam.2024.03.012","journal-title":"Discrete Appl. Math."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.7151\/dmgt.1996","volume":"38","author":"S Akbari","year":"2015","unstructured":"Akbari, S., Motiei, M., Mozaffari, S., Yazdanbod, S.: Cubic graphs with total domatic number at least two. Discussiones Mathematicae Graph Theory 38, 75\u201382 (2015)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Aram, H., Sheikholeslami, S.M., Volkmann, L.: On the total domatic number of regular graphs. Trans. Comb. 1(1), 45\u201351 (2012). https:\/\/doi.org\/10.22108\/toc.2012.760. ISSN 2251\u20138657","DOI":"10.22108\/toc.2012.760"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.dam.2021.12.026","volume":"319","author":"P Ashok","year":"2022","unstructured":"Ashok, P., Bhargava, R., Gupta, N., Khalid, M., Yadav, D.: Structural parameterization for minimum conflict-free colouring. Discret. Appl. Math. 319, 239\u2013253 (2022). https:\/\/doi.org\/10.1016\/j.dam.2021.12.026","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"3_CR6","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The l (h, k)-labelling problem: a survey and annotated bibliography. Comput. J. 49(5), 585\u2013608 (2006). https:\/\/doi.org\/10.1093\/comjnl\/bxl018","journal-title":"Comput. J."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2015.04.026","volume":"193","author":"B Chen","year":"2015","unstructured":"Chen, B., Kim, J.H., Tait, M., Verstraete, J.: On coupon colorings of graphs. Discrete Appl. Math. 193, 94\u2013101 (2015). https:\/\/doi.org\/10.1016\/j.dam.2015.04.026","journal-title":"Discrete Appl. Math."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.amc.2017.03.023","volume":"308","author":"H Chen","year":"2017","unstructured":"Chen, H., Jin, Z.: Coupon coloring of cographs. Appl. Math. Comput. 308, 90\u201395 (2017). https:\/\/doi.org\/10.1016\/j.amc.2017.03.023","journal-title":"Appl. Math. Comput."},{"key":"3_CR9","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, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.3190160307","volume":"16","author":"Q Donner","year":"1992","unstructured":"Donner, Q.: On the number of list-colorings. J. Graph Theory 16(3), 239\u2013245 (1992). https:\/\/doi.org\/10.1002\/jgt.3190160307","journal-title":"J. Graph Theory"},{"key":"3_CR11","first-page":"257","volume":"33","author":"J Dunbar","year":"2000","unstructured":"Dunbar, J., et al.: Fall colorings of graphs. J. Comb. Math. Comb. Comput. 33, 257\u2013273 (2000)","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"1","key":"3_CR12","first-page":"5","volume":"11","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P.: On a combinatorial problem. Nordisk Matematisk Tidskrift 11(1), 5\u201310 (1963). ISSN 00291412","journal-title":"Nordisk Matematisk Tidskrift"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G Even","year":"2003","unstructured":"Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33(1), 94\u2013136 (2003)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-67899-9_25","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Francis","year":"2021","unstructured":"Francis, P., Rajendraprasad, D.: On coupon coloring of cartesian product of some graphs. In: Mudgal, A., Subramanian, C.R. (eds.) CALDAM 2021. LNCS, vol. 12601, pp. 309\u2013316. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67899-9_25"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Ganian, R: Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci. 17(Discrete Algorithms) (2015)","DOI":"10.46298\/dmtcs.2136"},{"key":"3_CR16","unstructured":"Goddard, W., Henning, M.A.: Thoroughly distributed colorings. arXiv preprint arXiv:1609.09684 (2016). https:\/\/arxiv.org\/pdf\/1609.09684"},{"issue":"2","key":"3_CR17","first-page":"128","volume":"5","author":"P Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5(2), 128\u2013142 (1998). ISSN 1236-6064","journal-title":"Nordic J. Comput."},{"issue":"7","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1016\/j.ejc.2013.04.005","volume":"34","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: 2-colorings in k-regular k-uniform hypergraphs. Eur. J. Combinatorics 34(7), 1192\u20131202 (2013)","journal-title":"Eur. J. Combinatorics"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"3_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"RW Irving","year":"1999","unstructured":"Irving, R.W., Manlove, D.F.: The b-chromatic number of a graph. Discrete Appl. Math. 91(1\u20133), 127\u2013141 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1287\/moor.2022.1308","volume":"48","author":"K Jansen","year":"2023","unstructured":"Jansen, K., Rohwedder, L.: On integer programming, discrepancy, and convolution. Math. Oper. Res. 48(3), 1481\u20131495 (2023)","journal-title":"Math. Oper. Res."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2018.04.006","volume":"818","author":"M Koivisto","year":"2020","unstructured":"Koivisto, M., Laakkonen, P., Lauri, J.: Np-completeness results for partitioning a graph into total dominating sets. Theoret. Comput. Sci. 818, 22\u201331 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Kouteck\u00fd, M.: A note on coloring $$(4k_1,c_4,c_6)$$-free graphs with a $$c_7$$. 38(5) (2022). https:\/\/doi.org\/10.1007\/s00373-022-02553-4. ISSN 0911-0119","DOI":"10.1007\/s00373-022-02553-4"},{"key":"3_CR24","unstructured":"Kouteck\u1ef3, M.: Solving hard problems on neighborhood diversity. Master\u2019s thesis (2013)"},{"key":"3_CR25","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, 19\u201337 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9554-x","journal-title":"Algorithmica"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 760\u2013776. SIAM (2011). https:\/\/doi.org\/10.1137\/16M1104834","DOI":"10.1137\/16M1104834"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.jcta.2004.06.010","volume":"108","author":"PRJ \u00d6sterg\u00e5rd","year":"2004","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: On a hypercube coloring problem. J. Comb. Theory, Ser. A 108(2), 199\u2013204 (2004). https:\/\/doi.org\/10.1016\/j.jcta.2004.06.010","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"03","key":"3_CR28","doi-asserted-by":"publisher","first-page":"2350020","DOI":"10.1142\/S1793830923500209","volume":"16","author":"M Shadravan","year":"2024","unstructured":"Shadravan, M., Borzooei, R.A.: Coupon coloring of kneser graph k (n, 2). Discrete Math. Algorithms Appl. 16(03), 2350020 (2024)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10878-015-9942-2","volume":"33","author":"Y Shi","year":"2015","unstructured":"Shi, Y., Wei, M., Yue, J., Zhao, Y.: Coupon coloring of some special graphs. J. Comb. Optim. 33(1), 156\u2013164 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9942-2","journal-title":"J. Comb. Optim."},{"issue":"4","key":"3_CR30","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"JA Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discret. Math. 10(4), 529\u2013550 (1997). https:\/\/doi.org\/10.1137\/S0895480194275825","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-031-25211-2_14","volume-title":"CALDAM 2023","author":"R Thankachan","year":"2023","unstructured":"Thankachan, R., Rajamani, P.: On coupon coloring of Cayley graphs. In: Bagchi, A., Muthu, R. (eds.) CALDAM 2023. LNCS, vol. 13947, pp. 184\u2013191. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25211-2_14"},{"issue":"4","key":"3_CR32","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s004930100011","volume":"21","author":"AV Kostochka","year":"2001","unstructured":"Kostochka, A.V., Woodall, D.R.: Density conditions for panchromatic colourings of hypergraphs. Combinatorica 21(4), 515\u2013541 (2001). https:\/\/doi.org\/10.1007\/s004930100011","journal-title":"Combinatorica"},{"key":"3_CR33","unstructured":"Zavlanos, M.M.: Distributed control of robotic networks. PhD thesis, University of Pennsylvania (2008)"},{"issue":"1","key":"3_CR34","first-page":"7","volume":"39","author":"B Zelinka","year":"1989","unstructured":"Zelinka, B.: Total domatic number and degrees of vertices of a graph. Math. Slovaca 39(1), 7\u201311 (1989)","journal-title":"Math. Slovaca"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:54Z","timestamp":1738706214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}