- Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Testerstoc 2023: 233-241 [doi]
- 1/2+o(1) Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergridseccc, TR23, 2023. [doi]
- Robust k-center with two types of radiimp, 197(2):991-1007, February 2023. [doi]

- Deterministic Dynamic Matching in O(1) Update Timealgorithmica, 82(4):1057-1080, 2020. [doi]
- d-Dimensionssoda 2020: 1975-1994 [doi]
- k-Center ProblemTALG, 16(4), 2020. [doi]

- Fair Algorithms for Clusteringnips 2019: 4955-4966 [doi]
- Generalized Center Problems with OutliersTALG, 15(3), 2019. [doi]
- Faster Matroid Intersectionfocs 2019: 1146-1168 [doi]

- Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergridseccc, 25:187, 2018. [doi]
- Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scalingsoda 2018: [doi]
- Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Medianicalp 2018: [doi]
- Online Buy-at-Bulk Network DesignSICOMP, 47(4):1505-1528, 2018. [doi]

- A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercubeeccc, 24:111, 2017. [doi]
- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Timeipco 2017: 86-98 [doi]
- A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid $[n]^d$eccc, 24:159, 2017. [doi]

- Detecting Character Dependencies in Stochastic Models of Evolutionjcb, 23(3):180-191, 2016. [doi]
- An o(n) Monotonicity Tester for Boolean Functions over the HypercubeSICOMP, 45(2):461-472, 2016. [doi]
- Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problemsmor, 41(3):865-883, 2016. [doi]
- A Õ(n) Non-Adaptive Tester for Unatenesseccc, 23:133, 2016. [doi]
- Special Issue: APPROX-RANDOM 2014: Guest Editors' Forewordtoc, 12(1):1-3, 2016. [doi]

- Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Propertiessoda 2015: 1809-1828 [doi]
- Recognizing Coverage Functionssiamdm, 29(3):1585-1599, 2015. [doi]
- Approximability of Capacitated Network Designalgorithmica, 72(2):493-514, 2015. [doi]

- Welfare maximization and truthfulness in mechanism design with ordinal preferencesinnovations 2014: 105-120 [doi]
- Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Propertieseccc, 21:42, 2014. [doi]
- An Optimal Lower Bound for Monotonicity Testing over Hypergridstoc, 10:453-464, 2014. [doi]
- Submodularity Helps in Nash and Nonsymmetric Bargaining Gamessiamdm, 28(1):99-115, 2014. [doi]

- Approximability of the Firefighter Problem - Computing Cuts over Timealgorithmica, 62(1-2):520-536, 2012. [doi]

- G-parking functions, acyclic orientations and spanning treesDM, 310(8):1340-1353, 2010. [doi]
- Design is as Easy as Optimizationsiamdm, 24(1):270-286, 2010. [doi]
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper boundorl, 38(6):567-570, 2010. [doi]

- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problemipco 2008: 344-358 [doi]
- On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAPfocs 2008: 687-696 [doi]
- Algorithmic aspects of connectivity, allocation and design problemsPhD thesis, Georgia Institute of Technology, Atlanta, GA, USA, 2008. [doi]