Assistant Professor
Education : Ph.D. (IISC Bangalore)
Dr. Pradeesha Ashok did her Ph.D from Indian Institute of Science, Bangalore. Her research interests are broadly in Theoretical Computer Science and specifically in computational and combinatorial problems in Geometry. She is also interested in research problems in Algorithms, Graph Theory and Combinatorics. Previous to joining IIIT Bangalore, she was a Postdoctoral Fellow at Institute of Mathematical Sciences, Chennai.
Algorithms, Graph Theory, Combinatorics, Theoretical Computer Science, Parameterized Complexity
-
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh : Exact Multi-Covering Problems with Geometric Sets, Theory of Computing Systems, 2021
-
Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan: Local search strikes again: PTAS for variants of geometric covering and packing. J. Comb. Optim., 2020
-
Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav: Minimum Conflict Free Colouring Parameterized by Treewidth. CALDAM 2020
- Pradeesha Ashok, Meghana M. Reddy : Efficient Guarding of Polygons and Terrains. FAW 2019
- Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh: Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discrete Math. (2018) (A preliminary version of this paper appeared in ISAAC 2015)
- Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi: Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms (2018) (A preliminary version of this paper appeared in SoCG 2016)
- Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh: Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica (2017) (A preliminary version of this paper appeared in LATIN 2015)
- Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh: Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. (2017)
- Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan: Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. COCOON 2017
- Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal: Selection Lemmas for Various Geometric Objects. Int. J. Comput. Geometry Appl. (2016) (A preliminary version of this paper appeared in COCOON 2013
- Pradeesha Ashok, Sathish Govindarajan: On strong centerpoints. Inf. Process. Lett. (2015)
- Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh: Unique Covering Problems with Geometric Sets. COCOON 2015
- Pradeesha Ashok, Umair Azmi, Sathish Govindarajan: Small strong epsilon nets. Comput. Geom. 2014 (A preliminary version of this paper appeared in CCCG 2010)
- Exact and Parameterized Algorithms (Elective) (Jan - May, 2021 - )
- Mathematics 1 - (co-taught with Prof. Amit Chattopadhyay) (Aug - Dec, 2019, 2020)
- Graph Theory : Elective (co-taught with Prof. Meenakshi D'Souza) (Jan- May, 2019 - )
- Design and Analysis of Algorithms : 4th Semester Integrated MTech (co-taught with Prof. Meenakshi D'Souza) (Jan - May, 2017 - )
- Mathematics 3 - Abstract Algebra : 3rd Semester Integrated MTech (co-taught with Prof. Amit Chattopadhyay)
- Computational Geometry : Elective (Aug - Dec, 2017 - ongoing)
- Mathematics 2 - Linear Algebra : 2nd Semester Integrated MTech
- Programming I : C Programming : 1st Semester Integrated MTech
Students :
I. Ph.D
- Abidha V P (2017 - )
II. MS by Research
- Avi Tomar ( 2020 - )
- Dolly Yadav (graduated in 2021, Thesis title : PARAMETERIZED COMPLEXITY OF SOME COLOURING PROBLEMS IN GRAPHS)
III. IMTech Final Thesis
- Meghana M Reddy (2018) Thesis : On Chromatic Art Gallery Problems (currently PhD student at ETH Zurich)
- P S Srinivasan (2018) Thesis : A Theoretical study of Bi-chromatic covering problems and an experimental study of the Steiner Tree problem