Hitting and Covering Partially. - Akanksha Agrawal 001; Pratibha Choudhary; Pallavi Jain 001; Lawqueen Kanesh; Vibha Sahlot; Saket Saurabh 001 (COCOON, 2018)

Fréchet Distance Between a Line and Avatar Point Set. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot (Algorithmica, 2018)

Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. - Ashwin Jacob; Venkatesh Raman 001; Vibha Sahlot (COCOON, 2019)

Parameterized Complexity of Geometric Covering Problems Having Conflicts. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot; Saket Saurabh 001 (Algorithmica, 2020)

Approximation algorithms for geometric conflict free covering problems. - Aritra Banik; Vibha Sahlot; Saket Saurabh 001 (Comput. Geom., 2020)

Vertex deletion on split graphs: Beyond 4-hitting set. - Pratibha Choudhary; Pallavi Jain 001; R. Krithika 001; Vibha Sahlot (Theor. Comput. Sci., 2020)

Parameterizing Role Coloring on Forests. - Sukanya Pandey; Venkatesh Raman 001; Vibha Sahlot (SOFSEM, 2021)

Structural Parameterizations with Modulator Oblivion. - Ashwin Jacob; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot (Algorithmica, 2022)

Role coloring bipartite graphs. - Sukanya Pandey; Vibha Sahlot (Discret. Appl. Math., 2022)

3-Coloring C4 or C3-Free Diameter Two Graphs. - Tereza Klimosová; Vibha Sahlot (WADS, 2023)