Salman Parsa

According to our database, Salman Parsa authored at least 18 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the Parameterized Complexity of Motion Planning for Rectangular Robots.

Iyad Kanj, Salman Parsa

CoRR, 2024

2023

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries.

Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa

Discret. Comput. Geom., September, 2023

Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles.

Sharareh Alipour, Salman Parsa

Discret. Math. Algorithms Appl., January, 2023

Labeled Interleaving Distance for Reeb Graphs.

Fangfei Lan, Salman Parsa, Bei Wang

CoRR, 2023

Revisiting Graph Persistence for Updates and Efficiency.

Tamal K. Dey, Tao Hou, Salman Parsa

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals.

Tim Ophelders, Salman Parsa

Proceedings of the 38th International Symposium on Computational Geometry, 2022

On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class.

Erin Wolf Chambers, Salman Parsa, Hannah Schreiber

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

How to Morph Graphs on the Torus.

Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space.

Salman Parsa

Discret. Comput. Geom., 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

Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles.

Sharareh Alipour, Salman Parsa

Proceedings of the Combinatorial Optimization and Applications, 2020

2018

On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space.

Salman Parsa

Discret. Comput. Geom., 2018

Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles.

Sharareh Alipour, Salman Parsa

CoRR, 2018

2017

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold.

Éric Colin de Verdière, Salman Parsa

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2015

Small Model $2$-Complexes in $4$-space and Applications.

Salman Parsa

CoRR, 2015

2014

On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank.

Herbert Edelsbrunner, Salman Parsa

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

A Deterministic O (m log m) Time Algorithm for the Reeb Graph.

Salman Parsa

Discret. Comput. Geom., 2013

2012

A deterministic <i>o(m log m)</i> time algorithm for the reeb graph.

Salman Parsa

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012