E-LIB Suche - Ergebnisse für: Dev, Subhadeep Ranjan

1

A worst-case optimal algorithm to compute the Minkowski sum..:

Das, Sandip ; Dev, Subhadeep Ranjan ; Sarvottamananda
Discrete Applied Mathematics. 350 (2024) - p. 44-61 , 2024

Link: https://doi.org/10.1016/..

2

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
Theoretical Computer Science. 970 (2023) - p. 114061 , 2023

Link: https://doi.org/10.1016/..

3

The Red-Blue Separation Problem on Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent.. - p. 285-298 , 2022

Link: https://doi.org/10.1007/..

4

The weighted k-center problem in trees for fixed k:

Bhattacharya, Binay ; Das, Sandip ; Dev, Subhadeep Ranjan
Theoretical Computer Science. 906 (2022) - p. 64-75 , 2022

Link: https://doi.org/10.1016/..

5

A Worst-Case Optimal Algorithm to Compute the Minkowski Sum..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Das, Sandip ; Dev, Subhadeep Ranjan ; Sarvottamananda, Swami - p. 179-195 , 2021

Link: https://doi.org/10.1007/..

6

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/arxiv/2211.08283. , 2023

Link: https://hal.science/hal-..

7

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/arxiv/2211.08283. , 2023

Link: https://hal.science/hal-..

8

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/arxiv/2211.08283. , 2023

Link: https://hal.science/hal-..

9

A Subquadratic Time Algorithm for the Weighted $k$-Center P..:

Bhattacharya, Binay ; Das, Sandip ; Dev, Subhadeep Ranjan
http://arxiv.org/abs/2303.17204. , 2023

Link: http://arxiv.org/abs/230..

10

The Red-Blue Separation Problem on Graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-06678-8_21. , 2022

Link: https://hal.science/hal-..

11

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
http://arxiv.org/abs/2211.08283. , 2022

Link: http://arxiv.org/abs/221..

12

The Red-Blue Separation Problem on Graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-06678-8_21. , 2022

Link: https://hal.science/hal-..

13

The Red-Blue Separation Problem on Graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-06678-8_21. , 2022

Link: https://hal.science/hal-..

14

The Red-Blue Separation Problem on Graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-06678-8_21. , 2022

Link: https://hal.science/hal-..

15

The Red-Blue Separation Problem on Graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-06678-8_21. , 2022

Link: https://hal.science/hal-..