Showing cs.CGShow all
2 papers · 1 filter
cs.CG2022
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth
Mitchell Black, Nello Blaser, Amir Nayyeri +1
Given a simplicial complex with simplices, we consider the Connected Subsurface Recognition (c-SR) problem of finding a subcomplex that is homeomorphic to a given connected sur…
cs.CG2021
The Parameterized Complexity of Finding Minimum Bounded Chains
Nello Blaser, Morten Brun, Lars M. Salbu +1
Finding the smallest -chain with a specific -boundary in a simplicial complex is known as the \textsc{Minimum Bounded Chain} (MBC) problem. The MBC problem is NP-…