Minimum Spanning Tree of Line Segments. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (COCOON, 2018)

Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. - Kaustav Basu; Sanjana Dey; Subhas C. Nandy; Arunabha Sen (DRCN, 2019)

Discriminating Codes in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (ISAAC, 2020)

Minimum Consistent Subset Problem for Trees. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (FCT, 2021)

On the minimum spanning tree problem in imprecise set-up. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (CoRR, 2021)

Matrix Completion: Approximating the Minimum Diameter. - Diptarka Chakraborty; Sanjana Dey (ISAAC, 2023)

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (Algorithmica, 2023)

The RED-BLUE SEPARATION problem on graphs. - Subhadeep Ranjan Dev; Sanjana Dey; Florent Foucaud; Ralf Klasing; Tuomo Lehtilä (Theor. Comput. Sci., 2023)

Minimum consistent subset of simple graph classes. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (Discret. Appl. Math., 2023)

Many Flavors of Edit Distance. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Michal Koucký 001 (FSTTCS, 2024)

Monitoring edge-geodetic sets in graphs. - Subhadeep Ranjan Dev; Sanjana Dey; Florent Foucaud; Krishna Narayanan; Lekshmi Ramasubramony Sulochana (Discret. Appl. Math., 2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Mursalin Habib; Bernhard Haeupler; Karthik C. S. 001; Michal Koucký 001 (CoRR, 2025)

Improved Rank Aggregation under Fairness Constraint. - Diptarka Chakraborty; Himika Das; Sanjana Dey; Alvin Yan Hong Yao (CoRR, 2025)