| Exact algorithms for terrain guarding P Ashok, FV Fomin, S Kolay, S Saurabh, M Zehavi ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018 | 27 | 2018 |
| Exact and FPT algorithms for max-conflict free coloring in hypergraphs P Ashok, A Dudeja, S Kolay International Symposium on Algorithms and Computation, 271-282, 2015 | 13 | 2015 |
| Unique covering problems with geometric sets P Ashok, S Kolay, N Misra, S Saurabh International Computing and Combinatorics Conference, 548-558, 2015 | 13 | 2015 |
| Small strong epsilon nets P Ashok, U Azmi, S Govindarajan Computational Geometry 47 (9), 899-909, 2014 | 12 | 2014 |
| Multivariate complexity analysis of geometric red blue set cover P Ashok, S Kolay, S Saurabh Algorithmica 79 (3), 667-697, 2017 | 9 | 2017 |
| Local search strikes again: PTAS for variants of geometric covering and packing P Ashok, A Basu Roy, S Govindarajan Journal of Combinatorial Optimization 39 (2), 618-635, 2020 | 8 | 2020 |
| FPT algorithms for conflict-free coloring of graphs and chromatic terrain guarding A Agrawal, P Ashok, MM Reddy, S Saurabh, D Yadav arXiv preprint arXiv:1905.01822, 2019 | 7 | 2019 |
| Hitting and piercing rectangles induced by a point set N Rajgopal, P Ashok, S Govindarajan, A Khopkar, N Misra Computing and Combinatorics: 19th International Conference, COCOON 2013 …, 2013 | 7 | 2013 |
| Efficient guarding of polygons and terrains P Ashok, MM Reddy Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya …, 2019 | 5 | 2019 |
| Geometric separability using orthogonal objects VP Abidha, P Ashok Information Processing Letters 176, 106245, 2022 | 4 | 2022 |
| Parameterized complexity of strip packing and minimum volume packing P Ashok, S Kolay, SM Meesum, S Saurabh Theoretical Computer Science 661, 56-64, 2017 | 4 | 2017 |
| Selection lemmas for various geometric objects P Ashok, S Govindarajan, N Rajgopal International Journal of Computational Geometry & Applications 26 (02), 67-87, 2016 | 3 | 2016 |
| On piercing (pseudo) lines and boxes SBV Bharadwaj, CH Rao, P Ashok, S Govindarajan Pacific Institute for the Mathematical Sciences, 2012 | 3 | 2012 |
| Red blue set cover problem on axis-parallel hyperplanes and other objects VP Abidha, P Ashok Information Processing Letters, 106485, 2024 | 2 | 2024 |
| Burn and win P Ashok, S Das, L Kanesh, S Saurabh, A Tomar, S Verma International Workshop on Combinatorial Algorithms, 36-48, 2023 | 1 | 2023 |
| Polynomial kernels for generalized domination problems P Ashok, R Rao, A Tomar arXiv preprint arXiv:2211.03365, 2022 | 1 | 2022 |
| Structural parameterization for minimum conflict-free colouring P Ashok, R Bhargava, N Gupta, M Khalid, D Yadav Discrete Applied Mathematics 319, 239-253, 2022 | 1 | 2022 |
| Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs P Ashok, A Dudeja, S Kolay, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 1189-1208, 2018 | 1 | 2018 |
| On strong centerpoints P Ashok, S Govindarajan Information Processing Letters 115 (3), 431-434, 2015 | 1 | 2015 |
| Colouring a dominating set without conflicts: q-Subset Square Colouring VP Abidha, P Ashok, A Tomar, D Yadav Theoretical Computer Science 976, 114160, 2023 | | 2023 |
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
