Pradeesha Ashok

41 papers A* 1B 3C 1Misc 5Journal 25Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Burn and win.
Theor. Comput. Sci.
Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma
2025 — conf
Burning Path-Like and Clique-Like Graphs.
CIAC (2)
Radhika Aggarwal, Pradeesha Ashok, Dhairya Gupta
2025 B conf
On the Parameterized Complexity of Cosecure Domination.
FCT
D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi
2025 — conf
Parameterized Complexity of Coupon Coloring of Graphs.
CALDAM
Pradeesha Ashok, Pradyun Devarakonda, Shiven Phogat, Swaroop A. Ram Rayala, J. A. Sherin
2024 — conf
(Independent) Roman Domination Parameterized by Distance to Cluster.
COCOA (2)
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 J jnl
(Independent) Roman Domination Parameterized by Distance to Cluster.
CoRR
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 J jnl
Perfect UE Grouping for Frequency Sharing in Full Duplex Cellular Networks.
IEEE Wirel. Commun. Lett.
Parthiban Annamalai, Pradeesha Ashok, Rajath Rao, Divyanshi Rajput, Jyotsna Bapat, Debabrata Das
2024 J jnl
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects.
Inf. Process. Lett.
V. P. Abidha, Pradeesha Ashok
2023 C conf
Burn and Win.
IWOCA
Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma
2023 J jnl
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring.
CoRR
V. P. Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav
2023 J jnl
Colouring a dominating set without conflicts:
Theor. Comput. Sci.
V. P. Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav
2022 Misc conf
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring.
CSR
Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav
2022 J jnl
Exact Multi-Covering Problems with Geometric Sets.
Theory Comput. Syst.
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2022 J jnl
Geometric separability using orthogonal objects.
Inf. Process. Lett.
Abidha V. P, Pradeesha Ashok
2022 J jnl
Polynomial Kernels for Generalized Domination Problems.
CoRR
Pradeesha Ashok, Rajath Rao, Avi Tomar
2022 J jnl
Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects.
CoRR
V. P. Abidha, Pradeesha Ashok
2022 J jnl
Structural parameterization for minimum conflict-free colouring.
Discret. Appl. Math.
Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav
2020 J jnl
Geometric Separability using Orthogonal Objects.
CoRR
Abidha V. P, Pradeesha Ashok
2020 J jnl
Local search strikes again: PTAS for variants of geometric covering and packing.
J. Comb. Optim.
Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan
2020 — conf
Minimum Conflict Free Colouring Parameterized by Treewidth.
CALDAM
Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav
2019 Misc conf
Efficient Guarding of Polygons and Terrains.
FAW
Pradeesha Ashok, Meghana M. Reddy
2019 J jnl
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding.
CoRR
Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav
2018 J jnl
Exact Algorithms for Terrain Guarding.
ACM Trans. Algorithms
Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2018 J jnl
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.
SIAM J. Discret. Math.
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
2017 A* conf
Exact Algorithms for Terrain Guarding.
SoCG
Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2017 Misc conf
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing.
COCOON
Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan
2017 J jnl
Multivariate Complexity Analysis of Geometric Red Blue Set Cover.
Algorithmica
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2017 J jnl
Parameterized complexity of Strip Packing and Minimum Volume Packing.
Theor. Comput. Sci.
Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
2016 B conf
Parameterized Complexity of Red Blue Set Cover for Lines.
LATIN
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016 J jnl
Selection Lemmas for Various Geometric Objects.
Int. J. Comput. Geom. Appl.
Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal
2015 B conf
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.
ISAAC
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
2015 J jnl
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}.
CoRR
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2015 J jnl
On strong centerpoints.
Inf. Process. Lett.
Pradeesha Ashok, Sathish Govindarajan
2015 Misc conf
Unique Covering Problems with Geometric Sets.
COCOON
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2014 J jnl
Selection Lemmas for various geometric objects.
CoRR
Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan
2014 J jnl
Small strong epsilon nets.
Comput. Geom.
Pradeesha Ashok, Umair Azmi, Sathish Govindarajan
2013 Misc conf
Hitting and Piercing Rectangles Induced by a Point Set.
COCOON
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra
2013 J jnl
On Strong Centerpoints.
CoRR
Pradeesha Ashok, Sathish Govindarajan
2012 — conf
On Piercing (Pseudo)Lines and Boxes.
CCCG
B. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan
2012 J jnl
Small Strong Epsilon Nets
CoRR
Pradeesha Ashok, Umair Azmi, Sathish Govindarajan
2010 — conf
Small strong epsilon nets.
CCCG
Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni