E-LIB Suche - Ergebnisse für: Roy, Sasanka

1

Constant delay lattice train schedules:

De Carufel, Jean-Lou ; Hill, Darryl ; Maheshwari, Anil..
Discrete Applied Mathematics. 339 (2023) - p. 1-10 , 2023

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

2

The balanced connected subgraph problem for geometric inter..:

Bhore, Sujoy ; Jana, Satyabrata ; Pandit, Supantha.
Theoretical Computer Science. 929 (2022) - p. 69-80 , 2022

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

3

The balanced connected subgraph problem:

Bhore, Sujoy ; Chakraborty, Sourav ; Jana, Satyabrata...
Discrete Applied Mathematics. 319 (2022) - p. 111-120 , 2022

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

4

Linear-size planar Manhattan network for convex point sets:

Jana, Satyabrata ; Maheshwari, Anil ; Roy, Sasanka
Computational Geometry. 100 (2022) - p. 101819 , 2022

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

5

Collision-free routing problem with restricted L-path:

Ajay, Jammigumpula ; Jana, Satyabrata ; Roy, Sasanka
Discrete Applied Mathematics. 319 (2022) - p. 71-80 , 2022

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

6

Balanced Connected Graph Partition:

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

Jana, Satyabrata ; Pandit, Supantha ; Roy, Sasanka - p. 487-499 , 2021

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

7

Constant work-space algorithms for facility location proble..:

Bhattacharya, Binay K. ; De, Minati ; Nandy, Subhas C..
Discrete Applied Mathematics. 283 (2020) - p. 456-472 , 2020

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

8

Corrigendum to: "Linear time algorithm to cover and hit a s..:

Sadhu, Sanjib ; He, Xiaozhou ; Roy, Sasanka..
Theoretical Computer Science. 806 (2020) - p. 632-640 , 2020

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

9

Maximum Bipartite Subgraph of Geometric Intersection Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Jana, Satyabrata ; Maheshwari, Anil ; Mehrabi, Saeed. - p. 158-169 , 2020

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

10

Problems on One Way Road Networks:

Ajay, Jammigumpula ; Das, Avinandan ; Dutta, Binayak...
Journal of Graph Algorithms and Applications. 24 (2020) 3 - p. 523-546 , 2020

Link: https://doi.org/10.7155/..

11

Optimal facility location problem on polyhedral terrains us..:

Dutta, Binayak ; Karmakar, Arindam ; Roy, Sasanka
Theoretical Computer Science. 847 (2020) - p. 68-75 , 2020

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

12

Balanced Connected Subgraph Problem in Geometric Intersecti..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Bhore, Sujoy ; Jana, Satyabrata ; Pandit, Supantha. - p. 56-68 , 2019

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

13

Linear time algorithm to cover and hit a set of line segmen..:

Sadhu, Sanjib ; Roy, Sasanka ; Nandy, Subhas C..
Theoretical Computer Science. 769 (2019) - p. 63-74 , 2019

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

14

Optimal deterministic distributed algorithms for maximal in..:

Molla, Anisur Rahaman ; Pandit, Supantha ; Roy, Sasanka
Journal of Parallel and Distributed Computing. 132 (2019) - p. 36-47 , 2019

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

15

Covering segments with unit squares:

Acharyya, Ankush ; Nandy, Subhas C. ; Pandit, Supantha.
Computational Geometry. 79 (2019) - p. 1-13 , 2019

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