{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:27:41Z","timestamp":1774362461275,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":30,"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_30","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:57Z","timestamp":1770977217000},"page":"451-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Further Results on\u00a0Rendering Geometric Intersection Graphs Sparse by\u00a0Dispersion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1969-3649","authenticated-orcid":false,"given":"Nicol\u00e1s","family":"Honorato-Droguett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7638-3322","authenticated-orcid":false,"given":"Kazuhiro","family":"Kurita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-3947","authenticated-orcid":false,"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2025.01.034","author":"A Agnetis","year":"2025","unstructured":"Agnetis, A., Billaut, J.C., Pinedo, M., Shabtay, D.: Fifty years of research in scheduling - theory and applications. Europ. J. Oper. Res. (2025). https:\/\/doi.org\/10.1016\/j.ejor.2025.01.034","journal-title":"Europ. J. Oper. Res."},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"MA Bekos","year":"2007","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: models and efficient algorithms for rectangular maps. Comput. Geom. 36(3), 215\u2013236 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.05.003","journal-title":"Comput. Geom."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2018.10.007","volume":"769","author":"M de Berg","year":"2019","unstructured":"de Berg, M., Kisfaludi-Bak, S., Woeginger, G.J.: The complexity of dominating set in geometric intersection graphs. Theoret. Comput. Sci. 769, 18\u201331 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.10.007","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR4","doi-asserted-by":"publisher","unstructured":"Bonerath, A., N\u00f6llenburg, M., Terziadis, S., Wallinger, M., Wulms, J.: Boundary labeling in a circular orbit. In: GD 2024. Schloss Dagstuhl \u2013 LZI (2024). https:\/\/doi.org\/10.4230\/LIPICS.GD.2024.22","DOI":"10.4230\/LIPICS.GD.2024.22"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-14785-2_3","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14785-2_3"},{"key":"30_CR7","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory. Graduate texts in mathematics, 5th edn. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972). https:\/\/doi.org\/10.1145\/321694.321699","journal-title":"J. ACM"},{"issue":"12","key":"30_CR9","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1109\/TVCG.2012.193","volume":"18","author":"M Fink","year":"2012","unstructured":"Fink, M., Haunert, J.H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for labeling focus regions. IEEE Trans. Vis. Comput. Graphics 18(12), 2583\u20132592 (2012). https:\/\/doi.org\/10.1109\/TVCG.2012.193","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Inamdar, T., Saurabh, S., Zehavi, M.: Kernelization for spreading points. In: ESA. LIPIcs, vol.\u00a0274, pp. 48:1\u201348:16. Schloss Dagstuhl \u2013 LZI (2023). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2023.48","DOI":"10.4230\/LIPICS.ESA.2023.48"},{"issue":"4","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1007\/s00454-024-00633-1","volume":"72","author":"FV Fomin","year":"2024","unstructured":"Fomin, F.V., Golovach, P.A., Inamdar, T., Saurabh, S., Zehavi, M.: (re)packing equal disks into rectangle. Discrete Comput. Geom. 72(4), 1596\u20131629 (2024). https:\/\/doi.org\/10.1007\/s00454-024-00633-1","journal-title":"Discrete Comput. Geom."},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Inamdar, T., Saurabh, S., Zehavi, M.: Parameterized geometric graph modification with disk scaling. In: ITCS. LIPIcs, vol.\u00a0325, pp. 51:1\u201351:17. Schloss Dagstuhl \u2013 LZI (2025). https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2025.51","DOI":"10.4230\/LIPICS.ITCS.2025.51"},{"key":"30_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/s089548019936223x","volume":"15","author":"MX Goemans","year":"2002","unstructured":"Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM J. Discrete Math. 15(2), 165\u2013192 (2002). https:\/\/doi.org\/10.1137\/s089548019936223x","journal-title":"SIAM J. Discrete Math."},{"key":"30_CR15","doi-asserted-by":"publisher","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979). https:\/\/doi.org\/10.1016\/s0167-5060(08)70356-x","DOI":"10.1016\/s0167-5060(08)70356-x"},{"issue":"6","key":"30_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10951-019-00601-1","volume":"22","author":"P Gy\u00f6rgyi","year":"2019","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Schedul. 22(6), 623\u2013634 (2019). https:\/\/doi.org\/10.1007\/s10951-019-00601-1","journal-title":"J. Schedul."},{"key":"30_CR17","doi-asserted-by":"publisher","unstructured":"Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.: Algorithms for optimally shifting intervals under intersection graph models. In: Li, B., Li, M., Sun, X. (eds.) IJTCS-FAW 2024. LNCS, vol. 14752, pp. 66\u201378. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-97-7752-5_5","DOI":"10.1007\/978-981-97-7752-5_5"},{"key":"30_CR18","doi-asserted-by":"publisher","unstructured":"Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.: On the complexity of minimising the moving distance for dispersing objects. In: WADS, vol.\u00a0349, pp. 36:1\u201336:14. Schloss Dagstuhl\u00a0\u2013 LZI (2025). https:\/\/doi.org\/10.4230\/LIPICS.WADS.2025.36","DOI":"10.4230\/LIPICS.WADS.2025.36"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H., Wolff, A.: Further results on rendering geometric intersection graphs sparse by dispersion (2025). https:\/\/arxiv.org\/abs\/2509.20903","DOI":"10.1007\/978-981-95-7127-7_30"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00453-015-0028-4","volume":"76","author":"P Kindermann","year":"2015","unstructured":"Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-sided boundary labeling. Algorithmica 76(1), 225\u2013258 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0028-4","journal-title":"Algorithmica"},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1017\/jpr.2016.33","volume":"53","author":"E Kranakis","year":"2016","unstructured":"Kranakis, E., Shaikhet, G.: Sensor allocation problems on the real line. J. Appl. Prob. 53(3), 667\u2013687 (2016). https:\/\/doi.org\/10.1017\/jpr.2016.33","journal-title":"J. Appl. Prob."},{"issue":"5","key":"30_CR22","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19(5), 544\u2013546 (1973). https:\/\/doi.org\/10.1287\/mnsc.19.5.544","journal-title":"Manag. Sci."},{"key":"30_CR23","doi-asserted-by":"publisher","unstructured":"Lenstra, J.K., Rinnooy\u00a0Kan, A.H., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977). https:\/\/doi.org\/10.1016\/s0167-5060(08)70743-x","DOI":"10.1016\/s0167-5060(08)70743-x"},{"key":"30_CR24","doi-asserted-by":"publisher","unstructured":"Li, S., Wang, H.: Algorithms for minimizing the movements of spreading points in linear domains. Comput. Geom. Topol. 4(1), 1:1\u20131:15 (2025). https:\/\/doi.org\/10.57717\/CGT.V4I1.21","DOI":"10.57717\/CGT.V4I1.21"},{"issue":"3","key":"30_CR25","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1111\/cgf.13722","volume":"38","author":"W Meulemans","year":"2019","unstructured":"Meulemans, W.: Efficient optimal overlap removal: algorithms and experiments. Comput. Graph. Forum 38(3), 713\u2013723 (2019). https:\/\/doi.org\/10.1111\/cgf.13722","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"30_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.3934\/jimo.2014.10.219","volume":"10","author":"MO Adamu","year":"2014","unstructured":"Adamu, M.O., Adewumi, A.O.: A survey of single machine scheduling to minimize weighted number of tardy jobs. J. Indust. Manag. Optim. 10(1), 219\u2013241 (2014). https:\/\/doi.org\/10.3934\/jimo.2014.10.219","journal-title":"J. Indust. Manag. Optim."},{"issue":"2","key":"30_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/3648594","volume":"20","author":"F Panolan","year":"2024","unstructured":"Panolan, F., Saurabh, S., Zehavi, M.: Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. ACM Trans. Algorithms 20(2), 15 (2024). https:\/\/doi.org\/10.1145\/3648594","journal-title":"ACM Trans. Algorithms"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05921-6","DOI":"10.1007\/978-3-031-05921-6"},{"key":"30_CR29","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer, Cham (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"30_CR30","doi-asserted-by":"publisher","unstructured":"Xue, J., Zehavi, M.: Parameterized algorithms on geometric intersection graphs. Comput. Sci. Rev. 58, 100796:1\u201311 (2025). https:\/\/doi.org\/10.1016\/j.cosrev.2025.100796","DOI":"10.1016\/j.cosrev.2025.100796"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:16:38Z","timestamp":1774325798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_30","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"}}]}}