{"id":"https://openalex.org/W4313179894","doi":"https://doi.org/10.1007/978-3-031-15914-5_12","title":"Kernelization for\u00a0Feedback Vertex Set via\u00a0Elimination Distance to\u00a0a\u00a0Forest","display_name":"Kernelization for\u00a0Feedback Vertex Set via\u00a0Elimination Distance to\u00a0a\u00a0Forest","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4313179894","doi":"https://doi.org/10.1007/978-3-031-15914-5_12"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-15914-5_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050646219","display_name":"David J.C. Dekker","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"David Dekker","raw_affiliation_strings":["Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51892849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"158","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9513999819755554,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9291259050369263},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.8740814328193665},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7492753863334656},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7206621170043945},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6896853446960449},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5809625387191772},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5044161081314087},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"Polynomial kernel","score":0.49962854385375977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4868461489677429},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4790003001689911},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46611979603767395},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.43873822689056396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39479896426200867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21411588788032532},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09625458717346191},{"id":"https://openalex.org/keywords/kernel-method","display_name":"Kernel method","score":0.09337535500526428}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9291259050369263},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.8740814328193665},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7492753863334656},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7206621170043945},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6896853446960449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5809625387191772},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5044161081314087},{"id":"https://openalex.org/C160446489","wikidata":"https://www.wikidata.org/wiki/Q7226642","display_name":"Polynomial kernel","level":4,"score":0.49962854385375977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4868461489677429},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4790003001689911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46611979603767395},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.43873822689056396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39479896426200867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21411588788032532},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09625458717346191},{"id":"https://openalex.org/C122280245","wikidata":"https://www.wikidata.org/wiki/Q620622","display_name":"Kernel method","level":3,"score":0.09337535500526428},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-15914-5_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/91f567e8-2e6e-442e-b103-886b49949785","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/91f567e8-2e6e-442e-b103-886b49949785","pdf_url":"https://pure.tue.nl/ws/files/358310523/978-3-031-15914-5_12.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dekker, D & Jansen, B M P 2022, Kernelization for\u00a0Feedback Vertex Set via\u00a0Elimination Distance to\u00a0a\u00a0Forest. in M A Bekos & M Kaufmann (eds), Graph-Theoretic Concepts in Computer Science : 48th International Workshop, WG 2022, T\u00fcbingen, Germany, June 22\u201324, 2022, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), vol. 13453, Springer, Cham, pp. 158-172, 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, T\u00fcbingen, Germany, 22/06/22. https://doi.org/10.1007/978-3-031-15914-5_12","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-15914-5_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.7400000095367432}],"awards":[{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8368575583","display_name":"Rigorous Search Space Reduction","funder_award_id":"803421","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313179894.pdf","grobid_xml":"https://content.openalex.org/works/W4313179894.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W150157909","https://openalex.org/W1558630420","https://openalex.org/W1971818177","https://openalex.org/W1974692335","https://openalex.org/W1996472240","https://openalex.org/W2013415302","https://openalex.org/W2026771935","https://openalex.org/W2034437384","https://openalex.org/W2043644213","https://openalex.org/W2077654620","https://openalex.org/W2099200602","https://openalex.org/W2116087731","https://openalex.org/W2128317498","https://openalex.org/W2401610261","https://openalex.org/W2487525817","https://openalex.org/W2789598654","https://openalex.org/W2790946280","https://openalex.org/W2963326511","https://openalex.org/W2963685860","https://openalex.org/W2964248725","https://openalex.org/W3038050706","https://openalex.org/W3122973673","https://openalex.org/W3166550250","https://openalex.org/W4253175698"],"related_works":["https://openalex.org/W150157909","https://openalex.org/W2789598654","https://openalex.org/W2168711306","https://openalex.org/W1990046850","https://openalex.org/W1788810336","https://openalex.org/W2774537136","https://openalex.org/W2195812222","https://openalex.org/W4300446593","https://openalex.org/W2963832031","https://openalex.org/W3003329734"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"efficient":[3],"preprocessing":[4],"for":[5,20,37,51,92,95,119,164],"the":[6,52,59,87,102,109,132,168],"undirected":[7],"Feedback":[8,76,96,127,169],"Vertex":[9,54,77,97,128,170],"Set":[10,78,98,129,171],"problem,":[11],"a":[12,21,43,47,106,135,141,155],"fundamental":[13],"problem":[14,41,56,69],"in":[15],"graph":[16,122],"theory":[17],"which":[18,38],"asks":[19],"minimum-sized":[22],"vertex":[23],"set":[24],"whose":[25],"removal":[26],"yields":[27],"an":[28,67],"acyclic":[29],"graph.":[30],"More":[31],"precisely,":[32],"we":[33,116],"aim":[34],"to":[35,75,84,105,137,154],"determine":[36],"parameterizations":[39,94,166],"this":[40,71],"admits":[42],"polynomial":[44,90,142],"kernel.":[45],"While":[46],"characterization":[48],"is":[49,99],"known":[50],"related":[53],"Cover":[55],"based":[57],"on":[58],"recently":[60],"introduced":[61],"notion":[62],"of":[63,89,134,167],"bridge-depth,":[64],"it":[65],"remained":[66],"open":[68],"whether":[70],"could":[72],"be":[73,85],"generalized":[74],".":[79],"The":[80],"answer":[81],"turns":[82],"out":[83],"negative;":[86],"existence":[88],"kernels":[91,163],"structural":[93,165],"governed":[100],"by":[101,131],"elimination":[103,152],"distance":[104,153],"forest.":[107,156],"Under":[108],"standard":[110],"assumption":[111],"$$\\textrm{NP}\\not":[112],"\\subseteq":[113],"\\textrm{coNP}/\\textrm{poly}$$":[114],",":[115,126],"prove":[117],"that":[118],"any":[120],"minor-closed":[121],"class":[123],"$$\\mathcal":[124,138,148],"{G}$$":[125,139,149],"parameterized":[130],"size":[133],"modulator":[136],"has":[140,150],"kernel":[143],"if":[144,147],"and":[145,159],"only":[146],"bounded":[151],"This":[157],"captures":[158],"generalizes":[160],"all":[161],"existing":[162],"problem.":[172]},"counts_by_year":[],"updated_date":"2026-06-16T09:24:06.705377","created_date":"2025-10-10T00:00:00"}