2 papers
cs.DS2021
The complexity of high-dimensional cuts
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum - cut, the minimum multiway cut, and…
math.AT2019
Parametrized Complexity of Expansion Height
Ulrich Bauer, Abhishek Rathod, Jonathan Spreer
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of th…