Research
My research mainly revolves around heuristic algorithms, graph theory, parameterized complexity and local search methods. My recent work has focused on using LLMs to speed up the solving of Constraint Satisfaction Problems (CSPs). Whereas, my earlier work was on SAT encodings, social choice and group theory.
Publications
2025
Generating Streamlining Constraints with Large Language Models
Florentina Voboril, Vaidyanathan P. R., Stefan Szeider
Journal of Artificial Intelligence Research, Vol. 84, 2025.
StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners
Florentina Voboril, Vaidyanathan P. R., Stefan Szeider
2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE), pages 17-22, 5 2025, IEEE Computer Soc..
Balancing Latin Rectangles with LLM-Generated Streamliners
Florentina Voboril, Vaidyanathan P. R., Stefan Szeider
31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 36:1–36:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach
Carlos Ansótegui, Vaidyanathan P. R., Stefan Szeider, Hai Xia
Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees, Wentong Cai, Siew Ann Cheong, Yi Su, David Abramson, Jack J. Dongarra, Peter M. A. Sloot, eds.), volume 15904 of Lecture Notes in Computer Science, pages 35–49, 2025, Springer Verlag.
2024
The Power of Collaboration: Learning Large Bayesian Networks at Scale
Vaidyanathan P. R., Stefan Szeider, Hai Xia
2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024.
2023
Proven Optimally-Balanced Latin Rectangles with SAT
Vaidyanathan P. R., Stefan Szeider
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
On Inference and Learning with Probabilistic Generating Circuits
Juha Harviainen, Vaidyanathan P. R., Mikko Koivisto
39th Conference on Uncertainty in Artificial Intelligence (UAI 2023), Pittsburgh, PA, USA, July 31-4 August, 2023 (R. Evans, I. Shpitser), pages 216:829–838, 2023.
2022
Learning Large Bayesian Networks with Expert Constraints
Vaidyanathan P. R., Stefan Szeider
38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022.
2021
Learning Fast-Inference Bayesian Networks
Vaidyanathan P. R., Stefan Szeider
Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021.
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Vaidyanathan P. R., Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press.
Equitable Division of a Path
Neeldhara Misra, Chinmay Sonar, Vaidyanathan P. R., Rohit Vaish
CoRR, volume abs/2101.09794, 2021.
2020
MaxSAT-Based Postprocessing for Treedepth
Vaidyanathan P. R., Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag.
Space Efficient Representations of Finite Groups
Bireswar Das, Shivdutt Sharma, Vaidyanathan P. R.
Journal of Computer and System Sciences 114, pages 137-146, 2020.
2019
Succinct Representations of Finite Groups
Bireswar Das, Shivdutt Sharma, Vaidyanathan P. R.
Proceedings of FCT 2019. Fundamentals of Computation Theory (L. Gąsieniec, J. Jansson, C. Levcopoulos). Lecture Notes in Computer Science, vol 11651. Springer, Cham.
2017
On the Complexity of Chamberlin-Courant on Almost Structured Profiles
Neeldhara Misra, Chinmay Sonar, Vaidyanathan P. R.
International Conference on Algorithmic Decision Theory (J. Rothe) Lecture Notes in Computer Science, vol 10576. Springer, Cham. 124-138, 2017