Fixed-Parameter Tractable Algorithms for Tracking Set Problems. - Aritra Banik; Pratibha Choudhary (CALDAM, 2018)

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

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. - Pratibha Choudhary; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2020)

A Polynomial Sized Kernel for Tracking Paths Problem. - Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2020)

Improved Kernels for Tracking Path Problems. - Pratibha Choudhary; Venkatesh Raman 001 (CoRR, 2020)

Fixed-parameter tractable algorithms for Tracking Shortest Paths. - Aritra Banik; Pratibha Choudhary; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

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

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Simon Schierreich; Ondrej Suchý 001; Tomás Valla (ESA, 2022)

Polynomial Time Algorithms for Tracking Path Problems. - Pratibha Choudhary (Algorithmica, 2022)

Structural parameterizations of Tracking Paths problem. - Pratibha Choudhary; Venkatesh Raman 001 (Theor. Comput. Sci., 2022)

Polynomial kernels for tracking shortest paths. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Inf. Process. Lett., 2023)

Constant factor approximation for tracking paths and fault tolerant feedback vertex set. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Discret. Optim., 2023)

Improved kernels for tracking paths. - Pratibha Choudhary; Michael T. Goodrich; Siddharth Gupta 002; Hadi Khodabandeh; Pedro Matias 001; Venkatesh Raman 001 (Inf. Process. Lett., 2023)

Parameterized Complexity of Minimum Membership Dominating Set. - Akanksha Agrawal 001; Pratibha Choudhary; N. S. Narayanaswamy; K. K. Nisha; Vijayaragunathan Ramamoorthi (Algorithmica, 2023)

On kernels for d-path vertex cover. - Radovan Cervený; Pratibha Choudhary; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2024)