Salman Parsa

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 22

Top Topics

Equivalence Class

Parameterized Complexity

Top Venues

Discret. Comput. Geom.

Publications

Iyad Kanj, Salman Parsa
On the Parameterized Complexity of Motion Planning for Rectangular Robots. CoRR (2024)
Iyad Kanj, Salman Parsa
On the Parameterized Complexity of Motion Planning for Rectangular Robots. SoCG (2024)
Tamal K. Dey, Tao Hou, Salman Parsa
Revisiting Graph Persistence for Updates and Efficiency. WADS (2023)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70 (2) (2023)
Fangfei Lan, Salman Parsa, Bei Wang
Labeled Interleaving Distance for Reeb Graphs. CoRR (2023)
Sharareh Alipour, Salman Parsa
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles. Discret. Math. Algorithms Appl. 15 (1) (2023)
Tim Ophelders, Salman Parsa
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. SoCG (2022)
Salman Parsa, Tim Ophelders
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. CoRR (2022)
Erin Wolf Chambers, Salman Parsa, Hannah Schreiber
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. SoCG (2022)
Erin Wolf Chambers, Salman Parsa, Hannah Schreiber
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. CoRR (2021)
Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
How to Morph Graphs on the Torus. SODA (2021)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG (2021)
Éric Colin de Verdière, Salman Parsa
Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem. CoRR (2020)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR (2020)
Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa
How to Morph Graphs on the Torus. CoRR (2020)
Salman Parsa
Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. Discret. Comput. Geom. 64 (1) (2020)
Sharareh Alipour, Salman Parsa
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles. COCOA (2020)
Sharareh Alipour, Salman Parsa
Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles. CoRR (2018)
Salman Parsa
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. Discret. Comput. Geom. 59 (3) (2018)
Éric Colin de Verdière, Salman Parsa
Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. SODA (2017)
Salman Parsa
On links of vertices in simplicial $d$-complexes embeddable in euclidean $2d$-space. CoRR (2015)
Salman Parsa
Small Model $2$-Complexes in $4$-space and Applications. CoRR (2015)
Herbert Edelsbrunner, Salman Parsa
On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. SODA (2014)
Salman Parsa
A Deterministic O (m log m) Time Algorithm for the Reeb Graph. Discret. Comput. Geom. 49 (4) (2013)
Salman Parsa
time algorithm for the reeb graph. SCG (2012)