Sanjana Dey

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 13

Top Topics

Complexity Bounds

Graph Theoretic

Top Venues

Publications

Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970 (2023)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85 (7) (2023)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum consistent subset of simple graph classes. Discret. Appl. Math. 338 (2023)
Diptarka Chakraborty, Sanjana Dey
Matrix Completion: Approximating the Minimum Diameter. ISAAC (2023)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs. IWOCA (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. CoRR (2022)
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
On the minimum spanning tree problem in imprecise set-up. CoRR (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset of Simple Graph Classes. CALDAM (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset Problem for Trees. FCT (2021)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. CoRR (2020)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. ISAAC (2020)
Kaustav Basu, Sanjana Dey, Subhas C. Nandy, Arunabha Sen
Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. DRCN (2019)
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
Minimum Spanning Tree of Line Segments. COCOON (2018)