Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
arXiv: Computational Complexity, 2019.
We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut problem. A cut graph of a graph $G$ embedded on a surface $S$ is a subgraph of $G$ whose removal from $...More
PPT (Upload PPT)
Best Paper of SoCG, 2019