{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:35Z","timestamp":1759638455572,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_6","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"65-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of\u00a0Paired Domination in\u00a0AT-free and\u00a0Planar Graphs"],"prefix":"10.1007","author":[{"given":"Vikash","family":"Tripathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaustav","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Lung","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10, 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-60084-1_82","volume-title":"Automata, Languages and Programming","author":"DG Corneil","year":"1995","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 292\u2013302. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60084-1_82"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10878-008-9177-6","volume":"19","author":"L Chen","year":"2008","unstructured":"Chen, L., Lu, C., Zeng, Z.: Labelling algorithms for paired domination problems in block and interval graphs. J. Comb. Optim. 19(4), 457\u2013470 (2008)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ipl.2009.09.014","volume":"110","author":"L Chen","year":"2009","unstructured":"Chen, L., Lu, C., Zeng, Z.: A linear-time algorithm for paired-domination in strongly chordal graphs. Inf. Process. Lett. 110(1), 20\u201323 (2009)","journal-title":"Inf. Process. Lett."},{"key":"6_CR5","first-page":"101","volume":"94","author":"W Desormeaux","year":"2014","unstructured":"Desormeaux, W., Henning, M.A.: Paired domination in graphs: a survey and recent results. Util. Math. 94, 101\u2013166 (2014)","journal-title":"Util. Math."},{"key":"6_CR6","series-title":"Developments in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in Domination in Graphs. DM, vol. 64. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3"},{"key":"6_CR7","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, vol. 208. Marcel Dekker Inc., New York (1998)"},{"key":"6_CR8","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics, vol. 209. Marcel Dekker Inc., New York (1998)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Slater, P.J.: Paired domination in graphs. Networks 32, 199\u2013206 (1998)","journal-title":"Networks"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/3-540-60313-1_161","volume-title":"Algorithms \u2014 ESA 1995","author":"T Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Approximating the bandwidth for asteroidal triple-free graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 434\u2013447. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60313-1_161"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination in asteroidal triple-free graphs. Discrete Appl. Math. 99, 111\u2013123 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ejc.2011.10.011","volume":"34","author":"E Lappas","year":"2013","unstructured":"Lappas, E., Nikolopoulos, S.D., Palios, L.: An $$O(n)$$-time algorithm for paired domination problem on permutation graphs. Eur. J. Combin. 34(3), 593\u2013608 (2013)","journal-title":"Eur. J. Combin."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2015.05.002","volume":"591","author":"CC Lin","year":"2015","unstructured":"Lin, C.C., Tu, H.L.: A linear-time algorithm for paired-domination on circular arc graphs. Theor. Comput. Sci. 591, 99\u2013105 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"6_CR14","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1007\/s00453-020-00705-7","volume":"82","author":"C-C Lin","year":"2020","unstructured":"Lin, C.-C., Ku, K.-C., Hsu, C.-H.: Paired-domination problem on distance-hereditary graphs. Algorithmica 82(10), 2809\u20132840 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00705-7","journal-title":"Algorithmica"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theory Ser. A. 82, 102\u2013117 (2001)","journal-title":"J. Comb. Theory Ser. A."},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1007\/s10878-012-9483-x","volume":"26","author":"BS Panda","year":"2012","unstructured":"Panda, B.S., Pradhan, D.: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26(4), 770\u2013785 (2012). https:\/\/doi.org\/10.1007\/s10878-012-9483-x","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:53Z","timestamp":1642982753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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":"6","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)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}