{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:48:34Z","timestamp":1760042914017,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819967056"},{"type":"electronic","value":"9789819967063"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-6706-3_29","type":"book-chapter","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T11:02:34Z","timestamp":1700910154000},"page":"327-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classical and\u00a0Parameterized Complexity of\u00a0Line Segment Covering Problems in\u00a0Arrangement"],"prefix":"10.1007","author":[{"given":"M.","family":"Rema","sequence":"first","affiliation":[]},{"given":"R.","family":"Subashini","sequence":"additional","affiliation":[]},{"given":"Subhasree","family":"Methirumangalath","sequence":"additional","affiliation":[]},{"given":"Varun","family":"Rajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, A., Murty, U.: Planar Graphs, Graph Theory, Graduate Texts in Mathematics, 244, Theorem 10.28, p. 267. Springer, Berlin (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"3","key":"29_CR2","first-page":"139","volume":"15","author":"P Bose","year":"2013","unstructured":"Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., Taslakian, P.: Coloring and guarding line arrangements. Discrete Math. Theor. Comput0 Sci. 15(3), 139\u2013154 (2013)","journal-title":"Discrete Math. Theor. Comput0 Sci."},{"key":"29_CR3","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-41498-5_4","volume-title":"Geometry\u2014Intuitive, Discrete, and Convex","author":"P Brass","year":"2013","unstructured":"Brass, P.: Geometric problems on coverage in sensor networks. In: B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K.J., T\u00f3th, G.F., Pach, J. (eds.) Geometry\u2014Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol. 24, pp. 91\u2013108. Springer, Berlin, Heidelberg (2013)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.tcs.2010.08.014","volume":"412","author":"VE Brimkov","year":"2011","unstructured":"Brimkov, V.E., Leach, A., Mastroianni, M., Wu, J.: Guarding a set of line segments in the plane. Theor. Comput. Sci. 412, 1313\u20131324 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.dam.2011.11.023","volume":"160","author":"VE Brimkov","year":"2012","unstructured":"Brimkov, V.E., Leach, A., Wub, J., Mastroianni, M.: Approximation algorithms for a geometric set cover problem. Discrete Appl. Math. 160, 1039\u20131052 (2012)","journal-title":"Discrete Appl. Math."},{"key":"29_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill Science\/Engineering\/Math, 2 edn. (2001)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Das, G., Goodrich, M.T.: On the complexity of approximating and illuminating three-dimensional convex polyhedra. In: Proceeding of the 4th Workshop Algorithms Dara Structure, Lecture Notes in Computer Science. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60220-8_52"},{"issue":"5","key":"29_CR9","first-page":"622","volume":"16","author":"V Estivill-Castro","year":"2010","unstructured":"Estivill-Castro, V., Heednacram, A., Suraweera, F.: Np-completeness and fpt results for rectilinear covering problems. J. Univers. Comput. Sci. 16(5), 622\u2013652 (2010)","journal-title":"J. Univers. Comput. Sci."},{"key":"29_CR10","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta. Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta. Sci. Math. (Szeged)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Gavrilova, M.L.: Computational geometry methods and intelligent computing. In: Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence. vol.\u00a0158, pp. 3\u201310. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85126-4_1"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. In: STACS 84: Symposium of Theoretical Aspects of Computer Science, pp. 55\u201362. Paris (1984)","DOI":"10.1007\/3-540-12920-0_5"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Joshi, A., Narayanaswamy, N.S.: Approximation algorithms for hitting triangle-free sets of line segments. In: Algorithm Theory SWAT 2014. Lecture Notes in Computer Science. vol.\u00a08503, pp. 357\u2013367 (2014)","DOI":"10.1007\/978-3-319-08404-6_31"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Das, G.K., Roy, S., Das, S., Nandy, S.C.: Variations of base station placement problem on the boundary of a convex region. Int. J. Found. Comput. Sci. 19(2), 405\u2013427 (2008)","DOI":"10.1142\/S0129054108005747"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ipl.2017.09.002","volume":"129","author":"M Korman","year":"2018","unstructured":"Korman, M., Poon, S.H., Roeloffzen, M.: Line segment covering of cells in arrangements. Inf. Process. Lett. 129, 25\u201330 (2018)","journal-title":"Inf. Process. Lett."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.3846\/bme.2014.08","volume":"12","author":"I Lapinskait\u0117","year":"2014","unstructured":"Lapinskait\u0117, I., Kuckailyt\u0117, J.: The impact of supply chain cost on the price of the final product. Bus. Manage. Educ. 12, 109\u2013126 (2014)","journal-title":"Bus. Manage. Educ."},{"key":"29_CR17","unstructured":"Tanimoto, S.L., Fowler, R.J.: Covering image subsets with patches. In: Proceedings of the 5th International Conference on Pattern Recognition, vol.\u00a02, pp. 835\u2013839. MiamiBeach, Florida, USA (1980)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Whitney, H.: 2-isomorphic graphs. Amer. J. Math. pp. 245\u2013254 (1933)","DOI":"10.1515\/9783112389966-015"},{"issue":"8","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1109\/TMC.2011.126","volume":"11","author":"D Yang","year":"2012","unstructured":"Yang, D., Misra, S., Fang, X., Xue, G., Zhang, J.: Two-tiered constrained relay node placement in wireless sensor networks: computational complexity and efficient approximations. IEEE Trans. Mob. Comput. 11(8), 1399\u20131411 (2012)","journal-title":"IEEE Trans. Mob. Comput."}],"container-title":["Smart Innovation, Systems and Technologies","Intelligent Data Engineering and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-6706-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T11:09:47Z","timestamp":1700910587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-6706-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819967056","9789819967063"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-6706-3_29","relation":{},"ISSN":["2190-3018","2190-3026"],"issn-type":[{"type":"print","value":"2190-3018"},{"type":"electronic","value":"2190-3026"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FICTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Frontiers of Intelligent Computing: Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cardiff","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ficta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ficta.co.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}