EDBT 2026 Demo / reviewers in the wild / expert

Ramesh K. Jallu

dblp:139/0918 · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
4since 2021 · last 2022
0000-0001-8811-5694ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 3 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2022 Half-Guarding Weakly-Visible Polygons and Terrains
abstract
We consider a variant of the art gallery problem where all guards are limited to seeing 180degree. Guards that can only see in one direction are called half-guards. We give a polynomial time approximation scheme for vertex guarding the vertices of a weakly-visible polygon with half-guards. We extend this to vertex guarding the boundary of a weakly-visible polygon with half-guards. We also show NP-hardness for vertex guarding a weakly-visible polygon with half-guards. Lastly, we show that the orientation of half-guards is critical in terrain guarding. Depending on the orientation of the half-guards, the problem is either very easy (polynomial time solvable) or very hard (NP-hard).
Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow
 FSTTCS3
2022 On d-distance m-tuple (ℓ, r)-domination in graphs
Sangram K. Jena 0001, Ramesh K. Jallu, Gautam K. Das
 Inf. Process. Lett.2
2022 Minimum color spanning circle of imprecise points
Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell
 Theor. Comput. Sci.2
2021 Minimum Color Spanning Circle in Imprecise Setup
Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell
 COCOON2
2020 Efficient independent set approximation in unit disk graphs
Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu
 Discret. Appl. Math.3
2020 Liar's dominating set problem on unit disk graphs
Ramesh K. Jallu, Gautam K. Das
 Discret. Appl. Math.1
2020 Liar's domination in unit disk graphs
Ramesh K. Jallu, Sangram K. Jena 0001, Gautam K. Das
 Theor. Comput. Sci.1
2018 Minimum Spanning Tree of Line Segments
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
 COCOON2
2018 Liar's Dominating Set in Unit Disk Graphs
Ramesh K. Jallu, Sangram K. Jena 0001, Gautam K. Das
 COCOON1
2017 Distributed construction of connected dominating set in unit disk graphs
Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das
 J. Parallel Distributed Comput.1
2016 The Euclidean k-Supplier Problem in
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
 ALGOSENSORS2
2015 Constrained k-Center Problem on a Convex Polygon
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das
 ICCSA (2)2