{"id":"https://openalex.org/W3159532254","doi":"https://doi.org/10.1137/22m1468864","title":"Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs","display_name":"Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs","publication_year":2022,"publication_date":"2022-10-04","ids":{"openalex":"https://openalex.org/W3159532254","doi":"https://doi.org/10.1137/22m1468864","mag":"3159532254"},"language":"en","primary_location":{"id":"doi:10.1137/22m1468864","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1468864","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1191527","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054949871","display_name":"Giacomo Paesani","orcid":"https://orcid.org/0000-0002-2383-1339"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"Giacomo Paesani","raw_affiliation_strings":["\\ddagger Faculty of Mathematics and Information Science, Warsaw University of Technology, 00-661 War-saw, Poland, and Faculty of Mathematics, Informatics, and Mechanics,","\\dagger Department of Computer Science, Durham University, Durham, DH1 3LE, UK","University of Warsaw, 00-927 Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\\ddagger Faculty of Mathematics and Information Science, Warsaw University of Technology, 00-661 War-saw, Poland, and Faculty of Mathematics, Informatics, and Mechanics,","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"\\dagger Department of Computer Science, Durham University, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"University of Warsaw, 00-927 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["University of Warsaw, 00-927 Warsaw, Poland","\\ddagger Faculty of Mathematics and Information Science, Warsaw University of Technology, 00-661 War-saw, Poland, and Faculty of Mathematics, Informatics, and Mechanics,","\\dagger Department of Computer Science, Durham University, Durham, DH1 3LE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, 00-927 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"\\ddagger Faculty of Mathematics and Information Science, Warsaw University of Technology, 00-661 War-saw, Poland, and Faculty of Mathematics, Informatics, and Mechanics,","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"\\dagger Department of Computer Science, Durham University, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112637370","display_name":"Pawe\u0142 Rz\u0105\u017cwski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Rz\u0105\u017cwski","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7696-3848","affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0611,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77800549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"36","issue":"4","first_page":"2453","last_page":"2472"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.8413987755775452},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6608166694641113},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6093935966491699},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5546886324882507},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5156646966934204},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5101295113563538},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5075458288192749},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4791949689388275},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4764942526817322},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4625083804130554},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45553848147392273},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4420970678329468},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4407132565975189},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4198755919933319},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4034622013568878},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34365013241767883},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3322592079639435},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.2131725251674652},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.132097989320755}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8413987755775452},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6608166694641113},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6093935966491699},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5546886324882507},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5156646966934204},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5101295113563538},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5075458288192749},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4791949689388275},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4764942526817322},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4625083804130554},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45553848147392273},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4420970678329468},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4407132565975189},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4198755919933319},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4034622013568878},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34365013241767883},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3322592079639435},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2131725251674652},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.132097989320755},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/22m1468864","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1468864","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:37203","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/37203/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2022, Vol.36(4), pp.2453-2472 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1191527","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1191527","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"Journal Article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1747534","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1747534","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1191527","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1191527","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G51464283","display_name":null,"funder_award_id":"RPG-2016-258","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W65530203","https://openalex.org/W133100469","https://openalex.org/W1593573721","https://openalex.org/W2035637517","https://openalex.org/W2298830675","https://openalex.org/W2407089923","https://openalex.org/W2594362606","https://openalex.org/W2737177295","https://openalex.org/W2963603765","https://openalex.org/W2964093597","https://openalex.org/W2964197964","https://openalex.org/W2965619982","https://openalex.org/W3045797592","https://openalex.org/W3094580952","https://openalex.org/W3112448634","https://openalex.org/W3114951492","https://openalex.org/W3167580896","https://openalex.org/W3197901415"],"related_works":["https://openalex.org/W2139128412","https://openalex.org/W1975220870","https://openalex.org/W2005033095","https://openalex.org/W2173658566","https://openalex.org/W1969119072","https://openalex.org/W2568387990","https://openalex.org/W2963554170","https://openalex.org/W1985956090","https://openalex.org/W128028107","https://openalex.org/W2606500388"],"abstract_inverted_index":{"We":[0,214],"prove":[1,34],"new":[2,84,159,185],"complexity":[3],"results":[4,85,94,160,218,222],"for":[5,36,45,86,95,103,190,223],"Feedback":[6,87,96],"Vertex":[7,88,97],"Set":[8,89,98],"and":[9,48,65,77,126,137],"Even":[10],"Cycle":[11,226],"Transversal":[12,227],"on":[13,62,80,99,148,170,235],"$H$-free":[14,100,171,236],"graphs,":[15,101],"that":[16,19,35,163],"is,":[17],"graphs":[18,47,105,117,128,172],"do":[20],"not":[21],"contain":[22],"some":[23,175,207],"fixed":[24],"graph":[25,53,67,197],"$H$":[26],"as":[27],"an":[28],"induced":[29,201],"subgraph.":[30],"In":[31],"particular,":[32],"we":[33,188],"every":[37],"$s\\geq":[38],"1$,":[39],"both":[40,164],"problems":[41,165],"are":[42],"polynomial-time":[43,93],"solvable":[44],"$sP_3$-free":[46],"$(sP_1+P_5)$-free":[49,196],"graphs;":[50],"here,":[51],"the":[52,56,66,70,138,144,158,167,220,224],"$sP_3$":[54],"denotes":[55,69],"disjoint":[57,71],"union":[58,72],"of":[59,73,134,143,212],"$s$":[60,74],"paths":[61],"three":[63],"vertices":[64,76],"$sP_1+P_5$":[68],"isolated":[75],"a":[78,184,193,199],"path":[79],"five":[81],"vertices.":[82],"Our":[83],"extend":[90],"all":[91],"known":[92,231],"namely":[102],"$sP_2$-free":[104],"[Chiarelli":[106],"et":[107,119,130],"al.,":[108,120,131],"Theoret.":[109],"Comput.":[110],"Sci.,":[111],"705":[112],"(2018),":[113],"pp.":[114,124,155],"75--83],":[115],"$(sP_1+P_3)$-free":[116],"[Dabrowski":[118],"Algorithmica,":[121],"82":[122],"(2020),":[123],"2841--2866]":[125],"$P_5$-free":[127],"[Abrishami":[129],"Induced":[132],"subgraphs":[133],"bounded":[135],"treewidth":[136],"container":[139],"method,":[140],"in":[141,180,192],"Proceedings":[142],"2021":[145],"ACM-SIAM":[146],"Symposium":[147],"Discrete":[149],"Algorithms":[150],"(SODA),":[151],"SIAM,":[152],"Philadelphia,":[153],"2021,":[154],"1948--1964].":[156],"Together,":[157],"also":[161,215],"show":[162],"exhibit":[166],"same":[168],"behavior":[169],"(subject":[173],"to":[174,183,206,232],"open":[176],"cases).":[177],"This":[178],"is":[179,230],"part":[181],"due":[182],"general":[186],"algorithm":[187],"design":[189],"finding":[191],"($sP_3)$-free":[194],"or":[195],"$G$":[198],"largest":[200],"subgraph":[202],"whose":[203],"blocks":[204],"belong":[205],"finite":[208],"class":[209],"${\\cal":[210],"C}$":[211],"graphs.":[213,237],"compare":[216],"our":[217],"with":[219],"state-of-the-art":[221],"Odd":[225],"problem,":[228],"which":[229],"behave":[233],"differently":[234]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}