{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:23:42Z","timestamp":1762917822702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"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-75172-6_20","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"228-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity"],"prefix":"10.1007","author":[{"given":"Jayesh","family":"Choudhari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Vinod","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17517-6_33","volume-title":"Algorithms and Computation","author":"A Adiga","year":"2010","unstructured":"Adiga, A., Chitnis, R., Saurabh, S.: Parameterized algorithms for boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 366\u2013377. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_33"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, A.: On the parameterized complexity of happy vertex coloring. In: International Workshop on Combinatorial Algorithms. Springer (2017, in press)","DOI":"10.1007\/978-3-319-78825-8_9"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-44543-4_22","volume-title":"Combinatorial Algorithms","author":"NR Aravind","year":"2016","unstructured":"Aravind, N.R., Kalyanasundaram, S., Kare, A.S.: Linear time algorithms for happy vertex coloring problems for trees. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 281\u2013292. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_22"},{"key":"20_CR4","unstructured":"Aravind, N., Kalyanasundaram, S., Kare, A.S., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint arXiv:1705.08282 (2017)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1007\/s00453-015-0011-0","volume":"74","author":"H Bruhn","year":"2016","unstructured":"Bruhn, H., Chopin, M., Joos, F., Schaudt, O.: Structural parameterizations for boxicity. Algorithmica 74(4), 1453\u20131472 (2016)","journal-title":"Algorithmica"},{"key":"20_CR7","unstructured":"Bulian, J.: Parameterized complexity of distances to sparse graph classes. Technical report, University of Cambridge, Computer Laboratory (2017)"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math. 127(3), 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"20_CR10","unstructured":"Cozzens, M.B.: Higher and multi-dimensional analogues of interval graphs (1982)"},{"key":"20_CR11","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-53007-9_11","volume-title":"Algorithms and Discrete Applied Mathematics","author":"B Das","year":"2017","unstructured":"Das, B., Enduri, M.K., Misra, N., Reddy, I.V.: On structural parameterizations of graph Motif and Chromatic number. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 118\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_11"},{"key":"20_CR13","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"},{"key":"20_CR14","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, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2014.11.026","volume":"185","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A., Such\u1ef3, O.: On structural parameterizations for the 2-club problem. Discrete Appl. Math. 185, 79\u201392 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s2-51.3.161","volume":"s2\u201351","author":"PJ Heawood","year":"1949","unstructured":"Heawood, P.J.: Map-colour theorem. Proc. London Math. Soc. s2\u201351(1), 161\u2013175 (1949)","journal-title":"Proc. London Math. Soc."},{"key":"20_CR18","unstructured":"Lampis, M.: Structural parameterizations of hard graph problems. City University of New York (2011)"},{"key":"20_CR19","volume-title":"Threshold Graphs and Related Topics","author":"NV Mahadev","year":"1995","unstructured":"Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics, vol. 56. Elsevier, Amsterdam (1995)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00453-012-9680-0","volume":"68","author":"AR McGrae","year":"2014","unstructured":"McGrae, A.R., Zito, M.: The complexity of the empire colouring problem. Algorithmica 68(2), 483\u2013503 (2014)","journal-title":"Algorithmica"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Misra, N., Reddy, I.V.: The parameterized complexity of happy colorings. arXiv preprint arXiv:1708.03853 (2017)","DOI":"10.1007\/978-3-319-78825-8_12"},{"key":"20_CR22","unstructured":"Roberts, S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301\u2013310 (1969)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2015.06.003","volume":"593","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Li, A.: Algorithmic aspects of homophyly of networks. Theor. Comput. Sci. 593, 117\u2013131 (2015)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:40:56Z","timestamp":1710344456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_20","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":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","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":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}