default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuhi Chaudhary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Juhi Chaudhary, Meirav Zehavi:
Parameterized results on acyclic matchings with implications for related problems. J. Comput. Syst. Sci. 148: 103599 (2025)- 2024
- [j7]Juhi Chaudhary
, Dinabandhu Pradhan:
Roman {3}-domination in graphs: Complexity and algorithms. Discret. Appl. Math. 354: 301-325 (2024) - [j6]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the complexity of minimum maximal acyclic matchings. J. Comb. Optim. 48(1): 10 (2024) - [c11]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? AAAI 2024: 9582-9589 - [c10]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. IJCAI 2024: 2704-2712 - [i5]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR abs/2403.17587 (2024) - 2023
- [j5]Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan:
Unique Response Roman Domination: Complexity and Algorithms. Algorithmica 85(12): 3889-3927 (2023) - [j4]B. S. Panda, Juhi Chaudhary:
Acyclic matching in some subclasses of graphs. Theor. Comput. Sci. 943: 36-49 (2023) - [c9]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
Minimum Maximal Acyclic Matching in Proper Interval Graphs. CALDAM 2023: 377-388 - [c8]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - [c7]Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. WG 2023: 201-216 - [c6]Juhi Chaudhary, Meirav Zehavi:
P-Matchings Parameterized by Treewidth. WG 2023: 217-231 - [i4]Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. CoRR abs/2307.05446 (2023) - [i3]Juhi Chaudhary, Meirav Zehavi:
P-matchings Parameterized by Treewidth. CoRR abs/2307.09333 (2023) - [i2]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? CoRR abs/2309.09967 (2023) - [i1]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR abs/2309.16892 (2023) - 2022
- [c5]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the Complexity of Minimum Maximal Acyclic Matchings. COCOON 2022: 106-117 - [c4]Juhi Chaudhary, B. S. Panda:
On Two Variants of Induced Matchings. ICS 2022: 37-48 - 2021
- [j3]Juhi Chaudhary, Bhawani Sankar Panda:
On the complexity of minimum maximal uniquely restricted matching. Theor. Comput. Sci. 882: 15-28 (2021) - [j2]B. S. Panda, Juhi Chaudhary:
Dominating induced matching in some subclasses of bipartite graphs. Theor. Comput. Sci. 885: 104-115 (2021) - 2020
- [j1]B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap:
Maximum weight induced matching in some subclasses of bipartite graphs. J. Comb. Optim. 40(3): 713-732 (2020) - [c3]Juhi Chaudhary, B. S. Panda:
On the Complexity of Minimum Maximal Uniquely Restricted Matching. COCOA 2020: 364-376 - [c2]B. S. Panda, Juhi Chaudhary:
Acyclic Matching in Some Subclasses of Graphs. IWOCA 2020: 409-421
2010 – 2019
- 2019
- [c1]B. S. Panda, Juhi Chaudhary:
Dominating Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2019: 138-149
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-11-25 22:43 CET 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:
