{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:18Z","timestamp":1758586218131,"version":"3.44.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-3-032-04700-7_10","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:43Z","timestamp":1758498343000},"page":"122-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Distance-d Independent Set Problems for\u00a0Some Graph Classes"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Das","sequence":"first","affiliation":[]},{"given":"Soura Sena","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sweta","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sk Samim","family":"Islam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"1\u20133","key":"10_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. Discret. Appl. Math. 132(1\u20133), 3\u201316 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"10_CR2","first-page":"3","volume":"135","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discret. Appl. Math. 135(1\u20133), 3\u201316 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"10_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2004.08.046","volume":"299","author":"A Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Hammer, P.L., Lozin, V.V., et al.: Bisplit graphs. Discret. Math. 299(1\u20133), 11\u201332 (2005)","journal-title":"Discret. Math."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"H Broersma","year":"1999","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discret. Math. 12(2), 276\u2013287 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chang, J.M., Ho, C.W., Ko, M.T.: Powers of asteroidal triple-free graphs with applications. Ars Comb. 67 (2003). https:\/\/api.semanticscholar.org\/CorpusID:9862925","DOI":"10.1016\/S0166-218X(03)00390-1"},{"issue":"1\u20133","key":"10_CR6","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."},{"key":"10_CR7","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook, pp. 143\u2013152 (2023)"},{"issue":"1\u20132","key":"10_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness ii: On completeness for w [1]. Theoret. Comput. Sci. 141(1\u20132), 109\u2013131 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR9","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":"10_CR10","doi-asserted-by":"crossref","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximability of the distance independent set problem on regular graphs and planar graphs. In: International Conference on Combinatorial Optimization and Applications, pp. 270\u2013284. Springer (2016)","DOI":"10.1007\/978-3-319-48749-6_20"},{"issue":"9","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1587\/transfun.2021DMP0017","volume":"105","author":"H Eto","year":"2022","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximability of the distance independent set problem on regular graphs and planar graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105(9), 1211\u20131222 (2022)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"20","key":"10_CR12","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discret. Math. 310(20), 2742\u20132749 (2010)","journal-title":"Discret. Math."},{"key":"10_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol.\u00a0174. freeman San Francisco (1979)"},{"key":"10_CR14","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 (1974)","DOI":"10.1145\/800119.803884"},{"issue":"2","key":"10_CR15","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":"10_CR16","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-78455-7_6","volume-title":"Frontiers in Algorithmics","author":"SK Jena","year":"2018","unstructured":"Jena, S.K., Jallu, R.K., Das, G.K., Nandy, S.C.: The maximum distance-d independent set problem on unit disk graphs. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 68\u201380. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_6"},{"key":"10_CR18","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Springer (2010)"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"RM Karp","year":"1985","unstructured":"Karp, R.M., Wigderson, A.: A fast parallel algorithm for the maximal independent set problem. J. ACM (JACM) 32(4), 762\u2013773 (1985)","journal-title":"J. ACM (JACM)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lokshantov, D., Vatshelle, M., Villanger, Y.: Independent set in $$P_5$$-free graphs in polynomial time. In: Proceedings of The Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 570\u2013581. SIAM (2014)","DOI":"10.1137\/1.9781611973402.43"},{"issue":"1","key":"10_CR21","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. Theor. Series B 82(1), 102\u2013117 (2001)","journal-title":"J. Comb. Theor. Series B"},{"issue":"2","key":"10_CR22","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Comment. Math. Univ. Carol. 15(2), 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:46Z","timestamp":1758498346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}