{"id":"https://openalex.org/W7131250877","doi":"https://doi.org/10.1007/s00224-025-10233-y","title":"Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings","display_name":"Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131250877","doi":"https://doi.org/10.1007/s00224-025-10233-y"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-025-10233-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10233-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10233-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10233-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ambroise Baril","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ambroise Baril","raw_affiliation_strings":["LORIA, Universit\u00e9 de Lorraine, Metz, France"],"affiliations":[{"raw_affiliation_string":"LORIA, Universit\u00e9 de Lorraine, Metz, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Miguel Couceiro","orcid":null},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR","PT"],"is_corresponding":false,"raw_author_name":"Miguel Couceiro","raw_affiliation_strings":["INESC-ID, IST, Universidade de Lisboa, Lisbon, Portugal","LORIA, Universit\u00e9 de Lorraine, Metz, France"],"affiliations":[{"raw_affiliation_string":"INESC-ID, IST, Universidade de Lisboa, Lisbon, Portugal","institution_ids":["https://openalex.org/I121345201","https://openalex.org/I141596103"]},{"raw_affiliation_string":"LORIA, Universit\u00e9 de Lorraine, Metz, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":null,"display_name":"Victor Lagerkvist","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Victor Lagerkvist","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6pings Universitet, Link\u00f6pings, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6pings Universitet, Link\u00f6pings, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66918945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.47040000557899475,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.47040000557899475,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.37369999289512634,"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.0723000019788742,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6855000257492065},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5526999831199646},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4869999885559082},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.460999995470047},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4424999952316284},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4408000111579895},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4348999857902527},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.3901999890804291},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.38280001282691956}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6855000257492065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6428999900817871},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5526999831199646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5097000002861023},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4869999885559082},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3855000138282776},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.38280001282691956},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3531000018119812},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.3407999873161316},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32179999351501465},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32010000944137573},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.30149999260902405},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2922999858856201},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.2596000134944916}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-025-10233-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10233-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10233-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00224-025-10233-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10233-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10233-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131250877.pdf","grobid_xml":"https://content.openalex.org/works/W7131250877.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1976120600","https://openalex.org/W1993328543","https://openalex.org/W2013967419","https://openalex.org/W2015906942","https://openalex.org/W2015963099","https://openalex.org/W2040145343","https://openalex.org/W2063132075","https://openalex.org/W2063951771","https://openalex.org/W2070374625","https://openalex.org/W2076967887","https://openalex.org/W2154682992","https://openalex.org/W2169633784","https://openalex.org/W2266173563","https://openalex.org/W2606518309","https://openalex.org/W2900958825","https://openalex.org/W2914414140","https://openalex.org/W3115774673","https://openalex.org/W3129130258","https://openalex.org/W3178223974","https://openalex.org/W3178718674","https://openalex.org/W3181611173","https://openalex.org/W3183116209","https://openalex.org/W3206499916","https://openalex.org/W3212225902","https://openalex.org/W3215918110","https://openalex.org/W4206111425","https://openalex.org/W4206570294","https://openalex.org/W4318022884","https://openalex.org/W4361225562","https://openalex.org/W4390987682"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,133,181,214],"H":[2,35,56,175,177,224,263],"-":[3,16,57,178],"Coloring":[4,17,58,179],"problem":[5,14,38,167],"is":[6,21],"a":[7,29,108,122,188,207,217],"well-known":[8],"generalization":[9],"of":[10,43,55,77,144,150,160,168,172,191,201,220,237,274,279],"the":[11,19,32,41,53,62,66,90,151,165,170,192,198,211,221,230,235,240,259],"classical":[12],"-complete":[13],"k":[15],"where":[18],"task":[20],"to":[22,31,61,103,130,174,206,234],"determine":[23],"whether":[24],"an":[25],"input":[26,193,241],"graph":[27,34,161,194,223],"admits":[28],"homomorphism":[30],"template":[33,222],".":[36,203],"This":[37,204],"has":[39],"been":[40],"subject":[42],"intense":[44],"theoretical":[45],"research":[46],"and":[47,65,94,106,115,139,225,269],"in":[48,239,295],"this":[49],"article":[50],"we":[51,110,163,185,227,247],"study":[52],"complexity":[54,231],"with":[59,232],"respect":[60,233],"parameters":[63,105],"clique-width":[64,117,140],"more":[67],"recent":[68],"component":[69,137,145,199],"twin-width":[70,114,138,200],",":[71,290],"which":[72],"describe":[73],"desirable":[74],"computational":[75,158],"properties":[76],"graphs.":[78],"We":[79],"give":[80],"two":[81],"surprising":[82],"linear":[83,116,134,245],"bounds":[84,127,135,246],"between":[85,136],"these":[86],"parameters,":[87],"thus":[88],"improving":[89],"previously":[91,260],"known":[92,153],"exponential":[93,96],"double":[95],"bounds.":[97],"Our":[98],"constructive":[99],"proof":[100],"naturally":[101,128],"extends":[102],"related":[104,120],"as":[107,256,258],"showcase":[109],"prove":[111],"that":[112,184,249],"total":[113],"can":[118],"be":[119],"via":[121],"tight":[123],"quadratic":[124],"bound.":[125],"These":[126],"lead":[129],"algorithmic":[131],"applications.":[132],"entail":[141],"natural":[142],"approximations":[143],"twin-width,":[146],"by":[147,197],"making":[148],"use":[149],"results":[152],"for":[154,157,210,270],"clique-width.":[155],"As":[156],"aspects":[159],"coloring,":[162],"target":[164],"richer":[166],"counting":[169,212],"number":[171,236],"homomorphisms":[173],"(#":[176],").":[180],"first":[182],"algorithm":[183],"propose":[186],"uses":[187,216],"contraction":[189,218],"sequence":[190,219],"G":[195,202],"parameterized":[196],"leads":[205],"positive":[208],"result":[209],"version.":[213],"second":[215],"here":[226],"instead":[228],"measure":[229],"vertices":[238],"graph.":[242],"Using":[243],"our":[244,250],"show":[248],"algorithms":[251,265],"are":[252,294],"always":[253],"at":[254],"least":[255],"fast":[257],"best":[261],"#":[262],"-Coloring":[264],"(based":[266],"on":[267],"clique-width)":[268],"several":[271],"interesting":[272],"classes":[273],"graphs":[275],"(e.g.,":[276],"cographs,":[277],"cycles":[278],"length":[280],"$$\\varvec{\\ge":[281],"7}$$":[282],"<mml:math":[283],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[284],"<mml:mrow>":[285],"<mml:mo>\u2265</mml:mo>":[286],"<mml:mn>7</mml:mn>":[287],"</mml:mrow>":[288],"</mml:math>":[289],"or":[291],"distance-hereditary":[292],"graphs)":[293],"fact":[296],"strictly":[297],"faster.":[298]},"counts_by_year":[],"updated_date":"2026-03-13T14:20:09.374765","created_date":"2025-10-10T00:00:00"}