{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:54:14Z","timestamp":1743101654788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"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-19955-5_23","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"262-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Mixed Dominating Set"],"prefix":"10.1007","author":[{"given":"Jayakrishnan","family":"Madathil","sequence":"first","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"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"2","key":"23_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.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":"23_CR2","doi-asserted-by":"publisher","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."},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2973749","volume":"63","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. J. ACM 63(5), 44:1\u201344:69 (2016)","journal-title":"J. ACM"},{"key":"23_CR4","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)"},{"key":"23_CR5","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2012)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2650261","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"},{"key":"23_CR7","unstructured":"Drange, P.G., et al.: Kernelization and sparseness: the case of dominating set. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orl\u00e9ans, France, 17\u201320 February 2016, pp. 31:1\u201331:14 (2016)"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Eickmeyer, K., et al.: Neighborhood complexity and kernelization for nowhere dense classes of graphs. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, 10\u201314 July 2017, pp. 63:1\u201363:14 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.63","DOI":"10.4230\/LIPIcs.ICALP.2017.63"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","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":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-92248-3_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"PA Golovach","year":"2008","unstructured":"Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 195\u2013205. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92248-3_18"},{"issue":"3","key":"23_CR11","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":"23_CR12","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":"23_CR13","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)"},{"key":"23_CR14","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":"23_CR15","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. Theor. Comput. Sci. 476, 84\u201393 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR16","unstructured":"Majumdar, A.: Neighborhood hypergraphs: a framework for covering and packing parameters in graphs. Ph.D. thesis, Clemson University (1992)"},{"issue":"1\u20133","key":"23_CR17","doi-asserted-by":"publisher","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":"23_CR18","doi-asserted-by":"publisher","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. Theory, Ser. B 24(2), 164\u2013168 (1978)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1\u20133","key":"23_CR19","doi-asserted-by":"publisher","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":"23_CR20","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":"22","key":"23_CR21","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. Theor. Comput. Sci. 412(22), 2387\u20132392 (2011)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:05Z","timestamp":1710349385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_23","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":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","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":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}