{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:02Z","timestamp":1770972422202,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319947754","type":"print"},{"value":"9783319947761","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_43","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"516-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Liar\u2019s Dominating Set in Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Ramesh K.","family":"Jallu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangram K.","family":"Jena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2016.04.023","volume":"211","author":"A Alimadadi","year":"2016","unstructured":"Alimadadi, A., Chellali, M., Mojdeh, D.A.: Liar\u2019s dominating sets in graphs. Discret. Appl. Math. 211, 204\u2013210 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"43_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"key":"43_CR3","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. Freeman, Dallas (1979)"},{"issue":"4","key":"43_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM (JACM) 21(4), 549\u2013568 (1974)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"43_CR5","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-53007-9_20","volume-title":"Algorithms and Discrete Applied Mathematics","author":"RK Jallu","year":"2017","unstructured":"Jallu, R.K., Das, G.K.: Liar\u2019s domination in 2D. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 219\u2013229. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_20"},{"key":"43_CR7","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":"04","key":"43_CR8","doi-asserted-by":"publisher","first-page":"1350024","DOI":"10.1142\/S1793830913500249","volume":"5","author":"BS Panda","year":"2013","unstructured":"Panda, B.S., Paul, S.: Connected liar\u2019s domination in graphs: complexity and algorithms. Discret. Math. Algorithms Appl. 5(04), 1350024 (2013)","journal-title":"Discret. Math. Algorithms Appl."},{"issue":"7","key":"43_CR9","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. Discret. Appl. Math. 161(7), 1085\u20131092 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"19","key":"43_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.ipl.2013.07.012","volume":"113","author":"BS Panda","year":"2013","unstructured":"Panda, B.S., Paul, S.: A linear time algorithm for liar\u2019s domination problem in proper interval graphs. Inf. Process. Lett. 113(19), 815\u2013822 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"43_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10878-012-9542-3","volume":"27","author":"BS Panda","year":"2014","unstructured":"Panda, B.S., Paul, S.: Hardness results and approximation algorithm for total liar\u2019s domination in graphs. J. Comb. Optim. 27(4), 643\u2013662 (2014)","journal-title":"J. Comb. Optim."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2015.01.041","volume":"573","author":"BS Panda","year":"2015","unstructured":"Panda, B.S., Paul, S., Pradhan, D.: Hardness results, approximation and exact algorithms for liar\u2019s domination problem in graphs. Theor. Comput. Sci. 573, 26\u201342 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"19","key":"43_CR13","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. Discret. Math. 309(19), 5884\u20135890 (2009)","journal-title":"Discret. Math."},{"issue":"2","key":"43_CR14","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"},{"key":"43_CR15","unstructured":"Sterling, C.: Liar\u2019s Domination in Grid Graphs. Ph.D. thesis, East Tennessee State University (2012)"},{"issue":"2","key":"43_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 100(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:43Z","timestamp":1710347803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}