{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:35:26Z","timestamp":1754487326127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_6","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"65-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Directed Feedback Vertex Set Parameterized by Treewidth"],"prefix":"10.1007","author":[{"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadiusz","family":"Soca\u0142a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Wrochna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Kowalik, L., Nederlof, J., Pilipczuk, M., Soca\u0142a, A., Wrochna, M.: On directed feedback vertex set parameterized by treewidth. arXiv abs\/1707.01470 (2017)","DOI":"10.1007\/978-3-030-00256-5_6"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/1411509.1411511","volume":"55","author":"J Chen","year":"2008","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 21:1\u201321:19 (2008)","journal-title":"J. ACM"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2700209","volume":"11","author":"RH Chitnis","year":"2015","unstructured":"Chitnis, R.H., Cygan, M., Hajiaghayi, M.T., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. ACM Trans. Algorithms 11(4), 28:1\u201328:28 (2015)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/12086217X","volume":"42","author":"RH Chitnis","year":"2013","unstructured":"Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42(4), 1674\u20131696 (2013)","journal-title":"SIAM J. Comput."},{"key":"6_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":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1007\/s00453-009-9296-1","volume":"58","author":"F Dorn","year":"2010","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica 58(3), 790\u2013810 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.20121","volume":"51","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53\u201381 (2006)","journal-title":"J. Graph Theory"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 55(2), 161\u2013166 (1985)","journal-title":"Discret. Math."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0012-365X(86)90224-4","volume":"62","author":"A Gy\u00e1rf\u00e1s","year":"1986","unstructured":"Gy\u00e1rf\u00e1s, A.: Corrigendum: on the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 62(3), 333 (1986)","journal-title":"Discret. Math."},{"issue":"3\u20134","key":"6_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.4064\/am-19-3-4-413-441","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Applicationes Mathematicae 19(3\u20134), 413\u2013441 (1987)","journal-title":"Applicationes Mathematicae"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.10.035","volume":"511","author":"EJ Kim","year":"2013","unstructured":"Kim, E.J., Gon\u00e7alves, D.: On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511, 109\u2013116 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/120904202","volume":"29","author":"S Kratsch","year":"2015","unstructured":"Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, M.: Fixed-parameter tractability of Multicut in directed acyclic graphs. SIAM J. Discret. Math. 29(1), 122\u2013144 (2015)","journal-title":"SIAM J. Discret. Math."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: new tools for kernelization. In: FOCS 2012, pp. 450\u2013459. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.46"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: SODA vol. 2011, pp. 760\u2013776 (2011)","DOI":"10.1137\/1.9781611973082.60"},{"key":"6_CR15","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S.: A linear time parameterized algorithm for directed feedback vertex set. CoRR abs\/1609.04347 (2016)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On two minimax theorems in graph. J. Comb. Theory, Ser. B 21(2), 96\u2013103 (1976)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. London Math. Soc 17, 369\u2013374 (1978)","journal-title":"J. London Math. Soc"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Wahlstr\u00f6m, M.: Directed multicut is $${W}[1]$$-hard, even for four terminal pairs. In: SODA 2016, pp. 1167\u20131178. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch81"},{"key":"6_CR19","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"PD Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"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-030-00256-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:20Z","timestamp":1710336260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","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":"Cottbus","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"45% - 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":"4","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":"11,5","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)"}}]}}