A deterministic o(m log m) time algorithm for the reeb graph S Parsa
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
93 2012 On the computational complexity of Betti numbers: reductions from matrix rank H Edelsbrunner, S Parsa
Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014
41 2014 How to morph graphs on the torus EW Chambers, J Erickson, P Lin, S Parsa
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
16 2021 On the Links of Vertices in Simplicial d -Complexes Embeddable in the Euclidean 2d -Space S Parsa
Discrete & Computational Geometry 59, 663-679, 2018
14 2018 On the Smith classes, the van Kampen obstruction and embeddability of S Parsa
arXiv preprint arXiv:2001.06478, 2020
8 2020 Revisiting graph persistence for updates and efficiency TK Dey, T Hou, S Parsa
Algorithms and Data Structures Symposium, 371-385, 2023
5 2023 On embeddability of joins and their ‘factors’ S Parsa, A Skopenkov
Topology and its Applications 326, 108409, 2023
5 2023 Algorithms for the Reeb graph and related concepts S Parsa
Duke University, 2014
5 2014 Instability of the Smith index under joins and applications to embeddability S Parsa
Transactions of the American Mathematical Society 375 (10), 7149-7185, 2022
4 2022 Deciding contractibility of a non-simple curve on the boundary of a 3-manifold ÉC de Verdière, S Parsa
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
2 2017 Efficient enhancement of the accuracy of Ray tracing V Mohtashami, S Parsa, AA Shishegar
2010 IEEE Antennas and Propagation Society International Symposium, 1-4, 2010
2 2010 A ray tracing acceleration technique for wave propagation modeling S Parsa, AA Shishegar
2009 Asia Pacific Microwave Conference, 1100-1103, 2009
2 2009 Correction to: On the Links of Vertices in Simplicial d -Complexes Embeddable in the Euclidean 2d -Space S Parsa
Discrete & Computational Geometry 64, 227-228, 2020
1 2020 Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem ÉC de Verdière, S Parsa
arXiv preprint arXiv:2001.04747, 2020
1 2020 Deciding contractibility of a non-simple curve on the boundary of a 3-manifold É Colin de Verdière, S Parsa
HAL 2017, 2017
1 2017 Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries EW Chambers, F Lazarus, A de Mesmay, S Parsa
Discrete & Computational Geometry 70 (2), 323-354, 2023
2023 Labeled Interleaving Distance for Reeb Graphs F Lan, S Parsa, B Wang
arXiv preprint arXiv:2306.01186, 2023
2023 Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles S Alipour, S Parsa
Discrete Mathematics, Algorithms and Applications 15 (01), 2250063, 2023
2023 Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals S Parsa, T Ophelders
arXiv preprint arXiv:2203.08364, 2022
2022 38th International Symposium on Computational Geometry (SoCG 2022) X Goaoc, M Kerber, A Aamand, M Abrahamsen, T Ahle, PMR Rasmussen, ...
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2022
2022