{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:10:09Z","timestamp":1744949409631,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_27","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"323-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Algorithms for the Happy Set Problem"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Eto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ippei","family":"Terabaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"27_CR1","first-page":"103","volume":"2017","author":"A Agrawal","year":"2017","unstructured":"Agrawal, A.: On the parameterized complexity of happy vertex coloring. IWOCA 2017, 103\u2013115 (2017)","journal-title":"IWOCA"},{"key":"27_CR2","first-page":"281","volume":"2016","author":"N Aravind","year":"2016","unstructured":"Aravind, N., Kalyanasundaram, S., Kare, A.: Linear time algorithms for happy vertex coloring problems for trees. IWOCA 2016, 281\u2013292 (2016)","journal-title":"IWOCA"},{"key":"27_CR3","unstructured":"Aravind, N., Kalyanasundaram, S., Kare, A., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint \narXiv:1705.08282\n\n (2017)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121, 15\u201326 (2002)","journal-title":"Discrete Appl. Math."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Sagunov, S.: On happy colorings, cuts, and structual parameterizations. arXiv preprint \narXiv:1907.06172\n\n (2019)","DOI":"10.1007\/978-3-030-30786-8_12"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18(2), 238\u2013255 (1995)","journal-title":"J. Algorithms"},{"key":"27_CR7","first-page":"114","volume":"2013","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.: Exact and approximation algorithms for densest $$k$$-subgraph. WALCOM 2013, 114\u2013125 (2013)","journal-title":"WALCOM"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2013.03.008","volume":"485","author":"H Broersma","year":"2013","unstructured":"Broersma, H., Golovach, P., Patel, V.: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485, 69\u201384 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1016\/j.dam.2005.05.036","volume":"154","author":"M Bruglieri","year":"2006","unstructured":"Bruglieri, M., Ehrgott, M., Hamacher, H., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Appl. Math. 154(9), 1344\u20131357 (2006)","journal-title":"Discrete Appl. Math."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L Cai","year":"2007","unstructured":"Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51, 102\u2013121 (2007)","journal-title":"Comput. J."},{"key":"27_CR11","first-page":"228","volume":"2018","author":"J Choudhari","year":"2018","unstructured":"Choudhari, J., Reddy, I.: On structual parameterizations of happy coloring, empire coloring and boxicity. WALCOM 2018, 228\u2013239 (2018)","journal-title":"WALCOM"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"27_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. Discrete Appl. Math. 101(1), 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"27_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., et al.: Parameterized Algorithms. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"27_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks Crowds and Markets: Reasoning about a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks Crowds and Markets: Reasoning about a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"27_CR16","unstructured":"Feige, U., Seltser, M.: On the densest $$k$$-subgraph problem. Technical report CS97-16, Weizmann Institute, Rehovot (1997).\nhttp:\/\/www.wisdom.weizmann.ac.il"},{"issue":"2","key":"27_CR17","first-page":"77","volume":"17","author":"R Ganian","year":"2015","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci. 17(2), 77\u2013100 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"27_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"27_CR19","first-page":"155","volume":"9","author":"J Keil","year":"1991","unstructured":"Keil, J., Brecht, T.: The complexity of clustering in planar graphs. J. Comb. Math. Comb. Comput. 9, 155\u2013159 (1991)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"27_CR20","first-page":"692","volume":"1993","author":"G Kortsarz","year":"1993","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. FOCS 1993, 692\u2013701 (1993)","journal-title":"FOCS"},{"issue":"1","key":"27_CR21","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(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cor.2018.11.015","volume":"103","author":"R Lewis","year":"2019","unstructured":"Lewis, R., Thiruvady, D., Morgan, K.: Finding happiness: an analysis of the maximum happy vertices problem. Comput. Oper. Res. 103, 265\u2013276 (2019)","journal-title":"Comput. Oper. Res."},{"key":"27_CR23","first-page":"142","volume":"2017","author":"N Misra","year":"2017","unstructured":"Misra, N., Reddy, I.: The parameterized complexity of happy colorings. IWOCA 2017, 142\u2013153 (2017)","journal-title":"IWOCA"},{"key":"27_CR24","first-page":"159","volume":"2015","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Jiang, T., Li, A.: Improved approximation algorithms for the maximum happy vertices and edges problems. COCOON 2015, 159\u2013170 (2015)","journal-title":"COCOON"},{"key":"27_CR25","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."},{"issue":"5","key":"27_CR26","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1007\/s00453-017-0302-8","volume":"80","author":"P Zhang","year":"2018","unstructured":"Zhang, P., Xu, Y., Jiang, T., Li, A., Lin, G., Miyano, E.: Improved approximation algorithms for the maximum happy vertices and edges problems. Algorithmica 80(5), 1412\u20131438 (2018)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:15Z","timestamp":1582139175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}