{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:42:54Z","timestamp":1742964174396,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_28","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"304-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Parameterized Algorithms for Mixed Domination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zimo","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/jgt.3190010209","volume":"1","author":"Y Alavi","year":"1977","unstructured":"Alavi, Y., Behzad, M., Lesniak-Foster, L.M., Nordhaus, E.: Total matchings and total coverings of graphs. J. Graph Theory 1(2), 135\u2013140 (1977)","journal-title":"J. Graph Theory"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11847250_13","volume-title":"Parameterized and Exact Computation","author":"H Fernau","year":"2006","unstructured":"Fernau, H.: edge dominating set: efficient enumeration-based exact algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 142\u2013153. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_13"},{"key":"28_CR3","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":"Fedor V. Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"28_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.7151\/dmgt.1380","volume":"27","author":"P Hatami","year":"2007","unstructured":"Hatami, P.: An approximation algorithm for the total covering problem. Discussiones Mathematicae Graph Theory 27(3), 553\u2013558 (2007)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"28_CR6","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R., McRae, A., Majumdar, A.: Domination, independence and irredundance in total graphs: a brief survey. In: Graph Theory, Combinatorics and Applications: Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs, vol.\u00a02, pp. 671\u2013683. Wiley, New York (1995)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-68705-6_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Jain","year":"2017","unstructured":"Jain, P., Jayakrishnan, M., Panolan, F., Sahu, A.: Mixed Dominating Set: a parameterized perspective. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 330\u2013343. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_25"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2012.11.035","volume":"476","author":"JK Lan","year":"2013","unstructured":"Lan, J.K., Chang, G.J.: On the mixed domination problem in graphs. Theoret. Comput. Sci. 476, 84\u201393 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"28_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"DF Manlove","year":"1999","unstructured":"Manlove, D.F.: On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Appl. Math. 91(1\u20133), 155\u2013175 (1999)","journal-title":"Discrete Appl. Math."},{"key":"28_CR10","unstructured":"Rajaati, M., Hooshmandasl, M.R., Dinneen, M.J., Shakiba, A.: On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. Discrete Math. Theoret. Comput. Sci. 20(2), 1\u201325 (2018)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Xiao, M.: Upper and lower bounds on approximating weighted mixed domination. In: COCOON 2019 (2019, to appear)","DOI":"10.1007\/978-3-030-26176-4_46"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2012.06.022","volume":"511","author":"M Xiao","year":"2013","unstructured":"Xiao, M., Kloks, T., Poon, S.H.: New parameterized algorithms for the edge dominating set problem. Theoret. Comput. Sci. 511, 147\u2013158 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"22","key":"28_CR13","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1016\/j.tcs.2011.01.029","volume":"412","author":"Y Zhao","year":"2011","unstructured":"Zhao, Y., Kang, L., Sohn, M.Y.: The algorithmic complexity of mixed domination in graphs. Theoret. Comput. Sci. 412(22), 2387\u20132392 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:18:00Z","timestamp":1709824680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}