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

Computing Largest Minimum Color-Spanning Intervals of Impre..:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,
Acharyya, Ankush ; Keikha, Vahideh ; Saumell, Maria. - p. 81-96 , 2024
Link: https://doi.org/10.1007/..
 
?
2

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

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

Constrained Hitting Set Problem with Intervals:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo. - p. 604-616 , 2021
Link: https://doi.org/10.1007/..
 
?
5

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

Minimum Color Spanning Circle in Imprecise Setup:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Acharyya, Ankush ; Jallu, Ramesh K. ; Keikha, Vahideh.. - p. 257-268 , 2021
Link: https://doi.org/10.1007/..
 
?
7

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

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

Localized Query: Color Spanning Variations:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,
Acharyya, Ankush ; Maheshwari, Anil ; Nandy, Subhas C. - p. 150-160 , 2019
Link: https://doi.org/10.1007/..
 
?
10

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

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

Minimum color spanning circle of imprecise points:

Acharyya, Ankush ; Jallu, Ramesh K ; Keikha, Vahideh..
http://arxiv.org/abs/2208.13865.  , 2022
Link: http://arxiv.org/abs/220..
 
?
13

Terrain Prickliness: Theoretical Grounds for High Complexit..:

Acharyya, Ankush ; Jallu, Ramesh ; Löffler, Maarten...
1868-8969.  , 2021
Link: https://dspace.library.u..
 
?
14

Terrain Prickliness: Theoretical Grounds for High Complexit..:

Acharyya, Ankush ; Jallu, Ramesh K ; Meijer, Gert G.T...
doi:10.4230/LIPIcs.GIScience.2021.II.10.  , 2021
Link: https://doi.org/10.4230/..
 
?
15

Constrained Hitting Set Problem with Intervals:

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
https://rhul.elsevierpure.com/en/publications/3e5eeec5-29ff-4bc4-ac00-8175c363f163.  , 2021
Link: https://rhul.elsevierpur..
 
1-15