Burning Spiders. - Sandip Das 001; Subhadeep Ranjan Dev; Arpan Sadhukhan; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2018)

The Weighted k-Center Problem in Trees for Fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (ISAAC, 2019)

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (JCDCGGG, 2022)

The weighted k-center problem in trees for fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (Theor. Comput. Sci., 2022)

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

A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. - Sandip Das 001; Subhadeep Ranjan Dev; Swami Sarvattomananda (Discret. Appl. Math., 2024)