default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPradeesha Ashok
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]V. P. Abidha, Pradeesha Ashok:
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects. Inf. Process. Lett. 186: 106485 (2024)- 2023
- [j12]V. P. Abidha
, Pradeesha Ashok, Avi Tomar, Dolly Yadav:
Colouring a dominating set without conflicts: q-Subset Square Colouring. Theor. Comput. Sci. 976: 114160 (2023) - [c12]Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:
Burn and Win. IWOCA 2023: 36-48 - [i9]V. P. Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav:
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. CoRR abs/2303.06864 (2023) - 2022
- [j11]Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Structural parameterization for minimum conflict-free colouring. Discret. Appl. Math. 319: 239-253 (2022) - [j10]Abidha V. P, Pradeesha Ashok:
Geometric separability using orthogonal objects. Inf. Process. Lett. 176: 106245 (2022) - [j9]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - [c11]Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav:
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. CSR 2022: 17-34 - [i8]V. P. Abidha, Pradeesha Ashok:
Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects. CoRR abs/2209.06661 (2022) - [i7]Pradeesha Ashok, Rajath Rao, Avi Tomar:
Polynomial Kernels for Generalized Domination Problems. CoRR abs/2211.03365 (2022) - 2020
- [j8]Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
Local search strikes again: PTAS for variants of geometric covering and packing. J. Comb. Optim. 39(2): 618-635 (2020) - [c10]Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Minimum Conflict Free Colouring Parameterized by Treewidth. CALDAM 2020: 439-450 - [i6]Abidha V. P, Pradeesha Ashok:
Geometric Separability using Orthogonal Objects. CoRR abs/2010.12227 (2020)
2010 – 2019
- 2019
- [c9]Pradeesha Ashok, Meghana M. Reddy:
Efficient Guarding of Polygons and Terrains. FAW 2019: 26-37 - [i5]Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav:
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. CoRR abs/1905.01822 (2019) - 2018
- [j7]Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh:
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. 32(2): 1189-1208 (2018) - [j6]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - 2017
- [j5]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79(3): 667-697 (2017) - [j4]Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh:
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661: 56-64 (2017) - [c8]Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. COCOON 2017: 25-37 - [c7]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - 2016
- [j3]Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal:
Selection Lemmas for Various Geometric Objects. Int. J. Comput. Geom. Appl. 26(2): 67-88 (2016) - [c6]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Parameterized Complexity of Red Blue Set Cover for Lines. LATIN 2016: 96-109 - 2015
- [j2]Pradeesha Ashok, Sathish Govindarajan:
On strong centerpoints. Inf. Process. Lett. 115(3): 431-434 (2015) - [c5]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Unique Covering Problems with Geometric Sets. COCOON 2015: 548-558 - [c4]Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay:
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. ISAAC 2015: 271-282 - [i4]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR abs/1511.07642 (2015) - 2014
- [j1]Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small strong epsilon nets. Comput. Geom. 47(9): 899-909 (2014) - [i3]Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan:
Selection Lemmas for various geometric objects. CoRR abs/1401.0443 (2014) - 2013
- [c3]Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra:
Hitting and Piercing Rectangles Induced by a Point Set. COCOON 2013: 221-232 - [i2]Pradeesha Ashok, Sathish Govindarajan:
On Strong Centerpoints. CoRR abs/1312.0387 (2013) - 2012
- [c2]B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan:
On Piercing (Pseudo)Lines and Boxes. CCCG 2012: 65-70 - [i1]Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small Strong Epsilon Nets. CoRR abs/1208.2785 (2012) - 2010
- [c1]Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni:
Small strong epsilon nets. CCCG 2010: 155-158
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-10-16 20:34 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:
