Salman Parsa
Welcome to my homepage!
Journal Articles 

S. Parsa, “On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space”, Discrete & Computational Geometry (2017). 

S. Parsa, “A Deterministic O ( m log m ) Time Algorithm for the Reeb Graph”. Discrete & Computational Geometry 49(4): 864-878 (2013) [ First version in SOCG 2012] 
Conference Papers 

É. Colin de Verdière, S. Parsa, “Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold”, Proceedings of the twenty-eighth annual ACM-SIAM Symposium On Discrete Algorithms. 2017, 2691-2704 

 H. Edelsbrunner, S. Parsa, “On the computational complexity of Betti numbers: reductions from matrix rank”, Proceedings of the twenty-fifth annual ACM-SIAM Symposium On Discrete Algorithms. 2014, 152-160. 

 S. Parsa, A. Shishegar, “A Ray Tracing Acceleration Technique for Wave Propagation Modeling”, Proc. IEEE Asia–Pacific Microwave Conference, 2009 

 A. Hedayati, S. Parsa, M. Ghodsi, “Touring a Sequence of Polygons in Weighted Regions”, 12th CSI Computer Conference (CSICC'2006), Shahid Beheshti University, Tehran, Feb 20-22, 2007 

S.Parsa, On the Smith classes, the van Kampen obstruction and embeddability of [3]∗K, submitted, 2019.  

 S. Alipour, S. Parsa, “Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles”,  
Arxiv e-prints, arXiv:1805.07724, submitted, 2018. 

 S. Parsa, “Small Model 2-Complexes in 4-space and Applications.” ArXiv e-prints, 
1512.05152, 2015.