Embedded Files
Hey Everyone!!!!
I am currently a faculty member at the Department of Humanities and Sciences, Indian Institute of Petroleum and Energy, Visakhapatnam, India.
My research interests lie in Algorithmic Graph Theory, Parameterized Complexity, Approximation Algorithms, and Computational Social Choice.
I hail from Haryana, India, and my complete academic journey has been illustrated in the following section.
You can reach me at chaudhary.juhi5---gmail.com and juhi.math@iipe.ac.in
Employment
Employment
Assistant Professor (15 Sep 2025- till now)- 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
Education
Education
Ph.D. (22 July 2016- 6 Oct 2021)- Indian Institute of Technology Delhi, India
Advisor: Prof. B. S. Panda
Thesis Title: Matching and Its Variations: An Algorithmic Study
M.Sc in Industrial Mathematics & Informatics (2014-2016)- Indian Institute of Technology Roorkee
B.Sc(H) Mathematics (2011-2014)- Miranda House, University of Delhi
Journal Publications
Journal Publications
2025
J. Chaudhary, H. Gahlawat, M. Wlodarczyk, and M. Zehavi, Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs, Journal of Computer and System Sciences , vol156, 103715 (2025) PDF
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) PDF
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
2024
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
2023
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
2021
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
2020
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
Conference Publications
Conference Publications
2025
J. Chaudhary, I. Sau, and M. Zehavi, A Parameterized Perspective on Uniquely Restricted Matchings, (LAGOS 2025) arXiv Link
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
2024
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
2023
J. Chaudhary, H. Gahlawat, M. Wlodarczyk, and M. Zehavi, Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs, (IPEC 2023) PDF arXiv Link
J. Chaudhary and Meirav Zehavi, Parameterized Results on Acyclic Matchings with Implications for Related Problems, (WG 2023) PDF arXiv Link
J. Chaudhary and Meirav Zehavi, P-matchings Parameterized by Treewidth, (WG 2023) PDF arXiv Link
J. Chaudhary, S. Mishra, and B. S. Panda, Minimum Maximal Acyclic Matching in Proper Interval Graphs, (CALDAM 2023) PDF.
2022
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.
2020
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
2019
B. S. Panda and J. Chaudhary, Dominating Induced Matching in Some Subclasses of Bipartite Graphs, (CALDAM 2019) PDF
Professional Services
Professional Services
As Sub reviewer: STACS2026, WG 2025, FSTTCS 2024, MFCS 2023, CALDAM 2023, ESA 2022, LATIN 2022, WG 2022, SWAT 2022, IWOCA 2021
As Reviewer: 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, Communications in Combinatorics and Optimization
As a PC Member: AAAI 2026
Teaching Experience
Teaching Experience
I have teaching experience as a teaching assistant at IIT Delhi from Jan 2017 - June 2021 in the following courses:
Graph Theory
Analysis & Design of Algorithms
Computer Programming
Theory of Computation
Linear Algebra & Differential Equations
Calculus
Advanced Algorithms
As an instructor in Vigyan Vidushi 2024, organized by STCS, TIFR, in the course Algorithms on Graphs.
Talks(excluding talks at conferences with proceedings)
Talks(excluding talks at conferences with proceedings)
"Roman {3}-domination on Chain Graphs and Cographs", STCS Student Seminar, TIFR Mumbai, India, January 2025.
"Parameterized Analysis of Bribery in Challenge the Champ Tournaments," STCS Annual Symposium, TIFR Mumbai, India, August 2024.
"Catch them if you can," STCS Student Seminar, TIFR Mumbai, India, July 2024.
"How to make knockout tournaments more popular?" (online), Conference on Graph Theory and Additive Combinatorics (CGAC-2024), IIIT Allahabad, India, May 03-05, 2024. Webpage: https://cgac.iiita.ac.in/
"A Parameterized View on P-matchings" (online), STCS Seminar, TIFR Mumbai, India, Sep. 2023.
"A Parameterized View on P-matchings," 10th Slovenian Conference on Graph Theory, Kranjska Gora, Slovenia, June 2023. Webpage: https://sicgt.si/
"Women in STEM" (online), One day International Seminar on Women Empowerment in India: Issues, Challenges and Strategies, Mahila Mahavidyalaya, Jhojhu Kalan, March 2023.
"Weighted Induced Matching", International Conference on Discrete Mathematics and its Applications to Network Science, BITS Goa, India, July 2018.
Research Visits
Research Visits
Department of Computer Science and Automation, IISc Bangalore, 6 Nov 2024-13 Nov 2024.
College of Engineering, National Tsing Hua University, Taiwan, 18 June 2019-24 Aug 2019.
Beautiful BGU campus at Night
Sunset at the Arabian Sea
AAMAS 2025 @ Detroit
With Prof. Golumbic @ Univ. of Haifa
Page updated
Google Sites
Report abuse