{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:27:06Z","timestamp":1774333626817,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_6","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:56Z","timestamp":1770977216000},"page":"81-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and\u00a0Approximation Results for\u00a0Extending Unique Neighborhood Networks"],"prefix":"10.1007","author":[{"given":"Siam","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadia","family":"Sharmin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bull, J.J., Pease, C.M.: Combinatorics and variety of mating-type systems. Evolution 667\u2013671 (1989)","DOI":"10.1111\/j.1558-5646.1989.tb04263.x"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.endm.2006.08.005","volume":"26","author":"E Charbit","year":"2006","unstructured":"Charbit, E., Charon, I., Cohen, G., Hudry, O.: Discriminating codes in bipartite graphs. Electron. Notes Discret. Math. 26, 29\u201335 (2006)","journal-title":"Electron. Notes Discret. Math."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"6_CR6","unstructured":"Dey, S., Foucaud, F., Nandy, S.C., Sen, A.: Discriminating codes in geometric setups. In: 31st International Symposium on Algorithms and Computation (ISAAC), pp. 24:1\u201324:16 (2020)"},{"issue":"1","key":"6_CR7","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"6_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the (1979)"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.jcta.2010.03.009","volume":"118","author":"IM Gessel","year":"2011","unstructured":"Gessel, I.M., Li, J.: Enumeration of point-determining graphs. J. Comb. Theory Ser. A 118(2), 591\u2013612 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"issue":"1\u20133","key":"6_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0012-365X(01)00357-0","volume":"254","author":"I Honkala","year":"2002","unstructured":"Honkala, I., Laihonen, T., Ranto, S.: On strongly identifying codes. Discret. Math. 254(1\u20133), 191\u2013205 (2002)","journal-title":"Discret. Math."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 38\u201349 (1973)","DOI":"10.1145\/800125.804034"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR15","unstructured":"Kashiwabara, T., Fujisawa, T.: An NP-complete problem on interval graphs. In: IEEE Symposium of Circuits and Systems, pp. 82\u201383 (1979)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s11036-008-0105-x","volume":"14","author":"M Laifenfeld","year":"2009","unstructured":"Laifenfeld, M., Trachtenberg, A., Cohen, R., Starobinski, D.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. Mob. Netw. Appl. 14, 415\u2013432 (2009)","journal-title":"Mob. Netw. Appl."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar, R., Pfaff, J., Hedetniemi, S.M., Hedetniemi, S.T.: On the algorithmic complexity of total domination. SIAM J. Algebraic Discrete Methods 5(3), 420\u2013425 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discret. Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discret. Appl. Math."},{"key":"6_CR19","series-title":"Oxford Studies in Probability","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"MD Penrose","year":"2003","unstructured":"Penrose, M.D.: Random Geometric Graphs. Oxford Studies in Probability, vol. 5. Oxford University Press, Oxford (2003)"},{"key":"6_CR20","unstructured":"Rass, S.: Perfectly secure communication, based on graph-topological addressing in unique-neighborhood networks (2023). https:\/\/arxiv.org\/abs\/1810.05602"},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114386","volume":"988","author":"S Rass","year":"2024","unstructured":"Rass, S.: Tell me who you are friends with and I will tell you who you are: unique neighborhoods in random graphs. Theoret. Comput. Sci. 988, 114386 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1109\/JSAC.2004.830895","volume":"22","author":"S Ray","year":"2004","unstructured":"Ray, S., Starobinski, D., Trachtenberg, A., Ungrangsi, R.: Robust location detection with sensor networks. IEEE J. Sel. Areas Commun. 22(6), 1016\u20131025 (2004)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"6_CR23","first-page":"109","volume":"46","author":"SJ Seo","year":"2010","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating dominating sets. Australas. J Comb. 46, 109\u2013120 (2010)","journal-title":"Australas. J Comb."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:07:03Z","timestamp":1774325223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}