{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:32:47Z","timestamp":1783150367159,"version":"3.54.6"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319784540","type":"print"},{"value":"9783319784557","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-78455-7_6","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"68-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Maximum Distance-d Independent Set Problem on Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Sangram K.","family":"Jena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramesh K.","family":"Jallu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00386-X","volume":"132","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson, G., Damaschke, P., Halld\u00f3rsson, M.M.: Powers of geometric intersection graphs and dispersion algorithms. Discrete Appl. Math. 132(1), 3\u201316 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM (JACM) 45(3), 501\u2013555 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"6_CR3","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."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"GJ Chang","year":"1984","unstructured":"Chang, G.J., Nemhauser, G.L.: The $$k$$-domination and $$k$$-stability problems on sun-free chordal graphs. SIAM J. Algebraic Discrete Methods 5(3), 332\u2013345 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1\u20133","key":"6_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ipl.2014.11.002","volume":"115","author":"GK Das","year":"2015","unstructured":"Das, G.K., De, M., Kolay, S., Nandy, S.C., Sur-Kolay, S.: Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115(3), 439\u2013446 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s10878-012-9594-4","volume":"27","author":"H Eto","year":"2014","unstructured":"Eto, H., Guo, F., Miyano, E.: Distance-$$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27(1), 88\u201399 (2014)","journal-title":"J. Comb. Optim."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-48749-6_20","volume-title":"Combinatorial Optimization and Applications","author":"H Eto","year":"2016","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximability of the distance independent set problem on regular graphs and planar graphs. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 270\u2013284. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_20"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-53925-6_18","volume-title":"WALCOM: Algorithms and Computation","author":"H Eto","year":"2017","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximation algorithm for the distance-3 independent set problem on cubic graphs. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 228\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_18"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, vol. 29. W. H. Freeman, New York (2002)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47\u201363. ACM (1974)","DOI":"10.1145\/800119.803884"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"6_CR15","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 160\u2013169. Society for Industrial and Applied Mathematics (1995)"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM (JACM) 32(1), 130\u2013136 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"2\u20133","key":"6_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(81)90218-1","volume":"37","author":"WL Hsu","year":"1981","unstructured":"Hsu, W.L., Nemhauser, G.L.: Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. Discrete Math. 37(2\u20133), 181\u2013191 (1981)","journal-title":"Discrete Math."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-29221-2_18","volume-title":"Algorithms and Discrete Applied Mathematics","author":"RK Jallu","year":"2016","unstructured":"Jallu, R.K., Das, G.K.: Improved algorithm for maximum independent set on unit disk graph. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 212\u2013223. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_18"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59\u201368 (1995)","journal-title":"Networks"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194\u2013200. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46515-7_16"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28(3), 284\u2013304 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-53536-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Montealegre","year":"2016","unstructured":"Montealegre, P., Todinca, I.: On distance-d independent set and other problems in graphs with \u201cfew\u201d minimal separators. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 183\u2013194. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53536-3_16"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","volume":"35","author":"OJ Murphy","year":"1992","unstructured":"Murphy, O.J.: Computing independent sets in graphs with large girth. Discrete Appl. Math. 35(2), 167\u2013170 (1992)","journal-title":"Discrete Appl. Math."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2017.07.007","volume":"127","author":"SC Nandy","year":"2017","unstructured":"Nandy, S.C., Pandit, S., Roy, S.: Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127, 58\u201361 (2017)","journal-title":"Inf. Process. Lett."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-30559-0_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Nieberg","year":"2004","unstructured":"Nieberg, T., Hurink, J., Kern, W.: A robust PTAS for maximum weight independent sets in unit disk graphs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 214\u2013221. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_18"},{"issue":"2","key":"6_CR26","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Math. Univ. Carol. 15(2), 307\u2013309 (1974)","journal-title":"Commentationes Math. Univ. Carol."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:24Z","timestamp":1709810964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_6","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":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}