research
∙
07/01/2023
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
For a given graph G, a depth-first search (DFS) tree T of G is an r-root...
share
research
∙
03/15/2022
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth
Given a simplicial complex with n simplices, we consider the Connected S...
research
∙
08/10/2021
The Parameterized Complexity of Finding Minimum Bounded Chains
Finding the smallest d-chain with a specific (d-1)-boundary in a simplic...
research
∙
11/30/2020
Homology Localization Through the Looking-Glass of Parameterized Complexity Theory
Finding a cycle of lowest weight that represents a homology class in a s...
research
∙
07/19/2020