Research
Research
All authors are ordered in lexicographic order of their last names, as per the convention in theoretical computer science. The publications are listed in reverse chronological order.
Preprints
[P1]: Approximate Envy-Freeness and Pareto Optimality Beyond Additivity
Harish Chandramouleeswaran, Prajakta Nimbhorkar
Conference Publications
[C2]: Testing Forbidden Order-pattern Properties on Hypergrids
Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma
37th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2026 (Vancouver, BC, Canada).
Invited for a short talk and poster presentation at the Highlights of Algorithms (HALG) 2026.
[Conference version] [arXiv (Full version)] [SODA presentation slides]
[C1]: Fair Division in a Variable Setting
Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi
24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2025 (Detroit, MI, USA).
Invited to the JAAMAS special issue.
[Conference version] [arXiv (Full version)] [AAMAS presentation slides]
Masters Thesis
Sublinear-time Algorithms for Monotonicity testing
Advisor: Dr. Nithin Varma, Chennai Mathematical Institute
Abstract: In this thesis, we study the fundamentals of monotonicity testing, and provide a comprehensive survey of existing work on testing monotonicity of functions defined on a particular domain type known as a hypergrid.
Subsequently, we describe a novel, albeit suboptimal, monotonicity tester. This tester, which is designed for real-valued functions on the hypergrid, draws inspiration from the widely-used binary search algorithm.