Juhi Chaudhary

Orcid: 0000-0001-5560-9129

According to our database1, Juhi Chaudhary authored at least 19 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
\(\mathcal{P}\)-Matchings Parameterized by Treewidth.
SIAM J. Discret. Math., 2025

Parameterized results on acyclic matchings with implications for related problems.
J. Comput. Syst. Sci., 2025

Parameterized Analysis of Bribery in Challenge the Champ Tournaments.
J. Artif. Intell. Res., 2025

Maximizing Value in Challenge the Champ Tournaments.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Adaptive Manipulation for Coalitions in Knockout Tournaments.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
On the complexity of minimum maximal acyclic matchings.
J. Comb. Optim., August, 2024

An effectual multiscale feature extraction in integer wavelet transform domain for illumination invariable face recognition.
Int. J. Appl. Pattern Recognit., 2024

Roman {3}-domination in graphs: Complexity and algorithms.
Discret. Appl. Math., 2024

How to Make Knockout Tournaments More Popular?
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Unique Response Roman Domination: Complexity and Algorithms.
Algorithmica, December, 2023

Acyclic matching in some subclasses of graphs.
Theor. Comput. Sci., 2023

P-matchings Parameterized by Treewidth.
CoRR, 2023

<i>P</i>-Matchings Parameterized by Treewidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Minimum Maximal Acyclic Matching in Proper Interval Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
On Two Variants of Induced Matchings.
Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021
Dominating induced matching in some subclasses of bipartite graphs.
Theor. Comput. Sci., 2021

On the complexity of minimum maximal uniquely restricted matching.
Theor. Comput. Sci., 2021

2020
Maximum weight induced matching in some subclasses of bipartite graphs.
J. Comb. Optim., 2020


  Loading...