Research | About Me

“If I have seen further, it is by standing on the shoulders of giants.“
– Isaac Newton

My research philosophy is to work on problems that not only advance our understanding of the fundamental questions in optimization and machine learning, but often also has a positive impact on the society through ensuring algorithmic fairness.
To see some public repositories for code related to our research, please visit Code.
* Note that starred journal papers also have a preliminary conference version with the number mentioned in paranthesis.

	Papers under submission:
Index.	Title	Venue	Area	Notes
50	Strategies for running the QAOA at hundreds of qubits – with Augustino, Cain, Farhi, Gutmann, Ranard, Tang and Van Kirk		quantum computing	arxiv
49	Equitably allocating wildfire resilience investments for power grids: The curse of aggregation and vulnerability indices – with Pollack, Piansky, Kody and Molzahn	under submission	equity, power systems, wildfire, sustainability	arxiv
	Papers under revision:
	Title	Venue	Area	Notes
48	Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations – with Moondra, Mohler, Lotshaw	Revise and Resubmit, Quantum	quantum computing	arxiv
47	Improving Clinical Decision Support through Interpretable Machine Learning and Error Correction in Electronic Health Records – with Arora, Mortagy, Dwarshius, Holder, Kamaleswaran	3nd Round of Revision at Journal of the American Medical Informatics Association (JAMIA)	healthcare	arxiv
46	Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization with Mortagy and Pokutta	Major revision at Mathematics of Operations Research (#18)	continuous optimization	arxiv
45	Algorithmic Challenges in Ensuring Fairness at the Time of Decision with Salem and Kamble	Minor Revision at Operations Research* (#25)	fairness, learning, pricing	arxiv
44	Reducing the Filtering Effect in Public School Admissions: A Bias-aware Analysis for Targeted Interventions with Faenza and Zhang	Major revision at Manufacturing and Service Operations Management (M&SOM)* (#37)	fairness, admissions	arxiv
	Published (or Accepted) papers:
	Title	Venue	Area	Notes
43	Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity – with Hettle and Molzahn	INFORMS Journal on Computing (accepted)	power systems, optimization, approximation	arxiv
42	Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization – with Moondra, Singh	SODA 2025	fairness, approximation algorithms	arxiv
41	Quantum Optimization: Potential, Challenges, and the Path Forward – with 40+ authors	Nature Reviews Physics 2024	quantum optimization	arxiv, nature
40	TACOS: Topology-Aware Collective Algorithm Synthesizer for Distributed Machine Learning with Won, Elavazhagan, Srinivasan, Krishna	MICRO 2024	machine learning, optimization, accelerators	arxiv
39	Sequential Sampling for Functional Estimation via SIEVE, with Benevento, Pacella and Paynabar	Quality and Reliability Engineering International 2024	function estimation	link
38	Secretary Problems with Biased Evaluations using Partial Ordinal Information with Salem	Management Science 2023* (#20)	fairness, secretary problems	paper
37	Reducing the Filtering Effect in Public School Admissions: A Bias-aware Analysis for Targeted Interventions with Faenza and Zhang	SIAM Applied Computational and Discrete Algorithms (ACDA) 2023	fairness, admissions	arxiv
36	Which L_p norm is the fairest? Approximations for fair facility location across all “p” – with Moondra, Singh	ACM Economics and Computation (EC) 2023	fairness, optimization, approximation	arxiv
35	Discovering Opportunities in New York City’s Discovery Program: an Analysis of Affirmative Action Mechanisms with Faenza, Zhang	ACM Economics and Computation (EC) 2023	fairness, mechanism design	arxiv
34	Using Algorithms to Tame Discrimination: A Path to Algorithmic Diversity, Equity, and Inclusion – with Desai, Salem	UC Davis Law Review, 2023	law, fairness	ssrn
33	Classically-inspired Mixers for QAOA Beat Goemans-Williamson’s Max-Cut at Low Circuit Depths, with Tate, Moondra, Gard, Mohler	Quantum 2023	quantum, optimization	arxiv
32	Hardness and Approximation of Submodular Minimum Linear Ordering Problems, with Farhadi, Sun, Tetali, Wigal	Mathematical Programming 2023	submodularity, approximations	arxiv
31	Temporal Fairness in Online Decision-Making with Salem, Kamble	Ethics in Artificial Intelligence: Bias, Fairness and Beyond 2023	fairness, online learning	chapter
30	Electrical Flows over Spanning Trees with Khodabhaksh, Mortagy, Nikolova	Mathematical Programming B, 2022	power systems, optimization, approximation	link
29	Don’t let Ricci v. DeStefano Hold You Back: A Bias-Aware Legal Solution to the Hiring Paradox, with Salem and Desai	ACM Fairness Accountability and Transparency (FAccT) 2022	law, fairness	arxiv
28	Mathematically Quantifying Gerrymandering and Non-Responsiveness of the 2021 Georgia Congressional Districting Plan with Zhao, Hettle, Mattingly, Randall, and Herschlag	ACM Equity and Access in Algorithms, Mechanisms, and Optimization (EAAMO) 2022	fairness, gerrymandering, sampling	arxiv
27	Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings with Rajakumar, Moondra and Herold	Physical Review A, 2022	quantum, approximation, optimization	arxiv
26	Bridging Classical and Quantum using SDP initialized warm-starts for QAOA with Tate, Farhadi, Herold and Mohler	ACM Transactions of Quantum Computing, 2022	quantum, optimization, approximation	arxiv
25	Algorithmic Challenges in Ensuring Fairness at the Time of Decision with Salem and Kamble	Web and Internet Economics (WINE) 2022	fairness, learning, pricing	arxiv
24	Individual Fairness in Hindsight with Kamble	Journal of Machine Learning Research, JMLR 2021* (#15)	fairness, online learning	arxiv
23	Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes with Moondra, Mortagy	Neural Information Processing Systems (NeurIPS) 2021	submodularity, machine learning, optimization	arxiv
22	Balanced Redistricting for Faster Emergency Response under Imbalanced Historic Data with Hettle, Zhu and Xie	Foundations of Responsible Computing, FORC 2021	fairness, districting	arxiv, talk
21	Generating clusters for urban logistics in hyperconnected networks with Hettle, Faugere, Kwon, Montreuil	International Physical Internet Conference (IPIC) 2021	fairness, districting, logistics	link
20	Closing the GAP: Mitigating Bias in Online Résumé-Filtering with Salem	Web and Internet Economics (WINE) 2020	fairness, secretary problems	link
19	Group-Fair Online Allocation in Continuous Time with Cayci, Eryilmaz	Neural Information Processing Systems, NeurIPS 2020	fairness, online learning	arxiv
18	Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization with Mortagy, Pokutta	Neural Information Processing Systems, NeurIPS 2020	optimization, continuous, discrete	arxiv
17	An Efficient Algorithm for Dynamic Pricing using a Graphical Representation with Cohen, Kalas and Perakis	Production and Operations Management (POMS) 2020	pricing, approximation	link
16	Too many fairness metrics: Is there a solution? Equity across Demographic Groups for the Facility Location Problem with Jalan, Ranade, Yang, Zhuang	Fields Institute Communication Series (conditionally accepted) and EDSC 2020	fairness, facility location, data analytics	ssrn
15	Individual Fairness in Hindsight with Kamble	ACM Economics and Computation (EC) 2019 (best paper candidate)	fairness, learning	arxiv
14	Computational Comparison of Metaheuristics with Silberholz, Golden, Wang	Handbook of Metaheuristics, Springer, 2019	heuristics, ML	chapter
13	Robust Look-ahead Three-phase Balancing of Uncertain Distribution Loads with Xie, Geng	Hawaii International Conference on System Sciences (HICSS) 2019	power systems, robust optimization	link
12	Limited Memory Kelley’s Method Converges for Composite Convex and Submodular Objectives with Udell, Zhou	Neural Information Processing Systems, NeurIPS 2018	optimization	paper
11	Fairness in Inventory Routing with Wang	NeurIPS Workshop on Ethical, Social and Governance Issues in AI 2018	inventory routing, fairness	link
10	A 4/3 approximation for TSP on cubic 3-edge-connected graph with Agarwal, Garg	Operations Research Letters, 2018	approximation algorithms	paper
9	What works best when? A Framework for Systematic Heuristic Evaluation with Silberholz, Dunning	INFORMS Journal on Computing, 2018	heuristics, ML	github
8	Newton’s Method for Parametric Submodular Function Minimization with Goemans, Jaillet	Integer Programming and Combinatorial Optimization (IPCO) 2017	submodularity	link
7	Combinatorial Structure in Online and Convex Optimization	PhD Thesis, MIT 2017	optimization, submodularity	thesis
6	Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases with Goemans, Jaillet	NeurIPS Workshop on Optimization for ML, 2016	submodularity, optimization	arxiv, video
5	The two-color Rado number for ax + by = (a+b)z with Rangan, Tripathi	Annals of Combinatorics, 2015	combinatorics	link
4	Towards a 4/3-approximation for the Metric Traveling Salesman Problem	Master’s Thesis, IIT Delhi 2011	approximation algorithms	pdf
3	SPAN: A Unified Framework and Toolkit for Querying Heterogeneous Access Policies – with LeFevre, Prakash	Hot Topics in Security 2009	security, networks	pdf
	Other Working Manuscripts:
	Title	Notes	Area
2	Robust Classifiers using Robust Feature Augmentation with Eykholt, Prakash, Rahmati, Vaishnavi, Zheng	arxiv	adversarial ML
1	A Scalable Robust and Adaptive Optimization Approach to Inventory Routing with Tay, Bertsimas	optonline	inventory routing