{"id":"https://openalex.org/W2024836278","doi":"https://doi.org/10.1142/s1793830912500085","title":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","display_name":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2024836278","doi":"https://doi.org/10.1142/s1793830912500085","mag":"2024836278"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500085","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5069509148","display_name":"James Nastos","orcid":"https://orcid.org/0000-0002-0965-2190"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]},{"id":"https://openalex.org/I4405260628","display_name":"University of British Columbia, Okanagan Campus","ror":"https://ror.org/04241wz75","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490","https://openalex.org/I4405260628"]},{"id":"https://openalex.org/I822440","display_name":"Okanagan University College","ror":"https://ror.org/02mxmh518","country_code":"CA","type":"education","lineage":["https://openalex.org/I822440"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JAMES NASTOS","raw_affiliation_strings":["Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada V1V 1V7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada V1V 1V7, Canada","institution_ids":["https://openalex.org/I141945490","https://openalex.org/I4405260628","https://openalex.org/I822440"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027777470","display_name":"Yong Gao","orcid":"https://orcid.org/0000-0003-1562-6228"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]},{"id":"https://openalex.org/I4405260628","display_name":"University of British Columbia, Okanagan Campus","ror":"https://ror.org/04241wz75","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490","https://openalex.org/I4405260628"]},{"id":"https://openalex.org/I822440","display_name":"Okanagan University College","ror":"https://ror.org/02mxmh518","country_code":"CA","type":"education","lineage":["https://openalex.org/I822440"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"YONG GAO","raw_affiliation_strings":["Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada V1V 1V7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada V1V 1V7, Canada","institution_ids":["https://openalex.org/I141945490","https://openalex.org/I4405260628","https://openalex.org/I822440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6218,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83561413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"04","issue":"01","first_page":"1250008","last_page":"1250008"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T12288","display_name":"Optimization and Search Problems","score":0.9901999831199646,"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/bounded-function","display_name":"Bounded function","score":0.6922370195388794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5120344758033752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49038243293762207},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4870763123035431},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43137413263320923},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4241112470626831},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.41335248947143555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4121239185333252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4024604558944702},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39692234992980957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3874465525150299},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.26555335521698},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09630632400512695}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6922370195388794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5120344758033752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49038243293762207},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4870763123035431},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43137413263320923},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4241112470626831},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.41335248947143555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4121239185333252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4024604558944702},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39692234992980957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3874465525150299},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.26555335521698},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09630632400512695},{"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.1142/s1793830912500085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500085","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1576293797","https://openalex.org/W1579049696","https://openalex.org/W1590656880","https://openalex.org/W1979740015","https://openalex.org/W1985562179","https://openalex.org/W2001159171","https://openalex.org/W2003278864","https://openalex.org/W2012067448","https://openalex.org/W2015906942","https://openalex.org/W2038865230","https://openalex.org/W2040405987","https://openalex.org/W2051576576","https://openalex.org/W2051937719","https://openalex.org/W2054963334","https://openalex.org/W2089334106","https://openalex.org/W2099200823","https://openalex.org/W2143327390","https://openalex.org/W2144050783","https://openalex.org/W2170633983","https://openalex.org/W4252143234"],"related_works":["https://openalex.org/W1810116456","https://openalex.org/W4300619607","https://openalex.org/W2964174631","https://openalex.org/W2952344039","https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W4288317034","https://openalex.org/W3135732667","https://openalex.org/W1539278744","https://openalex.org/W2949199930"],"abstract_inverted_index":{"Many":[0],"fixed-parameter":[1,137],"tractable":[2],"algorithms":[3,65,79,116,165],"using":[4,48],"a":[5,16,30,43,97,110],"bounded":[6,62,76,106],"search":[7,34,63,77,107,163],"tree":[8,64,78,164],"have":[9],"been":[10],"repeatedly":[11],"improved,":[12],"often":[13],"by":[14],"describing":[15],"larger":[17],"number":[18],"of":[19,42,51,100,103,121,162],"branching":[20,149],"rules":[21,150],"involving":[22],"an":[23],"increasingly":[24],"complex":[25],"case":[26,123],"analysis.":[27],"We":[28,71],"introduce":[29],"novel":[31],"and":[32,85,125,132,147,157],"general":[33],"strategy":[35],"that":[36],"branches":[37],"on":[38],"the":[39,49,55,73,81,86,92,101,119],"forbidden":[40],"subgraphs":[41],"graph":[44,57,168],"class":[45,50],"relaxation.":[46],"By":[47],"P4-sparse":[52],"graphs":[53],"as":[54],"relaxed":[56],"class,":[58],"we":[59],"obtain":[60],"efficient":[61,136],"for":[66,80,139,166],"several":[67],"parametrized":[68],"deletion":[69,95],"problems.":[70,90],"give":[72],"first":[74],"non-trivial":[75,126],"cograph":[82,93],"edge-deletion":[83,89],"problem":[84],"trivially":[87],"perfect":[88],"For":[91],"vertex":[94],"problem,":[96],"refined":[98],"analysis":[99,129],"runtime":[102],"our":[104],"simple":[105],"algorithm":[108,138],"gives":[109],"faster":[111],"exponential":[112],"factor":[113],"than":[114],"those":[115],"designed":[117],"with":[118],"help":[120],"complicated":[122],"distinctions":[124],"running":[127],"time":[128],"[R.":[130],"Niedermeier":[131],"P.":[133],"Rossmanith,":[134],"An":[135],"3-hitting":[140],"set,":[141],"J.":[142,153],"Discrete":[143],"Algorithms1(1)":[144],"(2003)":[145],"89\u2013102]":[146],"computer-aided":[148],"[J.":[151],"Gramm,":[152],"Guo,":[154],"F.":[155],"H\u00fcffner":[156],"R.":[158],"Niedermeier,":[159],"Automated":[160],"generation":[161],"hard":[167],"modification":[169],"problems,":[170],"Algorithmica39(4)":[171],"(2004)":[172],"321\u2013347].":[173]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}