{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:24:37Z","timestamp":1755217477616,"version":"3.43.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"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-82670-2_9","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:39:42Z","timestamp":1738816782000},"page":"108-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Structural Parameterized Complexity of\u00a0Defective Coloring"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[]},{"given":"Pankaj","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"issue":"13","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.disc.2010.08.013","volume":"311","author":"N Achuthan","year":"2011","unstructured":"Achuthan, N., Achuthan, N.R., Simanihuruk, M.: On minimal triangle-free graphs with prescribed k-defective chromatic number. Disc. Math. 311(13), 1119\u20131127 (2011). https:\/\/doi.org\/10.1016\/j.disc.2010.08.013","journal-title":"Disc. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jda.2012.07.001","volume":"16","author":"J Ara\u00fajo","year":"2012","unstructured":"Ara\u00fajo, J., Bermond, J., Giroire, F., Havet, F., Mazauric, D., Modrzejewski, R.: Weighted improper colouring. J. Disc. Algor. 16, 53\u201366 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.07.001","journal-title":"J. Disc. Algor."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.dam.2013.11.018","volume":"182","author":"C Archetti","year":"2015","unstructured":"Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., Gagnon, F.: Directed weighted improper coloring for cellular channel allocation. Disc. Appl. Math. 182, 46\u201360 (2015). https:\/\/doi.org\/10.1016\/j.dam.2013.11.018","journal-title":"Disc. Appl. Math."},{"issue":"10","key":"9_CR4","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ipl.2015.05.007","volume":"115","author":"J Bang-Jensen","year":"2015","unstructured":"Bang-Jensen, J., Halld\u00f3rsson, M.M.: Vertex coloring edge-weighted digraphs. Inf. Process. Lett. 115(10), 791\u2013796 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2015.05.007","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/18M1223666","volume":"34","author":"R Belmonte","year":"2020","unstructured":"Belmonte, R., Lampis, M., Mitsou, V.: Parameterized (approximate) defective coloring. SIAM J. Disc. Math. 34(2), 1084\u20131106 (2020). https:\/\/doi.org\/10.1137\/18M1223666","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Belmonte, R., Lampis, M., Mitsou, V.: Defective coloring on classes of perfect graphs. Disc. Math. Theor. Comput. Sci. 24(1) (2022). https:\/\/doi.org\/10.46298\/dmtcs.4926. https:\/\/dmtcs.episciences.org\/8918","DOI":"10.46298\/dmtcs.4926"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S1793830910000747","volume":"2","author":"J Bermond","year":"2010","unstructured":"Bermond, J., Havet, F., Huc, F., Sales, C.L.: Improper coloring of weighted grid and hexagonal graphs. Disc. Math. Algor. Appl. 2(3), 395\u2013412 (2010). https:\/\/doi.org\/10.1142\/S1793830910000747","journal-title":"Disc. Math. Algor. Appl."},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986). https:\/\/doi.org\/10.1002\/jgt.3190100207","journal-title":"J. Graph Theory"},{"key":"9_CR9","unstructured":"Cumberbatch, J., Lauri, J., Mitillos, C.: Exact defective colorings of graphs. CoRR arxiv:2109.05255 (2021)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a04. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"1","key":"9_CR11","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. Comb. 7(1), 49\u201365 (1987). https:\/\/doi.org\/10.1007\/BF02579200","journal-title":"Comb."},{"issue":"1\u20133","key":"9_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0012-365X(94)90260-7","volume":"126","author":"M Frick","year":"1994","unstructured":"Frick, M., Henning, M.A.: Extremal results on defective colorings of graphs. Disc. Math. 126(1\u20133), 151\u2013158 (1994). https:\/\/doi.org\/10.1016\/0012-365X(94)90260-7","journal-title":"Disc. Math."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-28050-4_21","volume-title":"Parameterized and Exact Computation","author":"R Ganian","year":"2012","unstructured":"Ganian, R.: Twin-cover: beyond vertex cover in parameterized algorithmics. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 259\u2013271. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28050-4_21"},{"issue":"2\u20133","key":"9_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(03)00177-8","volume":"272","author":"JG Gimbel","year":"2003","unstructured":"Gimbel, J.G., Hartman, C.: Subcolorings and the subchromatic number of a graph. Disc. Math. 272(2\u20133), 139\u2013154 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(03)00177-8","journal-title":"Disc. Math."},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Gudmundsson, B.A., Magn\u00fasson, T.K., S\u00e6mundsson, B.O.: Bounds and fixed-parameter algorithms for weighted improper coloring. In: Crescenzi, P., Loreti, M. (eds.) Proceedings of the 16th Italian Conference on Theoretical Computer Science, ICTCS 2015, Firenze, Italy, 9\u201311 September 2015. Electronic Notes in Theoretical Computer Science, vol.\u00a0322, pp. 181\u2013195. Elsevier (2015). https:\/\/doi.org\/10.1016\/j.entcs.2016.03.013","DOI":"10.1016\/j.entcs.2016.03.013"},{"key":"9_CR16","first-page":"33","volume":"47","author":"JA Andrews","year":"1985","unstructured":"Andrews, J.A., Jacobson, M.S.: On a generalization of chromatic number. Congressus Numerantium 47, 33\u201348 (1985)","journal-title":"Congressus Numerantium"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","DOI":"10.1287\/moor.8.4.538"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0963548309990216","volume":"19","author":"RJ Kang","year":"2010","unstructured":"Kang, R.J., McDiarmid, C.: The t-improper chromatic number of random graphs. Comb. Probab. Comput. 19(1), 87\u201398 (2010). https:\/\/doi.org\/10.1017\/S0963548309990216","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"9_CR19","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). https:\/\/doi.org\/10.1287\/moor.12.3.415","journal-title":"Math. Oper. Res."},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Lampis, M., Vasilakis, M.: Structural parameterizations for two bounded degree problems revisited. In: G\u00f8rtz, I.L., Farach-Colton, M., Puglisi, S.J., Herman, G. (eds.) 31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, The Netherlands, 4\u20136 September 2023. LIPIcs, vol.\u00a0274, pp. 77:1\u201377:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2023.77","DOI":"10.4230\/LIPICS.ESA.2023.77"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/S00493-018-3733-1","volume":"39","author":"PO de Mendez","year":"2019","unstructured":"de Mendez, P.O., Oum, S., Wood, D.R.: Defective colouring of graphs excluding a subgraph or minor. Comb. 39(2), 377\u2013410 (2019). https:\/\/doi.org\/10.1007\/S00493-018-3733-1","journal-title":"Comb."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T15:25:39Z","timestamp":1754407539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_9","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":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}