default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnkush Acharyya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Ankush Acharyya
, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990: 114402 (2024)- [c8]Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:
Computing Largest Minimum Color-Spanning Intervals of Imprecise Points. LATIN (1) 2024: 81-96 - [i8]Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:
Computing largest minimum color-spanning intervals of imprecise points. CoRR abs/2410.03213 (2024) - 2022
- [j6]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) - [i7]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
- [j5]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color-spanning localized query. Theor. Comput. Sci. 861: 85-101 (2021) - [c7]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum Color Spanning Circle in Imprecise Setup. COCOON 2021: 257-268 - [c6]Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained Hitting Set Problem with Intervals. COCOON 2021: 604-616 - [c5]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 - [i6]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) - 2020
- [j4]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. 286: 35-50 (2020) - [j3]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804: 81-97 (2020)
2010 – 2019
- 2019
- [j2]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with unit squares. Comput. Geom. 79: 1-13 (2019) - [c4]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Localized Query: Color Spanning Variations. CALDAM 2019: 150-160 - [i5]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color spanning Localized query. CoRR abs/1905.05066 (2019) - [i4]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR abs/1905.07124 (2019) - 2018
- [j1]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum width color spanning annulus. Theor. Comput. Sci. 725: 16-30 (2018) - 2017
- [c3]Ankush Acharyya, Minati De, Subhas C. Nandy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG 2017: 126-131 - [c2]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. WADS 2017: 1-12 - [i3]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR abs/1705.09346 (2017) - 2016
- [c1]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum Width Color Spanning Annulus. COCOON 2016: 431-442 - [i2]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with axis-parallel unit squares. CoRR abs/1607.07256 (2016) - [i1]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR abs/1609.04148 (2016)
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 2025-01-21 00:15 CET 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:
