default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManjanna Basappa
Person information
- affiliation: Birla Institute of Technology & Science Pilani, Hyderabad Campus, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Vishwanath R. Singireddy
, Manjanna Basappa:
Dispersing facilities on planar segment and circle amidst repulsion. J. Glob. Optim. 88(1): 233-252 (2024)- 2023
- [c9]Vishwanath R. Singireddy, Manjanna Basappa, Joseph S. B. Mitchell:
Algorithms for k-Dispersion for Points in Convex Position in the Plane. CALDAM 2023: 59-70 - [i6]Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind:
Line-Constrained k-Semi-Obnoxious Facility Location. CoRR abs/2307.03488 (2023) - 2022
- [c8]Vishwanath R. Singireddy, Manjanna Basappa:
Dispersing Facilities on Planar Segment and Circle Amidst Repulsion. ALGOSENSORS 2022: 138-151 - [i5]Vishwanath R. Singireddy, Manjanna Basappa:
Max-Min k-Dispersion on a Convex Polygon. CoRR abs/2205.02021 (2022) - [i4]Vishwanath R. Singireddy, Manjanna Basappa:
Dispersing Facilities on Planar Segment and Circle Amidst Repulsion. CoRR abs/2205.03651 (2022) - 2021
- [j5]Manjanna Basappa:
Line segment disk cover. Discret. Appl. Math. 305: 261-271 (2021) - [j4]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) - [c7]Vishwanath R. Singireddy, Manjanna Basappa:
Constrained Obnoxious Facility Location on a Line Segment. CCCG 2021: 362-367 - [c6]Monith S. Reyunuru, Kriti Jethlia, Manjanna Basappa:
The k-Colorable Unit Disk Cover Problem. ICCSA (1) 2021: 402-417 - [c5]Manjanna Basappa, Sudeepta Mishra:
Interference Reduction in Directional Wireless Networks. ICDCIT 2021: 114-126 - [i3]Monith S. Reyunuru, Kriti Jethlia, Manjanna Basappa:
The k-Colorable Unit Disk Cover Problem. CoRR abs/2104.00207 (2021) - [i2]Vishwanath R. Singireddy, Manjanna Basappa:
Edge-Vertex Dominating Set in Unit Disk Graphs. CoRR abs/2111.13552 (2021) - 2020
- [j3]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)
2010 – 2019
- 2018
- [j2]Manjanna Basappa, Gautam K. Das:
Discrete unit square cover problem. Discret. Math. Algorithms Appl. 10(6): 1850072:1-1850072:18 (2018) - [c4]Manjanna Basappa:
Line Segment Disk Cover. CALDAM 2018: 81-92 - 2016
- [c3]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-Supplier Problem in. ALGOSENSORS 2016: 129-140 - 2015
- [j1]Manjanna Basappa, Rashmisnata Acharyya, Gautam K. Das:
Unit disk cover problem in 2D. J. Discrete Algorithms 33: 193-201 (2015) - [c2]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das:
Constrained k-Center Problem on a Convex Polygon. ICCSA (2) 2015: 209-222 - 2013
- [c1]Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das:
Unit Disk Cover Problem in 2D. ICCSA (2) 2013: 73-85 - 2012
- [i1]Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das:
Unit Disk Cover Problem. CoRR abs/1209.2951 (2012)
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-25 05: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:
