{"id":"https://openalex.org/W2034472295","doi":"https://doi.org/10.1145/2635820","title":"FPT is characterized by useful obstruction sets","display_name":"FPT is characterized by useful obstruction sets","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2034472295","doi":"https://doi.org/10.1145/2635820","mag":"2034472295"},"language":"en","primary_location":{"id":"doi:10.1145/2635820","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2635820","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I29894533","display_name":"Charles Darwin University","ror":"https://ror.org/048zcaj52","country_code":"AU","type":"education","lineage":["https://openalex.org/I29894533"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Charles Darwin University, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles Darwin University, Australia","institution_ids":["https://openalex.org/I29894533"]}]},{"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/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["University of Bergen, Norway","University of Bergen , Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen , Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7147,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7176406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9840999841690063,"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/kernelization","display_name":"Kernelization","score":0.8700762987136841},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7217667102813721},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.70650315284729},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47372737526893616},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.45903846621513367},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45801395177841187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44531044363975525},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3918324410915375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3340228199958801}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.8700762987136841},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7217667102813721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.70650315284729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47372737526893616},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.45903846621513367},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45801395177841187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44531044363975525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3918324410915375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3340228199958801},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2635820","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2635820","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3211800559","display_name":null,"funder_award_id":"306992","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W72161672","https://openalex.org/W78721095","https://openalex.org/W285041758","https://openalex.org/W1536180355","https://openalex.org/W1570425181","https://openalex.org/W1606657688","https://openalex.org/W1659233256","https://openalex.org/W1676006881","https://openalex.org/W1779781738","https://openalex.org/W1821538950","https://openalex.org/W1974692335","https://openalex.org/W1986602165","https://openalex.org/W1987092466","https://openalex.org/W1987580556","https://openalex.org/W1988637379","https://openalex.org/W1996472240","https://openalex.org/W1998964055","https://openalex.org/W2000311286","https://openalex.org/W2005079828","https://openalex.org/W2009685329","https://openalex.org/W2011039300","https://openalex.org/W2012154006","https://openalex.org/W2016590962","https://openalex.org/W2016741021","https://openalex.org/W2018251139","https://openalex.org/W2026646714","https://openalex.org/W2026771935","https://openalex.org/W2033405938","https://openalex.org/W2052867211","https://openalex.org/W2057826895","https://openalex.org/W2058258808","https://openalex.org/W2060945907","https://openalex.org/W2067016370","https://openalex.org/W2070685861","https://openalex.org/W2072365573","https://openalex.org/W2080609813","https://openalex.org/W2083748805","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2091434162","https://openalex.org/W2099035480","https://openalex.org/W2107284348","https://openalex.org/W2115334306","https://openalex.org/W2120288086","https://openalex.org/W2125058377","https://openalex.org/W2133839241","https://openalex.org/W2137012936","https://openalex.org/W2153916899","https://openalex.org/W2172138179","https://openalex.org/W2295651994","https://openalex.org/W2396707135","https://openalex.org/W2478921387","https://openalex.org/W2490706771","https://openalex.org/W2913688336","https://openalex.org/W3101261387","https://openalex.org/W4387732523","https://openalex.org/W6636825387"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2886237949","https://openalex.org/W2355184605","https://openalex.org/W2122202324"],"abstract_inverted_index":{"Many":[0],"graph":[1,18],"problems":[2,74],"were":[3],"first":[4],"shown":[5],"to":[6,65,175],"be":[7,51,79,173],"fixed-parameter":[8],"tractable":[9],"using":[10],"the":[11,23,66,92,95,101,104,123,135,149,160,178,189],"results":[12,115],"of":[13,25,39,48,59,68,97,103,106,113,180],"Robertson":[14],"and":[15,30,100,151],"Seymour":[16],"on":[17,184],"minors.":[19],"We":[20,125],"show":[21,126,164],"that":[22,46,73,153,165,187],"combination":[24],"finite,":[26],"computable":[27],"obstruction":[28,82,108],"sets":[29,83],"efficient":[31],"order":[32],"tests":[33],"is":[34,154],"not":[35],"just":[36],"one":[37,117],"way":[38],"obtaining":[40,110],"strongly":[41],"uniform":[42],"FPT":[43,49,60],"algorithms,":[44],"but":[45],"all":[47],"may":[50],"captured":[52],"in":[53,116,122,138],"this":[54,157],"way.":[55],"Our":[56],"new":[57,120],"characterization":[58],"has":[61],"a":[62,139,169],"strong":[63],"connection":[64],"theory":[67],"kernelization,":[69],"as":[70],"we":[71,90,163],"prove":[72],"with":[75],"polynomial":[76,87],"kernels":[77,99],"can":[78,172],"characterized":[80],"by":[81,192],"whose":[84],"elements":[85,105],"have":[86],"size.":[88],"Consequently":[89],"investigate":[91],"interplay":[93],"between":[94],"sizes":[96,102],"problem":[98,171],"such":[107],"sets,":[109],"several":[111],"examples":[112],"how":[114,127],"area":[118],"yield":[119],"insights":[121],"other.":[124],"exponential-size":[128],"minor-minimal":[129],"obstructions":[130],"for":[131,143,156],"pathwidth":[132],"k":[133,144],"form":[134],"crucial":[136],"ingredient":[137],"novel":[140],"or":[141,166],"-cross-composition":[142],"-":[145],"Pathwidth":[146],",":[147],"complementing":[148],"trivial":[150],"-composition":[152],"known":[155],"problem.":[158],"In":[159],"other":[161],"direction,":[162],"-cross-compositions":[167],"into":[168],"parameterized":[170],"used":[174],"rule":[176],"out":[177],"existence":[179],"efficiently":[181],"generated":[182],"quasi-orders":[183],"its":[185],"instances":[186],"characterize":[188],"no":[190],"-instances":[191],"polynomial-size":[193],"obstructions.":[194]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}