Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Acharyya, Ankush
7  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

Constrained hitting set problem with intervals: Hardness, F..:

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
Theoretical Computer Science.  990 (2024)  - p. 114402 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Minimum color spanning circle of imprecise points:

Acharyya, Ankush ; Jallu, Ramesh K. ; Keikha, Vahideh..
Theoretical Computer Science.  930 (2022)  - p. 116-127 , 2022
Link: https://doi.org/10.1016/..
 
?
3

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/..
 
?
4

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/..
 
?
5

Variations of largest rectangle recognition amidst a bichro..:

Acharyya, Ankush ; De, Minati ; Nandy, Subhas C..
Discrete Applied Mathematics.  286 (2020)  - p. 35-50 , 2020
Link: https://doi.org/10.1016/..
 
?
6

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/..
 
?
7

Minimum width color spanning annulus:

Acharyya, Ankush ; Nandy, Subhas C. ; Roy, Sasanka
Theoretical Computer Science.  725 (2018)  - p. 16-30 , 2018
Link: https://doi.org/10.1016/..
 
1-7