My current area of research is broadly Theoretical Computer Science focusing mostly on designing approximation/exact algorithms for problems on Computational Geometry, Graph Theory, Strings etc. Here is a list of my publications.
Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg and Michal Koucky. Many Flavors of Edit Distance. Accepted to FSTTCS 2024.
Sanjana Dey, Anil Maheshwari and Subhas C. Nandy. Minimum Consistent Subset Problem for Trees. Accepted to Journal of Combinatorial Optimization 2024.
Sanjana Dey, Anil Maheshwari and Subhas C. Nandy. Minimum Consistent Subset of Simple Graph Classes. Discrete Applied Mathematics 2023.
Subhadeep R Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing and Tuomo Lehtila. Red-Blue Separation on graphs. Theoretical Computer Science 2023.
Diptarka Chakraborty and Sanjana Dey. Matrix Completion: Approximating the Minimum Diameter. ISAAC 2023.
Sanjana Dey, Florent Foucaud, Subhas C. Nandy and Arunabha Sen. Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 2022. DOI
Subhadeep R Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing and Tuomo Lehtila. Red-Blue Separation on graphs. IWOCA 2022. DOI.
Sanjana Dey, Anil Maheshwari and Subhas C. Nandy. Minimum Consistent Subset Problem for Trees. FCT 2021. DOI.
Sanjana Dey, Anil Maheshwari and Subhas C. Nandy. Minimum Consistent Subset of Simple Graph Classes. CALDAM 2021. DOI.
Sanjana Dey, Florent Foucaud, Subhas C. Nandy and Arunabha Sen. Discriminating Codes in Geometric Setups. ISAAC 2020. DOI.
Kaustav Basu, Sanjana Dey, Subhas C. Nandy and Arunabha Sen. Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. DRCN 2019. DOI.
Sanjana Dey, Ramesh K. Jallu and Subhas C. Nandy. Minimum Spanning Tree of Line Segments. COCOON 2018. DOI.
Subhadeep R Dev, Sanjana Dey, Florent Foucaud, Narayanan Krishna and Subbu Lekshmi. Monitoring Edge Geodetic Sets.