A unified approach towards reconstruction of a planar point set. - Subhasree Methirumangalath; Amal Dev Parakkat; Ramanathan Muthuganapathy (Comput. Graph., 2015)

Reconstruction using a simple triangle removal approach. - Subhasree Methirumangalath; Amal Dev Parakkat; Shyam Sundar Kannan; Ramanathan Muthuganapathy (SIGGRAPH Asia Technical Briefs, 2017)

Hole detection in a planar point set: An empty disk approach. - Subhasree Methirumangalath; Shyam Sundar Kannan; Amal Dev Parakkat; Ramanathan Muthuganapathy (Comput. Graph., 2017)

Peeling the longest: A simple generalized curve reconstruction algorithm. - Amal Dev Parakkat; Subhasree Methirumangalath; Ramanathan Muthuganapathy (Comput. Graph., 2018)

TCM-ICP: Transformation Compatibility Measure for Registering Multiple LIDAR Scans. - Aby Thomas; Adarsh Sunilkumar; Shankar Shylesh; Aby Abahai T.; Subhasree Methirumangalath; Dong Chen 009; Jiju Peethambaran (CoRR, 2020)

Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement. - M. Rema; R. Subashini; Subhasree Methirumangalath; Varun Rajan (FICTA (2), 2023)

On the parameterized complexity of the Maximum Exposure Problem. - Remi Raman; Shahin John J. S; R. Subashini; Subhasree Methirumangalath (Inf. Process. Lett., 2023)

Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements. - Remi Raman; Shahin John J. S; R. Subashini; Subhasree Methirumangalath (Int. J. Comput. Math. Comput. Syst. Theory, 2024)