Pratibha Choudhary
I am a postdoctoral fellow at the Department of Theoretical Computer Science, Faculty of Information Technology at Czech Technical University in Prague.
Research Interests: Graph Theory and Parameterized Algorithms.
Contact: pratibha {dot} choudhary {at} fit {dot} cvut {dot} cz, choudhary {dot} pratibha {at} outlook {dot} com
I'm a co-organizer of the PC seminar. It is an online seminar, where we have interesting recent work in parameterized complexity being presented every Tuesday at 8:30pm IST. If you wish to be added to the mailing list, you can register by filling this form. (The talks assume basic understanding of parameterized complexity.)
If you are interested in giving a talk, please send me an email.
Papers:
On Kernels for d-Path Vertex Cover with Radovan Červený, Ondřej Suchý;
(Submitted to a conference).Parameterized Complexity of Minimum Membership Dominating Set with Akanksha Agrawal, Narayanaswamy N S, Nisha K K, Vijayaraghunathan Ramamoorthi;
International Conference and Workshop on Algorithms and Computation (WALCOM) 2022.Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set with Václav Blažej, Dušan Knop, Jan Matyáš Křišt’an, Ondřej Suchý, Tomáš Valla;
International Workshop on Approximation and Online Algorithms (WAOA) 2021.Parameterized Complexity of Feedback Vertex Sets on Hypergraphs with Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh;
Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020.Structural Parameterizations of Tracking Paths Problem with Venkatesh Raman;
Italian Conference on Theoretical Computer Science (ICTCS) 2020.Polynomial Time Algorithms for Tracking Path Problems (Single Author Paper)
International Workshop on Combinatorial Algorithms (IWOCA) 2020. (Best Student Paper Award)
Full version invited and published in Algorithmica Journal.Improved Kernels for Tracking Path Problems with Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Petro Matias, Venkatesh Raman;
(Submitted to a journal)Fixed-parameter tractable algorithms for Tracking Shortest Paths with Aritra Banik, Venkatesh Raman, Saket Saurabh;
Theoretical Computer Science Journal.Split to Block Vertex Deletion: Beyond 4-Hitting Set with Pallavi Jain, R. Krithika, Vibha Sahlot;
International Conference on Algorithms and Complexity (CIAC) 2019.
Full version published in Theoretical Computer Science Journal.Hitting and Covering Partially with Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh;
International Computing and Combinatorics Conference (COCOON) 2018.
(Submitted to Journal).A Polynomial sized kernel for Tracking Paths problem with Aritra Banik, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh;
Latin American Symposium on Theoretical Informatics (LATIN) 2018.
Full version published in Algorithmica Journal, Volume 82.Fixed-parameter tractable algorithms for Tracking Set problems with Aritra Banik;
International Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2018.
*Full version invited & published at Special Issue of Theoretical Computer Science Journal.
Workshops and Seminars organized:
Parameterized Complexity Seminar
Online (zoom), June 2020 - Present.
Parameterized Complexity 301 Workshop
Online (zoom), December 2020.
Recent Trends in Algorithms Workshop
National Institute of Science Education and Research (NISER), Bhubaneswar, February 2019.
Talks:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Goa, December 2020.
Structural Parameterizations of Tracking Paths Problem
Italian Conference on Theoretical Computer Science (ICTCS), Ischia, September 2020.
Polynomial Time Algorithms for Tracking Paths
International Workshop on Combinatorial Algorithms (IWOCA), Bordeaux , June 2020.
Improved Kernels for Tracking Paths
Parameterized Complexity Seminar, October 2020.
TU Munich, March 2020.
Indian Institute of Technology Madras, Chennai, March 2020.
Recent Trends in Algorithms Workshop, Indian Institute of Technology Gandhinagar, Gandhinagar, February 2020.
A Polynomial Kernel for Tracking Paths Problem
University of Bergen, Bergen, October 2018.
Latin American Symposium of Informatics (LATIN), Buenos Aires, April 2018.
Institute of Mathematical Sciences, Chennai, March 2018.
Fixed-Parameter Tractable Algorithms for Tracking Set Problems
Conference of Algorithms and Discrete Applied Mathematics (CALDAM), Guwahati, February 2018.