Subhasree Methirumangalath

According to our database, Subhasree Methirumangalath authored at least 9 papers between 2015 and 2025.

Collaborative distances:

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

2025

Classical and parameterized complexity of covering problems in line segment arrangements.

M. Rema, R. Subashini, Subhasree Methirumangalath, Varun Rajan

Int. J. Comput. Math. Comput. Syst. Theory, 2025

2024

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

2023

On the parameterized complexity of the Maximum Exposure Problem.

Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath

Inf. Process. Lett., 2023

Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement.

M. Rema, R. Subashini, Subhasree Methirumangalath, Varun Rajan

Proceedings of the Intelligent Data Engineering and Analytics, 2023

2020

TCM-ICP: Transformation Compatibility Measure for Registering Multiple LIDAR Scans.

Aby Thomas, Adarsh Sunilkumar, Shankar Shylesh, Aby Abahai T., Subhasree Methirumangalath, Dong Chen, Jiju Peethambaran

CoRR, 2020

2018

Peeling the longest: A simple generalized curve reconstruction algorithm.

Amal Dev Parakkat, Subhasree Methirumangalath, Ramanathan Muthuganapathy

Comput. Graph., 2018

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

Reconstruction using a simple triangle removal approach.

Subhasree Methirumangalath, Amal Dev Parakkat, Shyam Sundar Kannan, Ramanathan Muthuganapathy

Proceedings of the SIGGRAPH Asia 2017 Technical Briefs, Bangkok, Thailand, November 27, 2017

2015

A unified approach towards reconstruction of a planar point set.

Subhasree Methirumangalath, Amal Dev Parakkat, Ramanathan Muthuganapathy

Comput. Graph., 2015