{"id":"https://openalex.org/W7166867641","doi":"https://doi.org/10.4230/lipics.icalp.2026.83","title":"On the Hardness of Recognizing Graphs of Small Mim-Width and Its Variants","display_name":"On the Hardness of Recognizing Graphs of Small Mim-Width and Its Variants","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166867641","doi":"https://doi.org/10.4230/lipics.icalp.2026.83"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26472","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.83","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.83/LIPIcs.ICALP.2026.83.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.83/LIPIcs.ICALP.2026.83.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013512624","display_name":"Max Dupr\u00e9 la Tour","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dupr\u00e9 la Tour, Max","raw_affiliation_strings":["Department of Computer Science, McGill University, Montreal, Canada"],"raw_orcid":"https://orcid.org/0009-0007-5868-0917","affiliations":[{"raw_affiliation_string":"Department of Computer Science, McGill University, Montreal, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016796629","display_name":"Manuel Lafond","orcid":"https://orcid.org/0000-0002-5305-7372"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lafond, Manuel","raw_affiliation_strings":["Department of Computer Science, Universit\u00e9 de Sherbrooke, Canada"],"raw_orcid":"https://orcid.org/0000-0002-5305-7372","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universit\u00e9 de Sherbrooke, Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072235745","display_name":"Ndiam\u00e9 Ndiaye","orcid":"https://orcid.org/0000-0002-4920-6566"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ndiaye, Ndiam\u00e9","raw_affiliation_strings":["Department of Mathematics, McGill University, Montreal, Canada"],"raw_orcid":"https://orcid.org/0000-0002-4920-6566","affiliations":[{"raw_affiliation_string":"Department of Mathematics, McGill University, Montreal, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7931403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.46459999680519104,"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.46459999680519104,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.21400000154972076,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.04820000007748604,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5746999979019165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4758000075817108},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4668000042438507},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.46309998631477356},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39070001244544983},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37389999628067017}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6553000211715698},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6190999746322632},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5746999979019165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5181000232696533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.46309998631477356},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37389999628067017},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.34060001373291016},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C77346573","wikidata":"https://www.wikidata.org/wiki/Q484637","display_name":"Linear equation","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.26109999418258667}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26472","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.83","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.83/LIPIcs.ICALP.2026.83.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.83","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.83","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26472","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.83","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.83/LIPIcs.ICALP.2026.83.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166867641.pdf","grobid_xml":"https://content.openalex.org/works/W7166867641.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,92],"mim-width":[1,61,80,177,182],"of":[2,33,53,71,74,78,86,94,97,174,204,218],"a":[3,6,14,26,30,50,69,147],"graph":[4,148],"is":[5,160,165,203,211],"powerful":[7],"structural":[8],"parameter":[9,134],"that,":[10],"when":[11],"bounded":[12],"by":[13],"constant,":[15],"allows":[16],"several":[17,39],"hard":[18],"problems":[19,34,122,173],"to":[20,103],"be":[21],"polynomial-time":[22],"solvable":[23],"-":[24],"with":[25,49],"recent":[27],"meta-theorem":[28],"encompassing":[29],"large":[31],"class":[32],"[SODA2023].":[35],"Since":[36],"its":[37],"introduction,":[38],"variants":[40,65],"such":[41],"as":[42],"sim-width":[43,87,150],"and":[44,62,84,139,162,194],"omim-width":[45,138,153],"were":[46],"developed,":[47],"along":[48],"linear":[51,79,169,181],"version":[52],"these":[54,64],"parameters.":[55],"It":[56],"was":[57],"recently":[58],"shown":[59],"that":[60,118],"all":[63,67],"are":[66,185,191,195],"paraNP-hard,":[68],"consequence":[70],"the":[72,119,132,163,172,197,216],"NP-hardness":[73],"distinguishing":[75],"between":[76,137],"graphs":[77,85,96],"at":[81,88],"most":[82],"1211":[83],"least":[89],"1216":[90],"[ICALP2025].":[91],"complexity":[93],"recognizing":[95],"small":[98,127],"width,":[99],"particularly":[100],"those":[101],"close":[102],"1,":[104,152,155],"remained":[105],"open,":[106],"despite":[107],"their":[108,168],"especially":[109],"attractive":[110],"algorithmic":[111],"applications.":[112],"In":[113],"this":[114],"work,":[115],"we":[116,141],"show":[117,142],"width":[120],"recognition":[121],"remain":[123],"NP-hard":[124],"even":[125],"on":[126],"widths.":[128],"Specifically,":[129],"after":[130],"introducing":[131],"novel":[133],"Omim-width":[135,157],"sandwiched":[136],"mim-width,":[140],"that:":[143],"(1)":[144],"deciding":[145,175],"whether":[146,176],"has":[149],"=":[151,154,158],"or":[156,180],"1":[159],"NP-hard,":[161],"same":[164],"true":[166],"for":[167],"variants;":[170],"(2)":[171],"\u2264":[178,183],"2":[179,184],"both":[186],"NP-hard.":[187],"Interestingly,":[188],"our":[189],"reductions":[190],"relatively":[192],"simple":[193],"from":[196],"Unrooted":[198],"Quartet":[199],"Consistency":[200],"problem,":[201],"which":[202],"great":[205],"interest":[206],"in":[207,215],"computational":[208],"biology":[209],"but":[210],"not":[212],"commonly":[213],"used":[214],"theory":[217],"algorithms.":[219]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}