default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPratibha Choudhary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Radovan Cervený
, Pratibha Choudhary, Ondrej Suchý:
On kernels for d-path vertex cover. J. Comput. Syst. Sci. 144: 103531 (2024)- 2023
- [j9]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85(11): 3430-3452 (2023) - [j8]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47: 100756 (2023) - [j7]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial kernels for tracking shortest paths. Inf. Process. Lett. 179: 106315 (2023) - [j6]Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman:
Improved kernels for tracking paths. Inf. Process. Lett. 181: 106360 (2023) - 2022
- [j5]Pratibha Choudhary:
Polynomial Time Algorithms for Tracking Path Problems. Algorithmica 84(6): 1548-1570 (2022) - [j4]Pratibha Choudhary, Venkatesh Raman:
Structural parameterizations of Tracking Paths problem. Theor. Comput. Sci. 934: 91-102 (2022) - [c11]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA 2022: 22:1-22:16 - [c10]Radovan Cervený, Pratibha Choudhary, Ondrej Suchý:
On Kernels for d-Path Vertex Cover. MFCS 2022: 29:1-29:14 - [c9]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. WALCOM 2022: 288-299 - [i9]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial Kernels for Tracking Shortest Paths. CoRR abs/2202.11927 (2022) - [i8]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR abs/2207.01109 (2022) - 2021
- [c8]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA 2021: 23-38 - [i7]Radovan Cervený, Pratibha Choudhary, Ondrej Suchý:
On Kernels for d-Path Vertex Cover. CoRR abs/2107.12245 (2021) - [i6]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR abs/2108.01430 (2021) - [i5]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. CoRR abs/2110.06656 (2021) - 2020
- [j3]Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020) - [j2]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845: 21-37 (2020) - [j1]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846: 1-13 (2020) - [c7]Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c6]Pratibha Choudhary, Venkatesh Raman:
Structural Parameterizations of Tracking Paths Problem. ICTCS 2020: 15-27 - [c5]Pratibha Choudhary:
Polynomial Time Algorithms for Tracking Path Problems. IWOCA 2020: 166-179 - [i4]Pratibha Choudhary, Venkatesh Raman:
Improved Kernels for Tracking Path Problems. CoRR abs/2001.03161 (2020) - [i3]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR abs/2001.08977 (2020) - [i2]Pratibha Choudhary:
Polynomial Time Algorithms for Tracking Path Problems. CoRR abs/2002.07799 (2020) - [i1]Pratibha Choudhary, Venkatesh Raman:
Structural Parameterizations of Tracking Paths Problem. CoRR abs/2008.09806 (2020)
2010 – 2019
- 2019
- [c4]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC 2019: 161-173 - 2018
- [c3]Aritra Banik, Pratibha Choudhary:
Fixed-Parameter Tractable Algorithms for Tracking Set Problems. CALDAM 2018: 93-104 - [c2]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - [c1]Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 2018: 94-107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
