{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:14:46Z","timestamp":1764785686474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_15","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"201-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Lossy Kernelization for\u00a0Connected Treedepth Deletion Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2628-3435","authenticated-orcid":false,"given":"Eduard","family":"Eiben","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4648","authenticated-orcid":false,"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2116-6048","authenticated-orcid":false,"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A Borchers","year":"1997","unstructured":"Borchers, A., Du, D.: The k-Steiner ratio in graphs. SIAM J. Comput. 26(3), 857\u2013869 (1997)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013)","DOI":"10.1145\/2432622.2432628"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31155-0_9","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"M Cygan","year":"2012","unstructured":"Cygan, M.: Deterministic parameterized connected vertex cover. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 95\u2013106. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_9"},{"key":"15_CR5","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. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1137\/110843071","volume":"27","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset feedback vertex set is fixed-parameter tractable. SIAM J. Discret. Math. 27(1), 290\u2013309 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"15_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Cham (2012)","edition":"4"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDs. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014)","DOI":"10.1145\/2650261"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"issue":"5","key":"15_CR10","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ejc.2011.09.014","volume":"33","author":"Z Dvor\u00e1k","year":"2012","unstructured":"Dvor\u00e1k, Z., Giannopoulou, A.C., Thilikos, D.M.: Forbidden graphs for tree-depth. Eur. J. Comb. 33(5), 969\u2013979 (2012)","journal-title":"Eur. J. Comb."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.jcss.2019.05.001","volume":"105","author":"E Eiben","year":"2019","unstructured":"Eiben, E., Hermelin, D., Ramanujan, M.S.: On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105, 158\u2013170 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1137\/18M1172508","volume":"33","author":"E Eiben","year":"2019","unstructured":"Eiben, E., Kumar, M., Mouawad, A.E., Panolan, F., Siebertz, S.: Lossy kernels for connected dominating set on sparse graphs. SIAM J. Discret. Math. 33(3), 1743\u20131771 (2019)","journal-title":"SIAM J. Discret. Math."},{"key":"15_CR13","unstructured":"Einarson, C., Gutin, G.Z., Jansen, B.M.P., Majumdar, D., Wahlstr\u00f6m, M.: p-edge\/vertex-connected vertex cover: parameterized and approximation algorithms. CoRR abs\/2009.08158 (2020)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 470\u2013479. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.62"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jcss.2016.09.002","volume":"84","author":"J Gajarsk\u00fd","year":"2017","unstructured":"Gajarsk\u00fd, J., et al.: Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84, 219\u2013242 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniform kernelization complexity of hitting forbidden minors. ACM Trans. Algorithms 13(3), 35:1\u201335:35 (2017)","DOI":"10.1145\/3029051"},{"key":"15_CR17","unstructured":"Hegerfeld, F., Kratsch, S.: Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, 10\u201313 March 2020. LIPIcs, vol. 154, pp. 29:1\u201329:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/s00453-014-9910-8","volume":"71","author":"D Hermelin","year":"2015","unstructured":"Hermelin, D., Kratsch, S., Soltys, K., Wahlstr\u00f6m, M., Wu, X.: A completeness theory for polynomial (Turing) kernelization. Algorithmica 71(3), 702\u2013730 (2015)","journal-title":"Algorithmica"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 104\u2013113 (2012)","DOI":"10.1137\/1.9781611973099.9"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2020.07.009","volume":"841","author":"BMP Jansen","year":"2020","unstructured":"Jansen, B.M.P., Pieterse, A.: Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. 841, 124\u2013166 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 224\u2013237 (2017)","DOI":"10.1145\/3055399.3055456"},{"issue":"2","key":"15_CR22","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s00453-012-9681-z","volume":"68","author":"N Misra","year":"2014","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S.: The kernelization complexity of connected domination in graphs with (no) small cycles. Algorithmica 68(2), 504\u2013530 (2014)","journal-title":"Algorithmica"},{"issue":"6","key":"15_CR23","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J Nesetril","year":"2006","unstructured":"Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"key":"15_CR24","unstructured":"Ramanujan, M.S.: An approximate kernel for connected feedback vertex set. In: 27th Annual European Symposium on Algorithms, ESA 2019, Munich\/Garching, Germany, 9\u201311 September 2019, pp. 77:1\u201377:14 (2019)"},{"key":"15_CR25","unstructured":"Ramanujan, M.S.: On approximate compressions for connected minor-hitting sets. In: 29th Annual European Symposium on Algorithms, ESA 2021 (2021)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"}],"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-15914-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:17:27Z","timestamp":1664536647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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","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":"12","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)"}}]}}