3 citations · 5 across the 5 of their papers we have counts for
6 papers · 1 filter
Labeled Interleaving Distance for Reeb Graphs
Fangfei Lan, Salman Parsa, Bei Wang
Merge trees, contour trees, and Reeb graphs are graph-based topological descriptors that capture topological changes of (sub)level sets of scalar fields. Comparing scalar fields us…
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals
Salman Parsa, Tim Ophelders
We consider drawings of graphs in the plane in which vertices are assigned distinct points in the plane and edges are drawn as simple curves connecting the vertices and such that t…
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay +1
In this paper we prove that the problem of deciding contractibility of an arbitrary closed curve on the boundary of a 3-manifold is in NP. We emphasize that the manifold and the cu…
How to Morph Graphs on the Torus
Erin Wolf Chambers, Jeff Erickson, Patrick Lin +1
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in…
Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem
Éric Colin de Verdière, Salman Parsa
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is con…
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
Sharareh Alipour, Salman Parsa
We define the problem segment cover as follows. We are given a set of pairs of sub-intervals of the unit interval. The problem asks if there is a choice of a single interval from e…