A deterministic o(m log m) time algorithm for the reeb graph. - Salman Parsa (SCG, 2012)

A Deterministic O (m log m) Time Algorithm for the Reeb Graph. - Salman Parsa (Discret. Comput. Geom., 2013)

On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. - Herbert Edelsbrunner; Salman Parsa (SODA, 2014)

Small Model $2$-Complexes in $4$-space and Applications. - Salman Parsa (CoRR, 2015)

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. - Éric Colin de Verdière; Salman Parsa (SODA, 2017)

Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles. - Sharareh Alipour; Salman Parsa (CoRR, 2018)

On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. - Salman Parsa (Discret. Comput. Geom., 2018)

Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles. - Sharareh Alipour; Salman Parsa (COCOA, 2020)

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 (CoRR, 2020)

Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. - Salman Parsa (Discret. Comput. Geom., 2020)

How to Morph Graphs on the Torus. - Erin Wolf Chambers; Jeff Erickson 001; Patrick Lin 001; Salman Parsa (SODA, 2021)

On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. - Erin Wolf Chambers; Salman Parsa; Hannah Schreiber (SoCG, 2022)

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. - Tim Ophelders; Salman Parsa (SoCG, 2022)

Revisiting Graph Persistence for Updates and Efficiency. - Tamal K. Dey; Tao Hou 002; Salman Parsa (WADS, 2023)

Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles. - Sharareh Alipour; Salman Parsa (Discret. Math. Algorithms Appl., 2023)

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. - Erin Wolf Chambers; Francis Lazarus; Arnaud de Mesmay; Salman Parsa (Discret. Comput. Geom., 2023)

On the Parameterized Complexity of Motion Planning for Rectangular Robots. - Iyad Kanj; Salman Parsa (SoCG, 2024)

Harmonic Chain Barcode and Stability. - Salman Parsa; Bei Wang 001 (CoRR, 2024)

Tracking the Persistence of Harmonic Chains: Barcode and Stability. - Tau Hou; Salman Parsa; Bei Wang (CoRR, 2024)

Labeled interleaving distance for Reeb graphs. - Fangfei Lan; Salman Parsa; Bei Wang 001 (J. Appl. Comput. Topol., 2024)

Tracking the Persistence of Harmonic Chains: Barcode and Stability. - Tao Hou 002; Salman Parsa; Bei Wang 001 (SoCG, 2025)