default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamesh K. Jallu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j9]Sangram Kishor Jena
, Ramesh K. Jallu, Gautam K. Das:
On d-distance m-tuple (ℓ, r)-domination in graphs. Inf. Process. Lett. 174: 106178 (2022)- [j8]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum color spanning circle of imprecise points. Theor. Comput. Sci. 930: 116-127 (2022) - 2021
- [j7]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-supplier problem in IR2. Oper. Res. Lett. 49(1): 48-54 (2021) - 2020
- [j6]Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu:
Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280: 63-70 (2020) - [j5]Ramesh K. Jallu, Gautam K. Das:
Liar's dominating set problem on unit disk graphs. Discret. Appl. Math. 286: 91-99 (2020) - [j4]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das:
Constrained k-Center Problem on a Convex Polygon. Int. J. Found. Comput. Sci. 31(2): 275-291 (2020) - [j3]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's domination in unit disk graphs. Theor. Comput. Sci. 845: 38-49 (2020) - 2017
- [j2]Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das:
Distributed construction of connected dominating set in unit disk graphs. J. Parallel Distributed Comput. 104: 159-166 (2017) - 2015
- [j1]Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein:
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25(3): 227- (2015)
Conference and Workshop Papers
- 2022
- [c10]Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS 2022: 18:1-18:17 - 2021
- [c9]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum Color Spanning Circle in Imprecise Setup. COCOON 2021: 257-268 - [c8]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. GIScience (II) 2021: 10:1-10:16 - 2018
- [c7]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Dominating Set in Unit Disk Graphs. COCOON 2018: 516-528 - [c6]Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
Minimum Spanning Tree of Line Segments. COCOON 2018: 529-541 - [c5]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW 2018: 68-80 - 2017
- [c4]Ramesh K. Jallu, Gautam K. Das:
Liar's Domination in 2D. CALDAM 2017: 219-229 - 2016
- [c3]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-Supplier Problem in. ALGOSENSORS 2016: 129-140 - [c2]Ramesh K. Jallu, Gautam K. Das:
Improved Algorithm for Maximum Independent Set on Unit Disk Graph. CALDAM 2016: 212-223 - 2015
- [c1]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das:
Constrained k-Center Problem on a Convex Polygon. ICCSA (2) 2015: 209-222
Informal and Other Publications
- 2022
- [i8]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum color spanning circle of imprecise points. CoRR abs/2208.13865 (2022) - 2021
- [i7]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary:
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR abs/2103.06696 (2021) - [i6]Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
On the minimum spanning tree problem in imprecise set-up. CoRR abs/2104.04229 (2021) - 2020
- [i5]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Domination in Unit Disk Graphs. CoRR abs/2005.13913 (2020) - [i4]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR abs/2006.15381 (2020) - 2019
- [i3]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das:
Generalized Liar's Dominating Set in Graphs. CoRR abs/1907.11416 (2019) - 2016
- [i2]Ramesh K. Jallu, Gautam K. Das:
Hardness of Liar's Domination on Unit Disk Graphs. CoRR abs/1611.07808 (2016) - 2013
- [i1]Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das:
Minimum Dominating Set for a Point Set in $\IR^2$. CoRR abs/1312.7243 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
