{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:52:12Z","timestamp":1742979132661,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"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-75409-8_5","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:49Z","timestamp":1737497449000},"page":"65-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Feedback Vertex Set for\u00a0Pseudo-disk Graphs in\u00a0Subexponential FPT Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0017-6922","authenticated-orcid":false,"given":"Ga\u00e9tan","family":"Berthe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9910-4656","authenticated-orcid":false,"given":"Marin","family":"Bougeret","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3228-9622","authenticated-orcid":false,"given":"Daniel","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4646-7602","authenticated-orcid":false,"given":"Jean-Florent","family":"Raymond","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"5_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-031-38906-1_3","volume-title":"WADS 2023","author":"S An","year":"2023","unstructured":"An, S., Cho, K., Oh, E.: Faster algorithms for cycle hitting problems on disk graphs. In: Morin, P., Suri, S. (eds.) WADS 2023. LNCS, vol. 14079, pp. 29\u201342. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38906-1_3"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Berthe, G., Bougeret, M., Gon\u00e7alves, D., Raymond, J.F.: Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius. In: Bodlaender, H.L. (ed.) 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0294, pp. 11:1\u201311:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2024.11, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.SWAT.2024.11","DOI":"10.4230\/LIPIcs.SWAT.2024.11"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, 1st edn. Springer, Cham (2015)","edition":"1"},{"issue":"6","key":"5_CR4","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 52(6), 866\u2013893 (2005). https:\/\/doi.org\/10.1145\/1101821.1101823","journal-title":"J. ACM"},{"key":"5_CR5","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics. 3rd edn, vol. 173. no. 33, p. 12 (2005)"},{"key":"5_CR6","unstructured":"Dvo\u0159\u00e1k, Z., Lokshtanov, D., Panolan, F., Saurabh, S., Xue, J., Zehavi, M.: Efficient approximation for subgraph-hitting problems in sparse graphs and geometric intersection graphs. arXiv e-prints pp. arXiv\u20132304 (2023)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jctb.2018.12.007","volume":"137","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z., Norin, S.: Treewidth of graphs with balanced separations. J. Comb. Theory, Series B 137, 137\u2013144 (2019). https:\/\/doi.org\/10.1016\/j.jctb.2018.12.007","journal-title":"J. Comb. Theory, Series B"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154833","volume":"65","author":"FV Fomin","year":"2018","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Excluded grid minors and efficient polynomial-time approximation schemes. J. ACM (JACM) 65(2), 1\u201344 (2018)","journal-title":"J. ACM (JACM)"},{"key":"5_CR9","unstructured":"Fox, J., Pach, J.: Touching stings (2012). private communication"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-62495-3_53","volume-title":"Graph Drawing","author":"J Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J.: Intersection graphs of noncrossing arc-connected sets in the plane. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 257\u2013270. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_53"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Lee, J.R.: Separators in region intersection graphs. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a067, pp. 1:1\u20131:8. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.1","DOI":"10.4230\/LIPIcs.ITCS.2017.1"},{"key":"5_CR12","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), pp. 2005\u20132031. SIAM (2022)","DOI":"10.1137\/1.9781611977073.80"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:51Z","timestamp":1737497451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_5","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":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}