Subhadeep Ranjan Dev

11 papers B 1C 1Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Monitoring edge-geodetic sets in graphs.
Discret. Appl. Math.
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
2024 J jnl
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes.
Discret. Appl. Math.
Sandip Das, Subhadeep Ranjan Dev, Swami Sarvattomananda
2023 J jnl
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.
CoRR
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2023 J jnl
The RED-BLUE SEPARATION problem on graphs.
Theor. Comput. Sci.
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 — conf
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.
JCDCGGG
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022 J jnl
The RED-BLUE SEPARATION problem on graphs.
CoRR
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 C conf
The Red-Blue Separation Problem on Graphs.
IWOCA
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 J jnl
The weighted
Theor. Comput. Sci.
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2021 — conf
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes.
CALDAM
Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda
2019 B conf
The Weighted k-Center Problem in Trees for Fixed k.
ISAAC
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2018 — conf
Burning Spiders.
CALDAM
Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen