E-LIB Suche - Ergebnisse für: Nandy, Subhas C.

1

On the Construction of Planar Embedding for a Class of Orth..:

, In: Lecture Notes in Computer Science; Combinatorial Image Analysis,

Karmakar, Nilanjana ; Biswas, Arindam ; Nandy, Subhas C.. - p. 84-104 , 2023

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

2

Minimum consistent subset of simple graph classes:

Dey, Sanjana ; Maheshwari, Anil ; Nandy, Subhas C.
Discrete Applied Mathematics. 338 (2023) - p. 255-277 , 2023

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

3

Acrophobic guard watchtower problem:

Seth, Ritesh ; Maheshwari, Anil ; Nandy, Subhas C.
Computational Geometry. 109 (2023) - p. 101918 , 2023

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

4

Exact Algorithms and Hardness Results for Geometric Red-Blu..:

, In: Frontiers of Algorithmic Wisdom; Lecture Notes in Computer Science,

Madireddy, Raghunath Reddy ; Nandy, Subhas C. ; Pandit, Supantha - p. 176-191 , 2022

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

5

Complexity and Approximation for Discriminating and Identif..:

Dey, Sanjana ; Foucaud, Florent ; Nandy, Subhas C..
Algorithmica. 85 (2022) 7 - p. 1850-1882 , 2022

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

6

Guest Editors' Foreword:

Hong, Seok-Hee ; Nandy, Subhas C. ; Uehara, Ryuhei
Journal of Graph Algorithms and Applications. 26 (2022) 2 - p. 207-208 , 2022

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

7

Algorithms and Discrete Mathematics – celebrating the silve..:

Das, Gautam Kumar ; Nandy, Subhas C. ; Sohel Rahman, M.
Theoretical Computer Science. 864 (2021) - p. 139-140 , 2021

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

8

Sparsity of weighted networks: Measures and applications:

Goswami, Swati ; Das, Asit K. ; Nandy, Subhas C.
Information Sciences. 577 (2021) - p. 557-578 , 2021

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

9

WALCOM: Algorithms and Computation: 15th International Conf..

Theoretical Computer Science and General Issues, 12635

Uehara, Ryuhei ; Hong, Seok-Hee ; Nandy, Subhas C - 1st ed. 2021 . , 2021

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

10

Color-spanning localized query:

Acharyya, Ankush ; Maheshwari, Anil ; Nandy, Subhas C.
Theoretical Computer Science. 861 (2021) - p. 85-101 , 2021

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

11

On the Geometric Red-Blue Set Cover Problem:

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

Madireddy, Raghunath Reddy ; Nandy, Subhas C. ; Pandit, Supantha - p. 129-141 , 2021

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

12

Minimum Consistent Subset of Simple Graph Classes:

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

Dey, Sanjana ; Maheshwari, Anil ; Nandy, Subhas C. - p. 471-484 , 2021

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

13

The Euclidean k-supplier problem in IR2:

Basappa, Manjanna ; Jallu, Ramesh K. ; Das, Gautam K..
Operations Research Letters. 49 (2021) 1 - p. 48-54 , 2021

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

14

Minimum Consistent Subset Problem for Trees:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Dey, Sanjana ; Maheshwari, Anil ; Nandy, Subhas C. - p. 204-216 , 2021

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

15

Range assignment of base-stations maximizing coverage area ..:

Acharyya, Ankush ; De, Minati ; Nandy, Subhas C..
Theoretical Computer Science. 804 (2020) - p. 81-97 , 2020

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