research
∙
07/13/2021
An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
We consider the embeddability problem of a graph G into a two-dimensiona...
share
research
∙
01/14/2020
Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem
We present an algorithm for the following problem. Given a triangulated ...
research
∙
10/09/2019
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path
In the Minimum Activation Path problem, we are given a graph G with edge...
research
∙
03/20/2019
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
We prove essentially tight lower bounds, conditionally to the Exponentia...
research
∙
03/19/2018
