{"id":"https://openalex.org/W2759740247","doi":"https://doi.org/10.1007/s00453-020-00692-9","title":"On the Tractability of Optimization Problems on H-Graphs","display_name":"On the Tractability of Optimization Problems on H-Graphs","publication_year":2020,"publication_date":"2020-03-11","ids":{"openalex":"https://openalex.org/W2759740247","doi":"https://doi.org/10.1007/s00453-020-00692-9","mag":"2759740247"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-020-00692-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00692-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00692-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00692-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"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":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)"],"affiliations":[{"raw_affiliation_string":"UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"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":"Petr A. Golovach","raw_affiliation_strings":["UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)"],"affiliations":[{"raw_affiliation_string":"UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045592018","display_name":"Jean\u2010Florent Raymond","orcid":"https://orcid.org/0000-0003-4646-7602"},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Florent Raymond","raw_affiliation_strings":["LIMOS - Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes (Campus Universitaire des C\u00e9zeaux, 1 rue de la Chebarde, TSA 60125 / CS 60026, 63178 Aubi\u00e8re Cedex - France)"],"affiliations":[{"raw_affiliation_string":"LIMOS - Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes (Campus Universitaire des C\u00e9zeaux, 1 rue de la Chebarde, TSA 60125 / CS 60026, 63178 Aubi\u00e8re Cedex - France)","institution_ids":["https://openalex.org/I4210099416"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":2.7458,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.92095203,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"82","issue":"9","first_page":"2432","last_page":"2473"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.996999979019165,"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/combinatorics","display_name":"Combinatorics","score":0.7657692432403564},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6420746445655823},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.613519012928009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5758007168769836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5690915584564209},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.568795919418335},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5234372615814209},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5116729736328125},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4545128345489502},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43542835116386414},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4198821187019348},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35167717933654785},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26630210876464844}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7657692432403564},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6420746445655823},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.613519012928009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5758007168769836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5690915584564209},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.568795919418335},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5234372615814209},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5116729736328125},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4545128345489502},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43542835116386414},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4198821187019348},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35167717933654785},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26630210876464844},{"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.1007/s00453-020-00692-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00692-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00692-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1709.09737","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.09737","pdf_url":"https://arxiv.org/pdf/1709.09737","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-03449925v1","is_oa":false,"landing_page_url":"https://uca.hal.science/hal-03449925","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩","raw_type":"Journal articles"},{"id":"doi:10.4230/lipics.esa.2018.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2018.30","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":"doi:10.1007/s00453-020-00692-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00692-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00692-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3514550006","display_name":null,"funder_award_id":"Centre","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3634255087","display_name":null,"funder_award_id":"648527","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3748656914","display_name":null,"funder_award_id":"Norway","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G475882405","display_name":null,"funder_award_id":"DISTRUCT-648527","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5036817778","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innov","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G588162405","display_name":null,"funder_award_id":"CLASSIS","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G708992981","display_name":null,"funder_award_id":"DEC-2013/11/N/ST6/02706","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G7931603690","display_name":null,"funder_award_id":"MULTIVAL","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8633428685","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innovat","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"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320323078","display_name":"Universitetet i Bergen","ror":"https://ror.org/03zga2b32"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2759740247.pdf","grobid_xml":"https://content.openalex.org/works/W2759740247.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1578113210","https://openalex.org/W1588395561","https://openalex.org/W1629112612","https://openalex.org/W1964095725","https://openalex.org/W1968041356","https://openalex.org/W1973310391","https://openalex.org/W1978452004","https://openalex.org/W1985733932","https://openalex.org/W2019992365","https://openalex.org/W2030711914","https://openalex.org/W2031076941","https://openalex.org/W2037968786","https://openalex.org/W2051627428","https://openalex.org/W2072585366","https://openalex.org/W2073279057","https://openalex.org/W2116087731","https://openalex.org/W2127689597","https://openalex.org/W2143474538","https://openalex.org/W2149785904","https://openalex.org/W2154682992","https://openalex.org/W2157529519","https://openalex.org/W2497554862","https://openalex.org/W2621063750","https://openalex.org/W2747404738","https://openalex.org/W2748096547","https://openalex.org/W2759740247","https://openalex.org/W2768298954","https://openalex.org/W2789819963","https://openalex.org/W2909144890","https://openalex.org/W2914414140","https://openalex.org/W2963418598","https://openalex.org/W2964198611","https://openalex.org/W2964350130","https://openalex.org/W4293466730","https://openalex.org/W4294538190"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W1544821268","https://openalex.org/W3037533092","https://openalex.org/W603403972","https://openalex.org/W2061237693","https://openalex.org/W1554245510","https://openalex.org/W2152638828","https://openalex.org/W3121955789","https://openalex.org/W4285762950","https://openalex.org/W2083238533"],"abstract_inverted_index":{"Abstract":[0],"For":[1,315],"a":[2,6,69,147,241,296,325],"graph":[3,7,18,34],"H":[4,11,26,28,64,101,120,125,157,163,201,216,279,294,313,330],",":[5,80,87,121,223,230],"G":[8],"is":[9,15,127,295,305],"an":[10,16],"-graph":[12],"if":[13],"it":[14,323],"intersection":[17],"of":[19,22,25,63,71,124,128,137,142,150,176,184,187,194,246,252,278,283,312],"connected":[20],"subgraphs":[21],"some":[23],"subdivision":[24],".":[27,238,314],"-graphs":[29,65,126,164,217],"naturally":[30],"generalize":[31],"several":[32,111],"important":[33],"classes":[35,186],"like":[36,75],"interval":[37],"graphs":[38,141,166],"or":[39,88],"circular-arc":[40],"graph.":[41],"This":[42],"class":[43,123,149,193],"was":[44],"introduced":[45],"in":[46,97,110,153,197,212],"the":[47,60,122,135,174,209,250,276,281,284,287,310,332],"early":[48],"1990s":[49],"by":[50,66,275,309,329],"B\u00edr\u00f3,":[51],"Hujter,":[52],"and":[53,105,179,231,264,331],"Tuza.":[54],"Recently,":[55],"Chaplick":[56],"et":[57,86,94,229,237,263,270,304],"al.":[58],"initiated":[59],"algorithmic":[61,108,182],"study":[62],"showing":[67],"that":[68,116,162,257,292,322],"number":[70],"fundamental":[72,205],"optimization":[73,206],"problems":[74,151,195,207,210,248],"M":[76,81,89,219,224,232,258,265,299,316],"aximum":[77,82,220,225,259,317],"C":[78,221,318],"lique":[79,222,319],"I":[83,226,260],"ndependent":[84,227,261],"S":[85,93,228,236,262,269,303],"inimum":[90,233,266,300],"D":[91,234,267,301],"ominating":[92,235,268,302],"are":[95,165,218,271],"solvable":[96,152,196,211],"polynomial":[98,154,198,213,326],"time":[99,155,199,214],"on":[100,140,156,181,200,215],"-graphs.":[102,158,202],"We":[103,159,239,255],"extend":[104],"complement":[106],"these":[107,247],"findings":[109],"directions.":[112],"First":[113],"we":[114,290,320],"show":[115,256,321],"for":[117],"every":[118],"fixed":[119],"logarithmically-bounded":[129],"boolean-width":[130],"(via":[131],"mim-width).":[132],"Pipelined":[133],"with":[134,167,173],"plethora":[136],"known":[138],"algorithms":[139],"bounded":[143],"boolean-width,":[144],"this":[145,189],"describes":[146],"large":[148],"also":[160],"observe":[161],"polynomially":[168],"many":[169],"minimal":[170],"separators.":[171],"Combined":[172],"work":[175],"Fomin,":[177],"Todinca":[178],"Villanger":[180],"properties":[183],"such":[185],"graphs,":[188],"identify":[190],"another":[191],"wide":[192],"The":[203],"most":[204],"among":[208],"provide":[240],"more":[242],"refined":[243],"complexity":[244],"analysis":[245],"from":[249],"perspective":[251],"parameterized":[253,274,308,328],"complexity.":[254],"W[1]-hard":[272],"being":[273],"size":[277,282,311],"plus":[280],"solution.":[285],"On":[286],"other":[288],"hand,":[289],"prove":[291],"when":[293],"tree,":[297],"then":[298],"fixed-parameter":[306],"tractable":[307],"admits":[324],"kernel":[327],"solution":[333],"size.":[334]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}