{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:04Z","timestamp":1759638904627,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"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-25005-8_5","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"48-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm and Hardness Results on Liar\u2019s Dominating Set and $$\\varvec{k}$$-tuple Dominating Set"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Banerjee","sequence":"first","affiliation":[]},{"given":"Sujoy","family":"Bhore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Bhore, S.: Algorithm and hardness results on liar\u2019s dominating set and $$k$$-tuple dominating set. CoRR, abs\/1902.11149 (2019)","DOI":"10.1007\/978-3-030-25005-8_5"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.dam.2016.06.008","volume":"231","author":"A Bishnu","year":"2017","unstructured":"Bishnu, A., Ghosh, A., Paul, S.: Linear kernels for k-tuple and liar\u2019s domination in bounded genus graphs. Discrete Appl. Math. 231, 67\u201377 (2017)","journal-title":"Discrete Appl. Math."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1007\/978-1-4613-0303-9_28","volume-title":"Handbook of Combinatorial Optimization","author":"GJ Chang","year":"1998","unstructured":"Chang, G.J.: Algorithmic aspects of domination in graphs. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1811\u20131877. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_28"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: k-domination and k-independence in graphs: a survey. Graphs Comb. 28(1), 1\u201355 (2012)","journal-title":"Graphs Comb."},{"key":"5_CR5","unstructured":"Fink, J.F., Jacobson, M.S.: n-domination in graphs. In: Graph theory with Applications to Algorithms and Computer Science, pp. 283\u2013300. Wiley, Hoboken (1985)"},{"key":"5_CR6","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W. H. Freeman, New York (2002)"},{"key":"5_CR7","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary, F., Haynes, T.W.: Double domination in graphs. Ars Comb. 55, 201\u2013214 (2000)","journal-title":"Ars Comb."},{"key":"5_CR8","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-94776-1_43","volume-title":"Computing and Combinatorics","author":"RK Jallu","year":"2018","unstructured":"Jallu, R.K., Jena, S.K., Das, G.K.: Liar\u2019s dominating set in unit disk graphs. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 516\u2013528. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_43"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2), 75\u201383 (2004)","journal-title":"Inf. Process. Lett."},{"key":"5_CR11","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"CS Liao","year":"2003","unstructured":"Liao, C.S., Chang, G.J.: k-tuple domination in graphs. Inf. Process. Lett. 87(1), 45\u201350 (2003)","journal-title":"Inf. Process. Lett."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11671411_23","volume-title":"Approximation and Online Algorithms","author":"T Nieberg","year":"2006","unstructured":"Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296\u2013306. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_23"},{"issue":"7\u20138","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.dam.2012.12.011","volume":"161","author":"BS Panda","year":"2013","unstructured":"Panda, B.S., Paul, S.: Liar\u2019s domination in graphs: complexity and algorithm. Discrete Appl. Math. 161(7\u20138), 1085\u20131092 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.aml.2006.03.006","volume":"20","author":"D Rautenbach","year":"2007","unstructured":"Rautenbach, D., Volkmann, L.: New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett. 20(1), 98\u2013102 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"19","key":"5_CR16","doi-asserted-by":"publisher","first-page":"5884","DOI":"10.1016\/j.disc.2008.07.019","volume":"309","author":"ML Roden","year":"2009","unstructured":"Roden, M.L., Slater, P.J.: Liar\u2019s domination in graphs. Discrete Math. 309(19), 5884\u20135890 (2009)","journal-title":"Discrete Math."},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/net.20295","volume":"54","author":"PJ Slater","year":"2009","unstructured":"Slater, P.J.: Liar\u2019s domination. Networks 54(2), 70\u201374 (2009)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:12:48Z","timestamp":1710349968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_5","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":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","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":"73","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":"36","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":"49% - 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":"5-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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}