Salman Parsa

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