{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:18:41Z","timestamp":1754558321576,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"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-3-031-38906-1_3","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Algorithms for\u00a0Cycle Hitting Problems on\u00a0Disk Graphs"],"prefix":"10.1007","author":[{"given":"Shinwoo","family":"An","sequence":"first","affiliation":[]},{"given":"Kyungjin","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"issue":"7","key":"3_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR2","unstructured":"An, S., Oh, E.: Feedback vertex set on geometric intersection graphs. In: Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pp. 47:1\u201347:12 (2021)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Lochet, W., Lokshtanov, D., Saurabh, S., Xue, J.: Subexponential parameterized algorithms for cut and cycle hitting problems on H-minor-free graphs$$\\star $$. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2063\u20132084. SIAM (2022)","DOI":"10.1137\/1.9781611977073.82"},{"key":"3_CR4","unstructured":"Bandyapadhyay, S., Lochet, W., Lokshtanov, D., Saurabh, S., Xue, J.: True contraction decomposition and almost eth-tight bipartization for unit-disk graphs. In: 38th International Symposium on Computational Geometry (SoCG 2022), vol. 224, pp. 11:1\u201311:16 (2022)"},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/20M1320870","volume":"49","author":"M de Berg","year":"2020","unstructured":"de Berg, M., Bodlaender, H.L., Kisfaludi-Bak, S., Marx, D., Van Der Zanden, T.C.: A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM J. Comput. 49(6), 1291\u20131331 (2020)","journal-title":"SIAM J. Comput."},{"key":"3_CR6","unstructured":"de Berg, M., Kisfaludi-Bak, S., Monemizadeh, M., Theocharous, L.: Clique-based separators for geometric intersection graphs. In: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pp. 22:1\u201322:15 (2021)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433160","volume":"68","author":"M Bonamy","year":"2021","unstructured":"Bonamy, M., et al.: EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs. J. ACM 68(2), 1\u201332 (2021)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"3_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM (JACM) 52(6), 866\u2013893 (2005)","journal-title":"J. ACM (JACM)"},{"key":"3_CR11","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Decomposition of map graphs with applications. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), pp. 60:1\u201360:15 (2019)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00454-018-00054-x","volume":"62","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Finding, hitting and packing cycles in subexponential time on unit disk graphs. Discrete Comput. Geom. 62(4), 879\u2013911 (2019)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1563\u20131575 (2012)","DOI":"10.1137\/1.9781611973099.124"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Nederlof, J.: Detecting feedback vertex sets of size $$k$$ in $$O^*(2.7 k)$$ time. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 971\u2013989 (2020)","DOI":"10.1137\/1.9781611975994.58"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2566616","volume":"11","author":"D Lokshtanov","year":"2014","unstructured":"Lokshtanov, D., Narayanaswamy, N., Raman, V., Ramanujan, M., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms (TALG) 11(2), 1\u201331 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Saurabh, S., Xue, J., Zehavi, M.: Subexponential parameterized algorithms on disk graphs (extended abstract). In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 2005\u20132031","DOI":"10.1137\/1.9781611977073.80"},{"key":"3_CR17","unstructured":"Lokshtanov, D., Saurabh, S., Wahlstr\u00f6m, M.: Subexponential parameterized odd cycle transversal on planar graphs. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2012)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/BF01759056","volume":"6","author":"H Rosenberger","year":"1991","unstructured":"Rosenberger, H.: Order-$$k$$ voronoi diagrams of sites with additive weights in the plane. Algorithmica 6(1), 490\u2013521 (1991)","journal-title":"Algorithmica"},{"key":"3_CR19","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures and upper bounds for satisfiability and related problems. Ph.D. thesis, Department of Computer and Information Science, Link\u00f6pings universitet (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:43Z","timestamp":1690473943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}