{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:16:35Z","timestamp":1742912195007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_16","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"188-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Tractability of (k,\u00a0i)-Coloring"],"prefix":"10.1007","author":[{"given":"Saurabh","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"additional","affiliation":[]},{"given":"Anjeneya Swami","family":"Kare","sequence":"additional","affiliation":[]},{"given":"Sriram","family":"Bhyravarapu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"16_CR1","first-page":"167","volume":"8","author":"I M\u00e9ndez-D\u00edaz","year":"1999","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A generalization of the graph coloring problem. Investig. Oper. 8, 167\u2013184 (1999)","journal-title":"Investig. Oper."},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","volume":"20","author":"S Stahl","year":"1976","unstructured":"Stahl, S.: $$n$$-tuple colorings and associated graphs. J. Comb. Theor. Ser. B 20(2), 185\u2013203 (1976)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(79)90148-1","volume":"25","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B., Thomason, A.: Set colourings of graphs. Discrete Math. 25(1), 21\u201326 (1979)","journal-title":"Discrete Math."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s003730200007","volume":"18","author":"W Klostermeyer","year":"2002","unstructured":"Klostermeyer, W., Zhang, C.Q.: $$n$$-tuple coloring of planar graphs with large odd girth. Graphs Combinatorics 18(1), 119\u2013132 (2002)","journal-title":"Graphs Combinatorics"},{"issue":"12","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1080\/00207160701327721","volume":"84","author":"P \u0160parl","year":"2007","unstructured":"\u0160parl, P., \u017derovnik, J.: A note on $$n$$-tuple colourings and circular colourings of planar graphs with large odd girth. Int. J. Comput. Math. 84(12), 1743\u20131746 (2007)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(83)90020-3","volume":"5","author":"RW Irving","year":"1983","unstructured":"Irving, R.W.: NP-completeness of a family of graph-colouring problems. Discrete Appl. Math. 5(1), 111\u2013117 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"16_CR7","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D.: Graph colouring problems and their applications in scheduling. Period. Polytech. Electr. Eng. 48(1\u20132), 11\u201316 (2004)","journal-title":"Period. Polytech. Electr. Eng."},{"unstructured":"Beideman, C., Blocki, J.: Set families with low pairwise intersection. arXiv preprint arXiv:1404.4622 (2014)","key":"16_CR8"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0095-8956(82)90079-X","volume":"32","author":"RC Brigham","year":"1982","unstructured":"Brigham, R.C., Dutton, R.D.: Generalized $$k$$-tuple colorings of cycles and other graphs. J. Comb. Theor. Ser. B 32(1), 90\u201394 (1982)","journal-title":"J. Comb. Theor. Ser. B"},{"unstructured":"Bonomo, F., Dur\u00e1n, G., Koch, I., Valencia-Pabon, M.: On the $$(k, i)$$-coloring of cacti and complete graphs. In: Ars Combinatoria (2014)","key":"16_CR10"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","volume":"8","author":"S Johnson","year":"1962","unstructured":"Johnson, S.: A new upper bound for error-correcting codes. IRE Trans. Inf. Theor. 8(3), 203\u2013207 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"doi-asserted-by":"crossref","unstructured":"Majumdar, D., Neogi, R., Raman, V., Tale, P.: Exact and parameterized algorithms for $$(k, i)$$-coloring. In: Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, India, pp. 281\u2013293 (2017)","key":"16_CR12","DOI":"10.1007\/978-3-319-53007-9_25"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-13731-0_9","volume-title":"Algorithm Theory - SWAT 2010","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Schweitzer, P.: Isomorphism for graphs of bounded feedback vertex set number. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 81\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_9"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TST.2014.6867520","volume":"19","author":"BM Jansen","year":"2014","unstructured":"Jansen, B.M., Raman, V., Vatshelle, M.: Parameter ecology for feedback vertex set. Tsinghua Sci. Technol. 19(4), 387\u2013409 (2014)","journal-title":"Tsinghua Sci. Technol."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"16_CR16","first-page":"569","volume":"49","author":"YL Wu","year":"2014","unstructured":"Wu, Y.L., Austrin, P., Pitassi, T., Liu, D.: Inapproximability of treewidth, one-shot pebbling, and related layout problems. J. Artif. Intell. Res. 49(1), 569\u2013600 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"10","key":"16_CR17","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ipl.2014.05.001","volume":"114","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114(10), 556\u2013560 (2014)","journal-title":"Inf. Process. Lett."},{"key":"16_CR18","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","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"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3(1), 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An $${O}^*(2^n)$$ algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. FOCS 2006, Washington, D.C., pp. 583\u2013590. IEEE Computer Society (2006)","key":"16_CR20","DOI":"10.1109\/FOCS.2006.11"}],"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-319-74180-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:34Z","timestamp":1709826694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","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":"Guwahati","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}