Small strong epsilon nets. - Pradeesha Ashok; Sathish Govindarajan; Janardhan Kulkarni (CCCG, 2010)

On Piercing (Pseudo)Lines and Boxes. - B. V. Subramanya Bharadwaj; Chintan Rao; Pradeesha Ashok; Sathish Govindarajan (CCCG, 2012)

Hitting and Piercing Rectangles Induced by a Point Set. - Ninad Rajgopal; Pradeesha Ashok; Sathish Govindarajan; Abhijit Khopkar; Neeldhara Misra (COCOON, 2013)

Small strong epsilon nets. - Pradeesha Ashok; Umair Azmi; Sathish Govindarajan (Comput. Geom., 2014)

Unique Covering Problems with Geometric Sets. - Pradeesha Ashok; Sudeshna Kolay; Neeldhara Misra; Saket Saurabh 001 (COCOON, 2015)

Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. - Pradeesha Ashok; Aditi Dudeja; Sudeshna Kolay (ISAAC, 2015)

Multivariate Complexity Analysis of Geometric { sc Red Blue Set Cover}. - Pradeesha Ashok; Sudeshna Kolay; Saket Saurabh 001 (CoRR, 2015)

On strong centerpoints. - Pradeesha Ashok; Sathish Govindarajan (Inf. Process. Lett., 2015)

Parameterized Complexity of Red Blue Set Cover for Lines. - Pradeesha Ashok; Sudeshna Kolay; Saket Saurabh 001 (LATIN, 2016)

Selection Lemmas for Various Geometric Objects. - Pradeesha Ashok; Sathish Govindarajan; Ninad Rajgopal (Int. J. Comput. Geom. Appl., 2016)

Multivariate Complexity Analysis of Geometric Red Blue Set Cover. - Pradeesha Ashok; Sudeshna Kolay; Saket Saurabh 001 (Algorithmica, 2017)

Parameterized complexity of Strip Packing and Minimum Volume Packing. - Pradeesha Ashok; Sudeshna Kolay; Syed Mohammad Meesum; Saket Saurabh 001 (Theor. Comput. Sci., 2017)

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. - Pradeesha Ashok; Aditi Dudeja; Sudeshna Kolay; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Exact Algorithms for Terrain Guarding. - Pradeesha Ashok; Fedor V. Fomin; Sudeshna Kolay; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2018)

Efficient Guarding of Polygons and Terrains. - Pradeesha Ashok; Meghana M. Reddy (FAW, 2019)

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. - Akanksha Agrawal 001; Pradeesha Ashok; Meghana M. Reddy; Saket Saurabh 001; Dolly Yadav (CoRR, 2019)

Minimum Conflict Free Colouring Parameterized by Treewidth. - Pradeesha Ashok; Rathin Bhargava; Naman Gupta; Mohammad Khalid; Dolly Yadav (CALDAM, 2020)

Local search strikes again: PTAS for variants of geometric covering and packing. - Pradeesha Ashok; Aniket Basu Roy; Sathish Govindarajan (J. Comb. Optim., 2020)

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. - Abidha V. P; Pradeesha Ashok; Avi Tomar; Dolly Yadav (CSR, 2022)

Polynomial Kernels for Generalized Domination Problems. - Pradeesha Ashok; Rajath Rao; Avi Tomar (CoRR, 2022)

Structural parameterization for minimum conflict-free colouring. - Pradeesha Ashok; Rathin Bhargava; Naman Gupta; Mohammad Khalid; Dolly Yadav (Discret. Appl. Math., 2022)

Geometric separability using orthogonal objects. - Abidha V. P; Pradeesha Ashok (Inf. Process. Lett., 2022)

Exact Multi-Covering Problems with Geometric Sets. - Pradeesha Ashok; Sudeshna Kolay; Neeldhara Misra; Saket Saurabh 001 (Theory Comput. Syst., 2022)

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. - V. P. Abidha; Pradeesha Ashok; Avi Tomar; Dolly Yadav (CoRR, 2023)

Colouring a dominating set without conflicts: q-Subset Square Colouring. - V. P. Abidha; Pradeesha Ashok; Avi Tomar; Dolly Yadav (Theor. Comput. Sci., 2023)

(Independent) Roman Domination Parameterized by Distance to Cluster. - Pradeesha Ashok; Gautam K. Das; Arti Pandey; Kaustav Paul; Subhabrata Paul (COCOA (2), 2024)

Red Blue Set Cover problem on axis-parallel hyperplanes and other objects. - V. P. Abidha; Pradeesha Ashok (Inf. Process. Lett., 2024)

Perfect UE Grouping for Frequency Sharing in Full Duplex Cellular Networks. - Parthiban Annamalai; Pradeesha Ashok; Rajath Rao; Divyanshi Rajput; Jyotsna Bapat; Debabrata Das (IEEE Wirel. Commun. Lett., 2024)

Parameterized Complexity of Coupon Coloring of Graphs. - Pradeesha Ashok; Pradyun Devarakonda; Shiven Phogat; Swaroop A. Ram Rayala; J. A. Sherin (CALDAM, 2025)

Burning Path-Like and Clique-Like Graphs. - Radhika Aggarwal; Pradeesha Ashok; Dhairya Gupta (CIAC (2), 2025)

Burn and win. - Pradeesha Ashok; Sayani Das; Lawqueen Kanesh; Saket Saurabh 001; Avi Tomar; Shaily Verma (Theor. Comput. Sci., 2025)