default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalman Parsa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]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): 323-354 (2023)- [j4]Sharareh Alipour, Salman Parsa:
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles. Discret. Math. Algorithms Appl. 15(1): 2250063:1-2250063:14 (2023) - 2020
- [j3]Salman Parsa
:
Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. Discret. Comput. Geom. 64(1): 227-228 (2020) - 2018
- [j2]Salman Parsa:
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. Discret. Comput. Geom. 59(3): 663-679 (2018) - 2013
- [j1]Salman Parsa:
A Deterministic O (m log m) Time Algorithm for the Reeb Graph. Discret. Comput. Geom. 49(4): 864-878 (2013)
Conference and Workshop Papers
- 2024
- [c10]Iyad Kanj, Salman Parsa:
On the Parameterized Complexity of Motion Planning for Rectangular Robots. SoCG 2024: 65:1-65:15 - 2023
- [c9]Tamal K. Dey, Tao Hou, Salman Parsa:
Revisiting Graph Persistence for Updates and Efficiency. WADS 2023: 371-385 - 2022
- [c8]Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. SoCG 2022: 25:1-25:15 - [c7]Tim Ophelders, Salman Parsa:
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. SoCG 2022: 55:1-55:16 - 2021
- [c6]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG 2021: 23:1-23:16 - [c5]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. SODA 2021: 2759-2778 - 2020
- [c4]Sharareh Alipour, Salman Parsa:
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles. COCOA 2020: 350-363 - 2017
- [c3]Éric Colin de Verdière, Salman Parsa:
Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. SODA 2017: 2691-2704 - 2014
- [c2]Herbert Edelsbrunner, Salman Parsa:
On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. SODA 2014: 152-160 - 2012
- [c1]Salman Parsa:
A deterministic o(m log m) time algorithm for the reeb graph. SCG 2012: 269-276
Informal and Other Publications
- 2024
- [i11]Iyad Kanj, Salman Parsa:
On the Parameterized Complexity of Motion Planning for Rectangular Robots. CoRR abs/2402.17846 (2024) - [i10]Salman Parsa, Bei Wang:
Harmonic Chain Barcode and Stability. CoRR abs/2409.06093 (2024) - 2023
- [i9]Fangfei Lan, Salman Parsa, Bei Wang:
Labeled Interleaving Distance for Reeb Graphs. CoRR abs/2306.01186 (2023) - 2022
- [i8]Salman Parsa, Tim Ophelders:
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. CoRR abs/2203.08364 (2022) - 2021
- [i7]Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. CoRR abs/2112.02380 (2021) - 2020
- [i6]É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 abs/2001.04747 (2020) - [i5]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. CoRR abs/2007.07927 (2020) - [i4]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR abs/2012.02352 (2020) - 2018
- [i3]Sharareh Alipour, Salman Parsa:
Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles. CoRR abs/1805.07724 (2018) - 2015
- [i2]Salman Parsa:
Small Model $2$-Complexes in $4$-space and Applications. CoRR abs/1512.05152 (2015) - [i1]Salman Parsa:
On links of vertices in simplicial $d$-complexes embeddable in euclidean $2d$-space. CoRR abs/1512.05164 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
