{"id":"https://openalex.org/W7162536864","doi":"https://doi.org/10.4230/lipics.socg.2026.10","title":"Fast Free Resolutions of Bifiltered Chain Complexes","display_name":"Fast Free Resolutions of Bifiltered Chain Complexes","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162536864","doi":"https://doi.org/10.4230/lipics.socg.2026.10"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25816","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.10/LIPIcs.SoCG.2026.10.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-vol367-socg2026/LIPIcs.SoCG.2026.10/LIPIcs.SoCG.2026.10.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137136224","display_name":"Ulrich Bauer","orcid":"https://orcid.org/0000-0002-9683-0724"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bauer, Ulrich","raw_affiliation_strings":["Department of Mathematics and MDSI and MCML, Technical University of Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9683-0724","affiliations":[{"raw_affiliation_string":"Department of Mathematics and MDSI and MCML, Technical University of Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137148451","display_name":"Tamal K. Dey","orcid":"https://orcid.org/0000-0001-5160-9738"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dey, Tamal K.","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0001-5160-9738","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137187323","display_name":"Michael Kerber","orcid":"https://orcid.org/0000-0002-8030-9299"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Kerber, Michael","raw_affiliation_strings":["Institute of Geometry, Graz University of Technology, Austria"],"raw_orcid":"https://orcid.org/0000-0002-8030-9299","affiliations":[{"raw_affiliation_string":"Institute of Geometry, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031876608","display_name":"Florian Russold","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Russold, Florian","raw_affiliation_strings":["Institute of Geometry, Graz University of Technology, Austria"],"raw_orcid":"https://orcid.org/0009-0003-2978-0477","affiliations":[{"raw_affiliation_string":"Institute of Geometry, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047800585","display_name":"Matthias S\u00f6ls","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"S\u00f6ls, Matthias","raw_affiliation_strings":["Department of Mathematics, Technical University of Munich, Germany","Institute of Geometry, Graz University of Technology, Austria"],"raw_orcid":"https://orcid.org/0009-0004-9124-9027","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Munich, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Institute of Geometry, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.6325787,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9871000051498413,"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.9871000051498413,"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.0034000000450760126,"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/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.7328000068664551},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5922999978065491},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.548799991607666},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4848000109195709},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44530001282691956},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4291999936103821},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.37310001254081726},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.35839998722076416}],"concepts":[{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.7328000068664551},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5922999978065491},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.548799991607666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5270000100135803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.504800021648407},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4848000109195709},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4291999936103821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3910999894142151},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34389999508857727},{"id":"https://openalex.org/C165525559","wikidata":"https://www.wikidata.org/wiki/Q224180","display_name":"Homology (biology)","level":3,"score":0.3158000111579895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.3012999892234802},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2851000130176544},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25816","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.10/LIPIcs.SoCG.2026.10.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.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.10","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:25816","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.10/LIPIcs.SoCG.2026.10.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/W7162536864.pdf","grobid_xml":"https://content.openalex.org/works/W7162536864.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"a":[1,8,35,39,53,63,88,161,170,177,181,189],"k-critical":[2,36,178],"bifiltration,":[3],"every":[4],"simplex":[5],"enters":[6],"along":[7],"staircase":[9],"with":[10,16,45,142],"at":[11],"most":[12],"k":[13,17],"steps.":[14],"Examples":[15],">":[18],"1":[19],"include":[20],"degree-Rips":[21],"bifiltrations":[22],"and":[23,61,84,154],"models":[24],"of":[25,33,56,99,168,173,176,197,208,214],"the":[26,31,57,120,132,138,166,174,204],"multicover":[27],"bifiltration.":[28],"We":[29,70,157],"consider":[30],"problem":[32],"converting":[34],"bifiltration":[37,179],"into":[38],"1-critical":[40],"(i.e.":[41],"free)":[42],"chain":[43,59,89,190],"complex":[44,60,90,191,207],"equivalent":[46],"homology.":[47],"This":[48],"is":[49,62,117,193],"known":[50],"as":[51,108],"computing":[52,92,169],"free":[54,78,162],"resolution":[55,163],"underlying":[58],"first":[64,75],"step":[65],"toward":[66],"post-processing":[67],"such":[68],"bifiltrations.":[69],"present":[71],"two":[72],"algorithms.":[73],"The":[74,95],"one":[76],"computes":[77],"resolutions":[79],"corresponding":[80],"to":[81,87,103,150],"path":[82,100,140],"graphs":[83,101,141],"assembles":[85],"them":[86],"by":[91,110],"additional":[93],"maps.":[94],"simple":[96],"combinatorial":[97],"structure":[98],"leads":[102,149],"good":[104],"performance":[105],"in":[106,119,131,180,195,212],"practice,":[107],"demonstrated":[109],"extensive":[111],"experiments.":[112],"However,":[113],"its":[114],"worst-case":[115],"bound":[116],"quadratic":[118],"input":[121],"size":[122],"because":[123],"long":[124],"paths":[125,147],"might":[126],"yield":[127],"dense":[128],"boundary":[129],"matrices":[130],"output.":[133],"Our":[134],"second":[135,210],"algorithm":[136,211],"replaces":[137],"simplex-wise":[139],"ones":[143],"that":[144,159,188,192],"maintain":[145],"short":[146],"which":[148],"almost":[151],"linear":[152],"runtime":[153],"output":[155,206],"size.":[156,216],"demonstrate":[158],"pre-computing":[160],"speeds":[164],"up":[165],"task":[167],"minimal":[171,194],"presentation":[172],"homology":[175],"fixed":[182],"dimension.":[183],"Furthermore,":[184],"our":[185,209],"findings":[186],"show":[187],"terms":[196,213],"generators":[198],"can":[199],"be":[200],"asymptotically":[201],"larger":[202],"than":[203],"non-minimal":[205],"description":[215]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}