Employment

• Visiting Fellow (02 Jan 2024- Present)- 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

• 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

Conference Publications

        2024

• J. Chaudhary, H. Molter, and M. Zehavi, Parameterized Analysis of Bribery in Challenge the Champ Tournaments, accepted to Proc. of the 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024) PDF arXiv Link

• J. Chaudhary, H. Molter, and M. Zehavi, How to make knockout tournaments more popular?, in Proc. of the 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024), vol 38, 9:9582-9589 (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, in Proc. of the International Symposium on Parameterized and Exact Computation (IPEC), LIPIcs, vol 285, 10:1-22 (2023)  PDF

• J. Chaudhary and Meirav Zehavi, Parameterized Results on Acyclic Matchings with Implications for Related Problems, in Proc. of the 49th International Workshop on Graph-theoretic Concepts in Computer Science (WG), LNCS, vol 14093, Springer, 201-216 (2023) PDF.

• J. Chaudhary and Meirav Zehavi, P-matchings Parameterized by Treewidth, in Proc. of the 49th International Workshop on Graph-theoretic Concepts in Computer Science (WG), LNCS, vol 14093, Springer, 217-231 (2023) PDF.

• J. Chaudhary, S. Mishra, and B. S. Panda, Minimum Maximal Acyclic Matching in Proper Interval Graphs,  in Proc. of the 9th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS, vol 13947, Springer, 377-388 (2023) PDF.

2022

1. • J. Chaudhary and B. S. Panda, On Two Variants of Induced Matchings, in Proc. of the International Computer Symposium (ICS),   Communications in Computer and Information Science,  vol 1723, Springer, 37-48 (2022) PDF.

   • J. Chaudhary, S. Mishra, and B. S. Panda, On the Complexity of Minimum Maximal Acyclic Matchings, in Proc. of the 28th International Computing and Combinatorics Conference (COCOON), LNCS, vol 13595, Springer, 106-117 (2022) PDF.

(Invited to appear in the Journal of Combinatorial Optimization special issue.)

2020

1. • J. Chaudhary and B. S. Panda, On the Complexity of Minimum Maximal Uniquely Restricted Matching, in Proc. of the 14th Annual International Conference on Combinatorial Optimization and Applications (COCOA), LNCS, vol 12577, Springer, 364-376 (2020) PDF

(Invited to appear in Theoretical Computer Science special issue.)

1. • B. S. Panda and J. Chaudhary, Acyclic Matching in Some Subclasses of Graphs, in Proc. of the 31st International Workshop on Combinatorial Algorithms (IWOCA), LNCS, vol 12126, Springer, 409-421 (2020) PDF

2019

• B. S. Panda and J. Chaudhary, Dominating Induced Matching in Some Subclasses of Bipartite Graphs, in Proc. of the 5th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS, vol 11394, Springer, 138-149 (2019) PDF

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.

Last updated: 10.09.2024