NIRF IQAC

facebook

twitter

linkedIn

youtube

Virtual Tour

Pradeesha Ashok

Assistant Professor

pradeesha@iiitb.ac.in

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

  • In Conferences:

    1. V P Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav.:
      Colouring a Dominating Set without Conflicts : q- subset square colouring. CSR 2022.

    2. Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav: Minimum Conflict Free Colouring Parameterized by Treewidth... CALDAM 2020: 439-450

    3. Pradeesha Ashok, Meghana M. Reddy :
      Efficient Guarding of Polygons and Terrains.. FAW 2019: 26-37

    1. Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
      Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. COCOON 2017: 25-37

    2. Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
      Exact Algorithms for Terrain Guarding. Symposium on Computational Geometry 2017: 11:1- 11:15

    3. Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
      Parameterized Complexity of Red Blue Set Cover for Lines. LATIN 2016: 96-109

    4. Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh: Unique Covering Problems with Geometric Sets. COCOON 2015: 548-558

    5. Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay:
      Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. ISAAC 2015: 271-282

    6. Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra: Hitting and Piercing Rectangles Induced by a Point Set. COCOON 2013: 221-232

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

    8. Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni: Small strong epsilon nets. CCCG 2010: 155-158

    In Journals:

    1. Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav: Structural Parameterization of Minimum Conflict free Coloring Discrete Applied Mathematics. 319 : 239-253(2022)

    2. V P Abidha, Pradeesha Ashok :
      Geometric Separability using Orthogonal Objects. Inf. Proc. Letters . 176 : 106245 (2022)

    3. Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
      Exact Multi-Covering problems with Geometric Sets. Theory of Computing Systems, 66(1): 89-113 (2022)

    4. 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)

    5. Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh:

      Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hyper- graphs. SIAM J. Discrete Math. 32(2): 1189-1208 (2018)

    6. 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)

    7. Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
      Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79(3): 667- 697 (2017)

    8. 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)

    9. Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal:
      Selection Lemmas for Various Geometric Objects. Int. J. Comput. Geometry Appl. 26(2): 67-88 (2016)

    10. Pradeesha Ashok, Sathish Govindarajan:
      On strong centerpoints. Inf. Process. Lett. 115(3): 431-434 (2015)

    11. Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
      Small strong epsilon nets. Comput. Geom. 47(9): 899-909 (2014)

  • 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 :

• PhD students

  1. Vithya M (2022- )

  2. Abidha V P (Now a Post doctoral fellow at HongKong University of Science and Tech- nology)

    Thesis title : An Algorithmic Study of Problems on Geometric Separability, Geometric Covering , and Graph Coloring ,

• MS by Research students

  1. Dolly Yadav(2018- 2021) (Now at Deloitte, Mumbai)

    Thesis title : Parameterized Complexity of Some Colouring Problems in Graphs

  2. Avi Tomar (2020 - )

• MTech thesis students

  1. Meghana Reddy (Now a Ph D student at ETH Zurich)
    graduated in July 2018     Thesis title : On the Chromatic Art Gallery Problem

  2. P S Srinivasan (Now at Rubrik Inc, Bangalore)
    graduated in July 2018     Thesis title : A theoretical study of Bichromatic covering problems and an experimental study of the Steiner Tree problem