Subhadeep Ranjan Dev

According to our database, Subhadeep Ranjan Dev authored at least 6 papers between 2018 and 2024.

Collaborative distances:

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

2024

A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes.

Sandip Das, Subhadeep Ranjan Dev, Swami Sarvattomananda

Discret. Appl. Math., 2024

2023

The RED-BLUE SEPARATION problem on graphs.

Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä

Theor. Comput. Sci., August, 2023

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

CoRR, 2023

2022

The weighted <i>k</i>-center problem in trees for fixed <i>k</i>.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

Theor. Comput. Sci., 2022

2019

The Weighted k-Center Problem in Trees for Fixed k.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Burning Spiders.

Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018