{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:51Z","timestamp":1742912451160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_11","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:45Z","timestamp":1738706205000},"page":"121-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partial Domination in\u00a0Some Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Madhura","family":"Dutta","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O Amini","year":"2011","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6), 1159\u20131171 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19, 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"key":"11_CR4","unstructured":"Case, B.M., Hedetniemi, S.T., Laskar, R.C., Lipman, D.J.: Partial domination in graphs. In: Southeastern International Conference on Combinatorics, Graph Theory and Computing, 6\u201310 March 2017"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chang, G.J.: Algorithmic Aspects of Domination in Graphs. Springer (2013)","DOI":"10.1007\/978-1-4419-7997-1_26"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"MS Chang","year":"1998","unstructured":"Chang, M.S.: Efficient algorithms for the domination problems on interval and circular arc graphs. SIAM J. Comput. 27, 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1\u201317","key":"11_CR7","first-page":"15","volume":"17","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., De, M., Ravsky, A., Spoerhase, J.: Approximation schemes for geometric coverage problems. ESA 17(1\u201317), 15 (2018)","journal-title":"ESA"},{"key":"11_CR8","unstructured":"Chung, C., Vignaron, A., Ahn, H.K.: Maximum coverage by $$k$$ lines, Unpublished manuscript (2023)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E Cockayne","year":"1975","unstructured":"Cockayne, E., Goodman, S., Hedetniemi, S.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4, 41\u201344 (1975)","journal-title":"Inf. Process. Lett."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/s40995-018-0618-5","volume":"43","author":"A Das","year":"2019","unstructured":"Das, A.: Partial domination in graphs. Iranian J. Sci. Technol. Trans. A: Sci. 43, 1713\u20131718 (2019)","journal-title":"Iranian J. Sci. Technol. Trans. A: Sci."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Das, A., Laskar, R.C., N., Rad, J.: On $$\\alpha $$-domination in graphs. Graphs Combinatorics 34, 193\u2013205 (2018)","DOI":"10.1007\/s00373-017-1869-1"},{"key":"11_CR12","unstructured":"Domke, B.S., Fricke, G.H., Laskar, R.R., Majumdar, A.: Fractional domination and related parameters. In: Haynes, T.W., Hedetniemi, S.T., Slator, P.J. (eds.) Domination in Graphs, Chapter 3, Taylor & Francis (1998)"},{"key":"11_CR13","unstructured":"Dutta, M., Maheshwari, A., Nandy. S.C.: Partial domination in some geometric intersection graphs (2024)"},{"issue":"16","key":"11_CR14","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16), 814\u2013818 (2011)","journal-title":"Inf. Process. Lett."},{"key":"11_CR15","unstructured":"Garey, M.R., Johnson, D.S., Klee, V. (ed.). Computers and intractability: a guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. San Francisco, Calif.: W. H. Freeman and Co. (1979)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"11_CR17","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.). Domination in Graphs: Advanced Topics, Marcel Dekker, New York (1998)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"11_CR19","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Wimer, T.: Linear time resource allocation algorithms for trees. Technical Reptort, (1987). URI-014"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"HB Hunt III","year":"1998","unstructured":"Hunt, H.B., III., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 26, 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the Spread of Influence through a Social Network. Theory of Computing - An Open Access Journal. vol. 11, Article 4, pp. 105\u2013147 (2015)","DOI":"10.4086\/toc.2015.v011a004"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69507-3_31","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"J Kneis","year":"2007","unstructured":"Kneis, J., M\u00f6lle, D., Rossmanith, P.: Partial vs. complete domination: t-dominating set. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 367\u2013376. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_31"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Lan, J.K., Chang, G.J.: Algorithmic aspects of the $$k$$-domination problem in graphs. Discrete Appl. Math. 161, 1513\u20131520 (2013)","DOI":"10.1016\/j.dam.2013.01.015"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/s10878-020-00685-y","volume":"41","author":"S Pandit","year":"2021","unstructured":"Pandit, S.: Dominating set of rectangles intersecting a straight line. J. Comb. Optim. 41(2), 414\u2013432 (2021). https:\/\/doi.org\/10.1007\/s10878-020-00685-y","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:57:06Z","timestamp":1738706226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}