{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:18:42Z","timestamp":1743045522283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_13","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"183-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data Reduction for\u00a0Directed Feedback Vertex Set on\u00a0Graphs Without Long Induced Cycles"],"prefix":"10.1007","author":[{"given":"Jona","family":"Dirks","sequence":"first","affiliation":[]},{"given":"Enna","family":"Gerhard","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Grobler","sequence":"additional","affiliation":[]},{"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Siebertz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"7","key":"13_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."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s00453-015-0038-2","volume":"76","author":"J Bang-Jensen","year":"2016","unstructured":"Bang-Jensen, J., Maddaloni, A., Saurabh, S.: Algorithms and kernels for feedback set problems in generalizations of tournaments. Algorithmica 76(2), 320\u2013343 (2016)","journal-title":"Algorithmica"},{"key":"13_CR3","unstructured":"Bergenthal, M., et al.: Pace solver description: Grapa-java. In: IPEC 2022. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s00453-020-00777-5","volume":"83","author":"B Bergougnoux","year":"2021","unstructured":"Bergougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., Ramanujan, M.: Towards a polynomial kernel for directed feedback vertex set. Algorithmica 83(5), 1201\u20131221 (2021)","journal-title":"Algorithmica"},{"issue":"6","key":"13_CR5","first-page":"1071","volume":"77","author":"S Bessy","year":"2011","unstructured":"Bessy, S., et al.: Kernels for feedback arc set in tournaments. JCSS 77(6), 1071\u20131078 (2011)","journal-title":"JCSS"},{"key":"13_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-00256-5_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Bonamy","year":"2018","unstructured":"Bonamy, M., Kowalik, \u0141, Nederlof, J., Pilipczuk, M., Soca\u0142a, A., Wrochna, M.: On directed feedback vertex set parameterized by treewidth. In: Brandstadt, A., Kohler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 65\u201378. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_6"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC 2008, pp. 177\u2013186 (2008)","DOI":"10.1145\/1374376.1374404"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00224-013-9480-1","volume":"54","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: On the hardness of losing width. Theory Comput. Syst. 54(1), 73\u201382 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., Van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. JACM 61(4), 1\u201327 (2014)","journal-title":"JACM"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Dirks, J., Gerhard, E., Grobler, M., Mouawad, A.E., Siebertz, S.: Data reduction for directed feedback vertex set on graphs without long induced cycles. arXiv preprint arXiv:2308.15900 (2023)","DOI":"10.1007\/978-3-031-52113-3_13"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jda.2009.08.001","volume":"8","author":"M Dom","year":"2010","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Tru\u00df, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1), 76\u201386 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"13_CR12","unstructured":"Drange, P.G., et al.: Kernelization and sparseness: the case of dominating set. In: STACS 2016, LIPIcs, vol. 47, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Dreier, J., M\u00e4hlmann, N., Siebertz, S.: First-order model checking on structurally sparse graph classes. In: STOC 2023, pp. 567\u2013580. ACM (2023)","DOI":"10.1145\/3564246.3585186"},{"key":"13_CR14","unstructured":"Eickmeyer, K., et al.: Neighborhood complexity and kernelization for nowhere dense classes of graphs. In: ICALP 2017, LIPIcs, vol. 80, pp. 63:1\u201363:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"1","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc. 1(1), 85\u201390 (1960)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G Even","year":"1998","unstructured":"Even, G., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-662-48054-0_25","volume-title":"Mathematical Foundations of Computer Science 2015","author":"S Fafianie","year":"2015","unstructured":"Fafianie, S., Kratsch, S.: A shortcut to (sun)flowers: kernels in logarithmic space or linear time. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 299\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_25"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"MR Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13(3), 266\u2013282 (1995)","journal-title":"Algorithmica"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-04128-0_55","volume-title":"Algorithms - ESA 2009","author":"R Fleischer","year":"2009","unstructured":"Fleischer, R., Wu, X., Yuan, L.: Experimental study of FPT algorithms for the directed feedback vertex set problem. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 611\u2013622. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_55"},{"issue":"1","key":"13_CR20","first-page":"1","volume":"15","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Le, T., Lokshtanov, D., Saurabh, S., Thomass\u00e9, S., Zehavi, M.: Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. TALG 15(1), 1\u201344 (2019)","journal-title":"TALG"},{"key":"13_CR21","unstructured":"Fomin, F.V., Le, T., Lokshtanov, D., Saurabh, S., Thomasse, S., Zehavi, M.: Lossy kernelization for (implicit) hitting set problems. arXiv preprint arXiv:2308.05974 (2023)"},{"key":"13_CR22","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3051095","volume":"64","author":"M Grohe","year":"2017","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. JACM 64(3), 1\u201332 (2017)","journal-title":"JACM"},{"key":"13_CR24","unstructured":"Gro\u00dfmann, E., Heuer, T., Schulz, C., Strash, D.: The pace 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set. In: IPEC 2022. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1137\/090756144","volume":"40","author":"V Guruswami","year":"2011","unstructured":"Guruswami, V., H\u00e5stad, J., Manokaran, R., Raghavendra, P., Charikar, M.: Beating the random ordering is hard: Every ordering CSP is approximation resistant. SICOMP 40(3), 878\u2013914 (2011)","journal-title":"SICOMP"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a006","volume":"12","author":"V Guruswami","year":"2016","unstructured":"Guruswami, V., Lee, E.: Simple proof of hardness of feedback vertex set. Theory Comput. 12(1), 1\u201311 (2016)","journal-title":"Theory Comput."},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.tcs.2005.10.021","volume":"351","author":"R Haas","year":"2006","unstructured":"Haas, R., Hoffmann, M.: Chordless paths through three vertices. TCS 351(3), 360\u2013371 (2006)","journal-title":"TCS"},{"key":"13_CR28","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"35","key":"13_CR29","doi-asserted-by":"publisher","first-page":"4688","DOI":"10.1016\/j.tcs.2011.05.003","volume":"412","author":"S Kreutzer","year":"2011","unstructured":"Kreutzer, S., Ordyniak, S.: Digraph decompositions and monotonicity in digraph searching. TCS 412(35), 4688\u20134703 (2011)","journal-title":"TCS"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Rabinovich, R., Siebertz, S.: Polynomial kernels and wideness properties of nowhere dense graph classes. ACM Trans. Algorithms 15(2), 24:1\u201324:19 (2019)","DOI":"10.1145\/3274652"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Misra, P., Ramanujan, M., Saurabh, S., Zehavi, M.: FPT-approximation for FPT problems. In: SODA 2021, pp. 199\u2013218. SIAM (2021)","DOI":"10.1137\/1.9781611976465.14"},{"key":"13_CR32","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S.: A linear time parameterized algorithm for directed feedback vertex set. CoRR abs\/1609.04347 (2016)"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-030-24766-9_38","volume-title":"Algorithms and Data Structures","author":"D Lokshtanov","year":"2019","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S., Sharma, R., Zehavi, M.: Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 523\u2013537. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_38"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Grad and classes with bounded expansion i. decompositions. Eur. J. Comb 29(3), 760\u2013776 (2008)","DOI":"10.1016\/j.ejc.2006.07.013"},{"issue":"4","key":"13_CR35","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ejc.2011.01.006","volume":"32","author":"J Ne\u0161et\u0159il","year":"2011","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: On nowhere dense graphs. Eur. J. Comb. 32(4), 600\u2013617 (2011)","journal-title":"Eur. J. Comb."},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Siebertz, S., Toru\u0144czyk, S.: On the number of types in sparse graphs. In: LICS 2018, pp. 799\u2013808. ACM (2018)","DOI":"10.1145\/3209108.3209178"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Razgon, I.: Computing minimum directed feedback vertex set in $$o*(1.9977^n)$$. In: TCS, pp. 70\u201381. World Scientific (2007)","DOI":"10.1142\/9789812770998_0010"},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"PD Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-32512-0_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"O Svensson","year":"2012","unstructured":"Svensson, O.: Hardness of vertex deletion and project scheduling. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM -2012. LNCS, vol. 7408, pp. 301\u2013312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_26"},{"issue":"1","key":"13_CR40","first-page":"129","volume":"70","author":"R Van Bevern","year":"2014","unstructured":"Van Bevern, R.: Towards optimal and expressive kernelization for d-hitting set. Algorithmica 70(1), 129\u2013147 (2014)","journal-title":"Algorithmica"},{"key":"13_CR41","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. ALEX, 1\u20138 (1998)"},{"key":"13_CR42","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.dam.2016.11.007","volume":"219","author":"J You","year":"2017","unstructured":"You, J., Wang, J., Cao, Y.: Approximate association via dissociation. Discret. Appl. Math. 219, 202\u2013209 (2017)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:03:55Z","timestamp":1711569835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}