{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T18:57:46Z","timestamp":1770404266620,"version":"3.49.0"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SRG\/2023\/001592"],"award-info":[{"award-number":["SRG\/2023\/001592"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V007793\/1"],"award-info":[{"award-number":["EP\/V007793\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V044621\/1"],"award-info":[{"award-number":["EP\/V044621\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2026,3,31]]},"DOI":"10.1137\/23m1614031","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T08:25:41Z","timestamp":1770366341000},"page":"102-133","source":"Crossref","is-referenced-by-count":0,"title":["Highly Connected Steiner Subgraph: Parameterized Algorithms and Applications to Hitting Set Problems"],"prefix":"10.1137","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2628-3435","authenticated-orcid":true,"given":"Eduard","family":"Eiben","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, UK."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4648","authenticated-orcid":true,"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology Delhi, New Delhi, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, UK."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","published-online":{"date-parts":[[2026,2,6]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.11.024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00959-3"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"M. Bateni, E. D. Demaine, M. Hajiaghayi, and D. Marx, A PTAS for planar group steiner tree via spanner bootstrapping and prize collecting, in Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, D. Wichs and Y. Mansour, eds. ACM, 2016, pp. 2016, 570\u2013583.","DOI":"10.1145\/2897518.2897549"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.10.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11847250_18"},{"key":"ref6","first-page":"32:1","volume-title":"44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, LIPIcs 138","author":"Cerven\u00fd R.","year":"2019"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43380-1_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080716475"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/18M122371X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"C. M. H. de Figueiredo, R. Lopes, A. A. de Melo, and A. Silva, Parameterized algorithms for Steiner Tree and dominating set: Bounding the leafage by the vertex leafage, in WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings, Lecture Notes in Computer Science 13174, P. Mutzel, M. S. Rahman, and S. laminl, eds. Springer, 2022, pp. 251\u2013262.","DOI":"10.1007\/978-3-030-96731-4_21"},{"key":"ref12","series-title":"Graduate texts in mathematics","volume-title":"Graph Theory","volume":"173","author":"Diestel R.","year":"2012","edition":"4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.09.014"},{"key":"ref15","first-page":"45:1","volume-title":"48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 - Spetember 1, 2023, Bordeaux, France, LIPIcs 272","author":"Eiben E.","year":"2023"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2022.11.002"},{"key":"ref17","first-page":"27:1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, LIPIcs 55","author":"Feldmann A. E.","year":"2016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103604"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"M. R. Fellows and M. A. Langston, On search, decision and the efficiency of polynomial-time algorithms (extended abstract), in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, D. S. Johnson, ed. ACM, Seattle, Washington, USA, 1989, pp. 501\u2013512.","DOI":"10.1145\/73007.73055"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2886094"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3029051"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/140981290"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9868-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.05.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.03.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/a9010021"},{"key":"ref28","author":"Korhonen T.","year":"2021","journal-title":"SIAM J. Comput."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3170444"},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"D. Marx, M. Pilipczuk, and M. Pilipczuk, On subexponential parameterized algorithms for steiner tree and directed subset TSP on planar graphs, in 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, M. Thorup, ed. IEEE Computer Society, 2018, pp. 474\u2013484.","DOI":"10.1109\/FOCS.2018.00052"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"ref32","first-page":"92:1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom, LIPIcs 308","author":"Nutov Z.","year":"2024"},{"key":"ref33","volume-title":"Matroid Theory","author":"Oxley J. G.","year":"1992"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_783"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16926-7_19"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.12.001"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T08:25:45Z","timestamp":1770366345000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1614031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,6]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1137\/23M1614031"],"URL":"https:\/\/doi.org\/10.1137\/23m1614031","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,6]]}}}