{"id":"https://openalex.org/W7162486672","doi":"https://doi.org/10.4230/lipics.socg.2026.85","title":"ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes","display_name":"ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162486672","doi":"https://doi.org/10.4230/lipics.socg.2026.85"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2603.05406","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2603.05406","pdf_url":"https://arxiv.org/pdf/2603.05406","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2603.05406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031210702","display_name":"Geevarghese Philip","orcid":"https://orcid.org/0000-0003-0717-7303"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Philip, Geevarghese","raw_affiliation_strings":["Chennai Mathematical Institute, India","CNRS IRL ReLaX, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0003-0717-7303","affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]},{"raw_affiliation_string":"CNRS IRL ReLaX, Chennai, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002356875","display_name":"Erlend Raa V\u00e5gset","orcid":"https://orcid.org/0000-0003-2289-2268"},"institutions":[{"id":"https://openalex.org/I4210150892","display_name":"Western Norway University of Applied Sciences","ror":null,"country_code":"NO","type":null,"lineage":["https://openalex.org/I4210150892"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"V\u00e5gset, Erlend Raa","raw_affiliation_strings":["Western Norway University of Applied Sciences (HVL), F\u00f8rde, Norway"],"raw_orcid":"https://orcid.org/0000-0003-2289-2268","affiliations":[{"raw_affiliation_string":"Western Norway University of Applied Sciences (HVL), F\u00f8rde, Norway","institution_ids":["https://openalex.org/I4210150892"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9801999926567078,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9801999926567078,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.008299999870359898,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.8378000259399414},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6093999743461609},{"id":"https://openalex.org/keywords/morse-code","display_name":"Morse code","score":0.5967000126838684},{"id":"https://openalex.org/keywords/discrete-morse-theory","display_name":"Discrete Morse theory","score":0.5407000184059143},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5170999765396118},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4927000105381012},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.453900009393692},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.44909998774528503}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8378000259399414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7452999949455261},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6093999743461609},{"id":"https://openalex.org/C140031139","wikidata":"https://www.wikidata.org/wiki/Q79897","display_name":"Morse code","level":2,"score":0.5967000126838684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5946000218391418},{"id":"https://openalex.org/C170315498","wikidata":"https://www.wikidata.org/wiki/Q5282039","display_name":"Discrete Morse theory","level":3,"score":0.5407000184059143},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5170999765396118},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4927000105381012},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.461899995803833},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.453900009393692},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.44909998774528503},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30880001187324524},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C156730297","wikidata":"https://www.wikidata.org/wiki/Q2296951","display_name":"Morse theory","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2603.05406","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2603.05406","pdf_url":"https://arxiv.org/pdf/2603.05406","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25892","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.85","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.85/LIPIcs.SoCG.2026.85.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.socg.2026.85","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.85","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:arXiv.org:2603.05406","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2603.05406","pdf_url":"https://arxiv.org/pdf/2603.05406","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162486672.pdf","grobid_xml":"https://content.openalex.org/works/W7162486672.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Optimal":[1],"Morse":[2],"Matching":[3],"(OMM)":[4],"problem":[5],"asks":[6],"for":[7,63,91],"a":[8,14,84],"discrete":[9],"gradient":[10],"vector":[11],"field":[12],"on":[13,51,72],"simplicial":[15],"complex":[16],"that":[17,99],"minimizes":[18],"the":[19,69,108],"number":[20],"of":[21,53,65],"critical":[22],"simplices.":[23],"It":[24],"is":[25],"NP-hard":[26],"and":[27,35,59,97],"has":[28,44,74],"been":[29,46],"studied":[30],"extensively":[31],"in":[32,55,60],"heuristic,":[33],"approximation,":[34],"parameterized":[36],"complexity":[37],"settings.":[38],"Parameterized":[39],"by":[40,82],"treewidth":[41],"k,":[42],"OMM":[43],"long":[45],"known":[47],"to":[48],"be":[49],"solvable":[50],"triangulations":[52,64],"3-manifolds":[54],"2^O(k\u00b2)":[56],"n^O(1)":[57],"time":[58,62],"FPT":[61],"arbitrary":[66],"manifolds,":[67],"but":[68],"exact":[70],"dependence":[71],"k":[73],"remained":[75],"an":[76],"open":[77],"question.":[78],"We":[79],"resolve":[80],"this":[81],"giving":[83],"new":[85],"2^O(k":[86],"log":[87,102],"k)":[88,103],"n-time":[89],"algorithm":[90,105],"any":[92],"finite":[93],"regular":[94],"CW":[95],"complex,":[96],"show":[98],"no":[100],"2^o(k":[101],"n^O(1)-time":[104],"exists":[106],"unless":[107],"Exponential":[109],"Time":[110],"Hypothesis":[111],"(ETH)":[112],"fails.":[113]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}