Structural parameterizations with modulator oblivion A Jacob, F Panolan, V Raman, V Sahlot
Algorithmica 84 (8), 2335-2357, 2022
10 2022 Fréchet distance between a line and avatar point set A Banik, F Panolan, V Raman, V Sahlot
Algorithmica 80, 2616-2636, 2018
8 2018 Parameterized complexity of geometric covering problems having conflicts A Banik, F Panolan, V Raman, V Sahlot, S Saurabh
Algorithmica 82 (1), 1-19, 2020
7 2020 Deconstructing parameterized hardness of fair vertex deletion problems A Jacob, V Raman, V Sahlot
International Computing and Combinatorics Conference, 325-337, 2019
5 2019 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 Parameterizing role coloring on forests S Pandey, V Raman, V Sahlot
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
2 2021 Hitting and covering partially A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh
International Computing and Combinatorics Conference, 751-763, 2018
2 2018 3-Coloring or -Free Diameter Two Graphs T Klimošová, V Sahlot
Algorithms and Data Structures Symposium, 547-560, 2023
1 2023 Approximation algorithms for geometric conflict free covering problems A Banik, V Sahlot, S Saurabh
Computational Geometry 89, 101591, 2020
2020 Conflicts in Geometry V Sahlot
Indian Institute of Technology Jodhpur, 2017
2017