0000000000

juhi.math@iipe.ac.in

• Ph.D. (July 2016- Oct 2021)- Indian Institute of Technology Delhi, India

• M.Sc. in Industrial Mathematics & Informatics (2014-2016)- Indian Institute of Technology Roorkee, India

• B.Sc(H) Mathematics (2011-2014)- Miranda House, University of Delhi, India

• Assistant Professor (15 Sep 2025- Present)- Indian Institute of Petroleum and Energy, Visakhapatnam, India

• Visiting Fellow (02 Jan 2024- 28 July 2025)- STCS, TIFR Mumbai, India

• Post-doctoral Fellow (01 Dec 2021- 30 Nov 2023)- Ben-Gurion University of the Negev, Israel

• Early-doctoral Fellow (10 Oct 2021-30 Nov 2021)- Indian Institute of Technology Delhi, India

• J. Chaudhary and Meirav Zehavi P-matchings Parameterized by Treewidth, SIAM Journal on Discrete Mathematics, vol 39,1280-1311 (2025) PDF

• J. Chaudhary, H. Molter, and M. Zehavi, Parameterized Analysis of Bribery in Challenge the Champ Tournaments, Journal of Artificial Intelligence Research, vol 83, 7:1-18 (2025)

• J. Chaudhary, S. Mishra, and B. S. Panda, Minimum Maximal Acyclic Matching in Proper Interval Graphs, Discrete Applied Mathematics, vol 360, 414-427 (2025) PDF

• J. Chaudhary and Meirav Zehavi, Parameterized Results on Acyclic Matchings with Implications for Related Problems, Journal of Computer and System Sciences, vol 148:103599 (2024) PDF

• J. Chaudhary, S. Mishra, and B. S. Panda, On the Complexity of Minimum Maximal Acyclic Matchings, Journal of Combinatorial Optimization, vol 48:10 (2024) PDF

• J. Chaudhary and D. Pradhan, Roman {3}-domination in graphs: Complexity and algorithms, Discrete Applied Mathematics, vol 354,301-325 (2024) PDF 

• S. Banerjee, J. Chaudhary, and D. Pradhan, Unique response Roman domination: Complexity and algorithms, Algorithmica, vol 85, 3889-3927 (2023) PDF 

• B. S. Panda and J. Chaudhary, Acyclic Matching in Some Subclasses of Graphs, Theoretical Computer Science, vol 943, 36-49 (2023) PDF

• B. S. Panda and J. Chaudhary, Dominating Induced Matching in Some Subclasses of Bipartite Graphs, Theoretical Computer Science, vol 885, 104-115 (2021) PDF 

• J. Chaudhary and B. S. Panda, On the Complexity of Minimum Maximal Uniquely Restricted Matching,  Theoretical Computer Science, vol 882, 15-28   (2021) PDF

• B. S. Panda, Arti Pandey, J. Chaudhary, Piyus Dane, and Manav Kashyap, Maximum weight induced matching in some subclasses of bipartite graphs, Journal of Combinatorial Optimization, vol 40, 713-732 (2020) PDF 

• J. Chaudhary, I. Sau, and M. Zehavi, A Parameterized Perspective on Uniquely Restricted Matchings, (LAGOS 2025)

• U. Bhaskar, J. Chaudhary, and P. Dey, Maximizing Value in Challenge the Champ Tournaments, (AAMAS 2025) PDF arXiv Link

• J. Chaudhary, H. Molter, and M. Zehavi, Adaptive Manipulation for Coalitions in Knockout Tournaments,  (AAAI 2025) PDF arXiv Link

• J. Chaudhary, H. Molter, and M. Zehavi, Parameterized Analysis of Bribery in Challenge the Champ Tournaments, (IJCAI 2024) PDF arXiv Link

• J. Chaudhary, H. Molter, and M. Zehavi, How to make knockout tournaments more popular?, (AAAI 2024) PDF arXiv Link

• J. Chaudhary,  H. Gahlawat, M. Wlodarczyk, and M. Zehavi, Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs,  (IPEC 2023) PDF

• J. Chaudhary and Meirav Zehavi, Parameterized Results on Acyclic Matchings with Implications for Related Problems, (WG 2023) PDF.

• J. Chaudhary and Meirav Zehavi, P-matchings Parameterized by Treewidth, (WG 2023) PDF.

• J. Chaudhary, S. Mishra, and B. S. Panda, Minimum Maximal Acyclic Matching in Proper Interval Graphs, (CALDAM 2023) PDF.

• J. Chaudhary and B. S. Panda, On Two Variants of Induced Matchings, in Proc. of the International Computer Symposium (ICS 2022)  PDF.

• J. Chaudhary, S. Mishra, and B. S. Panda, On the Complexity of Minimum Maximal Acyclic Matchings, (COCOON 2022) PDF.

• J. Chaudhary and B. S. Panda, On the Complexity of Minimum Maximal Uniquely Restricted Matching, (COCOA 2020) PDF

• B. S. Panda and J. Chaudhary, Acyclic Matching in Some Subclasses of Graphs, (IWOCA 2020) PDF

• B. S. Panda and J. Chaudhary, Dominating Induced Matching in Some Subclasses of Bipartite Graphs, (CALDAM 2019) PDF

ANRF-ITS Travel Grant award-2025

Journals:    Discrete Applied Mathematics (3), Journal of Combinatorial Optimization, Information and Computation(2), Bulletin of the Malaysian Mathematical Sciences Society , Theoretical Computer Science (2), Journal of Computer and System Sciences

Conferences (Subreviewer):    WG 2025, FSTTCS 2024, MFCS 2023, CALDAM 2023, ESA 2022, LATIN 2022, WG 2022, SWAT 2022, IWOCA 2021