| Fréchet distance between a line and avatar point set A Banik, F Panolan, V Raman, V Sahlot Algorithmica 80, 2616-2636, 2018 | 9 | 2018 |
| Structural parameterizations with modulator oblivion A Jacob, F Panolan, V Raman, V Sahlot Algorithmica 84 (8), 2335-2357, 2022 | 6 | 2022 |
| Parameterized complexity of geometric covering problems having conflicts A Banik, F Panolan, V Raman, V Sahlot, S Saurabh Algorithmica 82 (1), 1-19, 2020 | 6 | 2020 |
| Role coloring bipartite graphs S Pandey, V Sahlot Discrete Applied Mathematics 322, 276-285, 2022 | 3 | 2022 |
| Vertex deletion on split graphs: beyond 4-hitting set P Choudhary, P Jain, R Krithika, V Sahlot Theoretical Computer Science 845, 21-37, 2020 | 3 | 2020 |
| Deconstructing parameterized hardness of fair vertex deletion problems A Jacob, V Raman, V Sahlot Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019 | 3 | 2019 |
| Parameterizing Role Coloring on Forests S Pandey, V Raman, V Sahlot SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021 | 1 | 2021 |
| Hitting and covering partially A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018 | 1 | 2018 |
| Approximation algorithms for geometric conflict free covering problems A Banik, V Sahlot, S Saurabh Computational Geometry 89, 101591, 2020 | | 2020 |
