E-LIB Suche - Ergebnisse für: Jallu, Ramesh

1

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

2

On d-distance m-tuple (ℓ,r)-domination in graphs:

Jena, Sangram K. ; Jallu, Ramesh K. ; Das, Gautam K.
Information Processing Letters. 174 (2022) - p. 106178 , 2022

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

3

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

4

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

5

Efficient independent set approximation in unit disk graphs:

Das, Gautam K. ; da Fonseca, Guilherme D. ; Jallu, Ramesh K.
Discrete Applied Mathematics. 280 (2020) - p. 63-70 , 2020

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

6

Liar's domination in unit disk graphs:

Jallu, Ramesh K. ; Jena, Sangram K. ; Das, Gautam K.
Theoretical Computer Science. 845 (2020) - p. 38-49 , 2020

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

7

Liar's dominating set problem on unit disk graphs:

Jallu, Ramesh K. ; Das, Gautam K.
Discrete Applied Mathematics. 286 (2020) - p. 91-99 , 2020

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

8

Distributed construction of connected dominating set in uni..:

Jallu, Ramesh K. ; Prasad, Prajwal R. ; Das, Gautam K.
Journal of Parallel and Distributed Computing. 104 (2017) - p. 159-166 , 2017

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

9

Terrain Prickliness: Theoretical Grounds for High Complexit..:

Acharyya, Ankush ; Jallu, Ramesh ; Löffler, Maarten...
1868-8969. , 2021

Link: https://dspace.library.u..

10

Terrain prickliness: theoretical grounds for high complexit..:

Acharyya, Ankush ; Jallu, Ramesh ; Löffler, M...
https://drops.dagstuhl.de/opus/volltexte/2021/14769/pdf/LIPIcs-GIScience-2021-II-10.pdf. , 2021

Link: http://hdl.handle.net/21..

11

Efficient independent set approximation in unit disk graphs..:

Das, Gautam ; da Fonseca, Guilherme ; Jallu, Ramesh
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2018.05.049. , 2018

Link: https://hal.archives-ouv..

12

Efficient independent set approximation in unit disk graphs..:

Das, Gautam ; da Fonseca, Guilherme ; Jallu, Ramesh
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2018.05.049. , 2018

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

13

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

14

Half-Guarding Weakly-Visible Polygons and Terrains:

Duraisamy, Nandhana ; Hillberg, Hannah Miller ; Jallu, Ramesh K...
doi:10.4230/LIPIcs.FSTTCS.2022.18. , 2022

Link: https://doi.org/10.4230/..

15

On the minimum spanning tree problem in imprecise set-up:

Dey, Sanjana ; Jallu, Ramesh K ; Nandy, Subhas C
http://arxiv.org/abs/2104.04229. , 2021

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