{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:52Z","timestamp":1759638352739,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_25","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"330-343","source":"Crossref","is-referenced-by-count":3,"title":["Mixed Dominating Set: A Parameterized Perspective"],"prefix":"10.1007","author":[{"given":"Pallavi","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Jayakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"crossref","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.A.: Total matchings and total coverings of graphs. J. Graph Theor. 1(2), 135\u2013140 (1977)","journal-title":"J. Graph Theor."},{"issue":"1\u20133","key":"25_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(92)90643-T","volume":"100","author":"Y Alavi","year":"1992","unstructured":"Alavi, Y., Liu, J., Wang, J., Zhang, Z.: On total covers of graphs. Discrete Math. 100(1\u20133), 229\u2013233 (1992)","journal-title":"Discrete Math."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: STOC, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c $${}^{\\text{k}}$$ k n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016). http:\/\/dx.doi.org\/10.1137\/130947374","DOI":"10.1137\/130947374"},{"issue":"35","key":"25_CR5","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR6","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, Heidelberg (2015). doi: 10.1007\/978-3-319-21275-3"},{"issue":"3","key":"25_CR7","doi-asserted-by":"crossref","first-page":"41:1","DOI":"10.1145\/2925416","volume":"12","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlstr\u00f6m, M.: On problems as hard as CNF-SAT. ACM Trans. Algorithms 12(3), 41:1\u201341:24 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"25_CR8","first-page":"13:1","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDS. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"25_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(77)90102-9","volume":"19","author":"P Erd\u00f6s","year":"1977","unstructured":"Erd\u00f6s, P., Meir, A.: On total matching numbers and total covering numbers of complementary graphs. Discrete Math. 19(3), 229\u2013233 (1977)","journal-title":"Discrete Math."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564\u2013573. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45655-4_60"},{"key":"25_CR11","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":"25_CR12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s00453-012-9627-5","volume":"64","author":"Q Gu","year":"2012","unstructured":"Gu, Q., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64(3), 416\u2013453 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR13","doi-asserted-by":"crossref","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. Discuss. Math. Graph Theor. 27(3), 553\u2013558 (2007)","journal-title":"Discuss. Math. Graph Theor."},{"key":"25_CR14","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"key":"25_CR15","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R., McRae, A., Majumdar, A.: Domination, independence and irredundance in total graphs: a brief survey. In: Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs. vol. 2, pp. 671\u2013683 (1995)"},{"issue":"4","key":"25_CR16","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity. J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR17","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 476, 84\u201393 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR18","unstructured":"Majumdar, A.: Neighborhood hypergraphs: a framework for covering and packing parameters in graphs. Ph.D. thesis, Clemson University (1992)"},{"issue":"1\u20133","key":"25_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"D Manlove","year":"1999","unstructured":"Manlove, D.: 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."},{"issue":"2","key":"25_CR20","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0095-8956(78)90017-5","volume":"24","author":"A Meir","year":"1978","unstructured":"Meir, A.: On total covering and matching of graphs. J. Comb. Theor. Ser. B 24(2), 164\u2013168 (1978)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$\\cal{O}(\\sqrt{|V|} |E|)$$ O ( | V | | E | ) algorithm for finding maximum matching in general graphs. In: FOCS, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"issue":"1\u20133","key":"25_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0166-218X(94)90216-X","volume":"49","author":"UN Peled","year":"1994","unstructured":"Peled, U.N., Sun, F.: Total matchings and total coverings of threshold graphs. Discrete Appl. Math. 49(1\u20133), 325\u2013330 (1994)","journal-title":"Discrete Appl. Math."},{"key":"25_CR23","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. CoRR abs\/1612.08234 (2016)"},{"issue":"2","key":"25_CR24","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theor. Ser. B 62(2), 323\u2013348 (1994)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"25_CR25","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."},{"issue":"22","key":"25_CR26","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 412(22), 2387\u20132392 (2011)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T08:11:44Z","timestamp":1570263104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}