{"id":"https://openalex.org/W2963792921","doi":"https://doi.org/10.4230/lipics.fsttcs.2015.420","title":"Parameterized Algorithms for Deletion to (r,ell)-Graphs","display_name":"Parameterized Algorithms for Deletion to (r,ell)-Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2963792921","doi":"https://doi.org/10.4230/lipics.fsttcs.2015.420","mag":"2963792921"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5645","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.420","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.420","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kolay, Sudeshna","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060986039","display_name":"Fahad Panolan","orcid":"https://orcid.org/0000-0001-6213-8687"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Panolan, Fahad","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000594690"],"corresponding_institution_ids":["https://openalex.org/I59611059"],"apc_list":null,"apc_paid":null,"fwci":2.1031,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8863187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9970999956130981,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8903964757919312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8188620209693909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7091892957687378},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6523549556732178},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5430128574371338},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48384156823158264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48102957010269165},{"id":"https://openalex.org/keywords/transversal","display_name":"Transversal (combinatorics)","score":0.46735715866088867},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4638713598251343},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4570567309856415}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8903964757919312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8188620209693909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7091892957687378},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6523549556732178},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5430128574371338},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48384156823158264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48102957010269165},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.46735715866088867},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4638713598251343},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4570567309856415},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5645","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.420","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fsttcs.2015.420","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2015.420","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5645","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.420","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2995257617","https://openalex.org/W2540507702","https://openalex.org/W2914414140","https://openalex.org/W2909582894","https://openalex.org/W2798588639","https://openalex.org/W2963907277","https://openalex.org/W2962857662","https://openalex.org/W2953047303","https://openalex.org/W2051856222","https://openalex.org/W2261794523","https://openalex.org/W3123623337","https://openalex.org/W2569113449","https://openalex.org/W1521818649","https://openalex.org/W2570024161","https://openalex.org/W3139078859","https://openalex.org/W3159723557","https://openalex.org/W1799262171","https://openalex.org/W2904185472","https://openalex.org/W2218773766","https://openalex.org/W2338323869"],"abstract_inverted_index":{"For":[0,223],"fixed":[1,171],"integers":[2],"r,ell":[3,146,176],"geq":[4],"0,":[5],"a":[6,49,53,66,242],"graph":[7,50,239],"G":[8,51,81],"is":[9,60,130,139,170,210],"called":[10],"an":[11,84,182,234,265],"(r,ell)-graph":[12],"if":[13],"the":[14,32,58,76,135,143,152,161,215,252],"vertex":[15],"set":[16,67],"V(G)":[17,70],"can":[18],"be":[19,263],"partitioned":[20],"into":[21],"r":[22,127],"independent":[23,266],"sets":[24],"and":[25,39,52,57,104,227],"ell":[26,129],"cliques.":[27],"This":[28,141,256],"brings":[29],"us":[30],"to":[31,44,61,112,197,258],"following":[33,162],"natural":[34],"parameterized":[35,114,153,216],"questions:":[36],"Vertex":[37,102,118,168],"(r,ell)-Partization":[38,123,169,209],"Edge":[40,97,106,122,208,219],"(r,ell)-Partization.":[41],"An":[42],"input":[43],"these":[45,157,189,205],"problems":[46,87,91,158],"consist":[47],"of":[48,78,126,145,218,244,254,264],"positive":[54],"integer":[55],"k":[56],"objective":[59],"decide":[62],"whether":[63],"there":[64],"exists":[65],"S":[68,79],"subseteq":[69,72],"(S":[71],"E(G))":[73],"such":[74,92],"that":[75,167],"deletion":[77],"from":[80],"results":[82],"in":[83,147,177],"(r,ell)-graph.":[85],"These":[86,191],"generalize":[88],"well":[89],"studied":[90],"as":[93,134,247],"Odd":[94,98],"Cycle":[95,99],"Transversal,":[96,100],"Split":[101,105],"Deletion":[103],"Deletion.":[107],"We":[108,149,165],"do":[109],"not":[110],"hope":[111],"get":[113],"algorithms":[115,187,193,226,261],"for":[116,156,175,188,204,229,241],"either":[117,125],"(r,":[119],"ell)-Partization":[120],"or":[121,128],"when":[124,212],"at":[131],"least":[132],"3":[133],"recognition":[136],"problem":[137],"itself":[138],"NP-complete.":[140],"leaves":[142],"case":[144],"{1,2}.":[148,178],"almost":[150],"complete":[151],"complexity":[154,217],"dichotomy":[155],"by":[159],"obtaining":[160],"results:":[163],"-":[164,207],"show":[166],"parameter":[172],"tractable":[173],"(FPT)":[174],"Then":[179],"we":[180,232],"design":[181,198],"Oh(sqrt":[183],"log":[184],"n)-factor":[185],"approximation":[186,192,225,260],"problems.":[190,206],"are":[194],"then":[195],"utilized":[196],"polynomial":[199],"sized":[200],"randomized":[201],"Turing":[202,230],"kernels":[203,231],"FPT":[211],"(r,ell)in{(1,2),(2,1)}.":[213],"However,":[214],"(2,2)-Partization":[220],"remains":[221],"open.":[222],"our":[224],"thus":[228],"use":[233],"interesting":[235],"finite":[236],"forbidden":[237],"induced":[238],"characterization,":[240],"class":[243,253],"graphs":[245],"known":[246],"(r,ell)-split":[248],"graphs,":[249],"properly":[250],"containing":[251],"(r,ell)-graphs.":[255],"approach":[257],"obtain":[259],"could":[262],"interest.":[267]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}