The Euclidean k-Supplier Problem, with B. Schieber and H. Shachnai, Mathematics of Operations Research,45(1):1-14, 2020. DOI. Preliminary version in IPCO 2013. DOI.
Approximation-Friendly Discrepancy Rounding, with N. Bansal, “A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek”, editors Martin Loebl, Jaroslav Nešetřil, Robin Thomas, 89-114, 2017 Preliminary version in IPCO, 2016.
Algorithms for Hub Label Optimization, with M. Babenko, A. Goldberg and A. Gupta, ACM Transactions on Algorithms, 13(1), 2016. Preliminary version in ICALP 2013.
Minimum Congestion Mapping in a Cloud, with N. Bansal, K.W. Lee and M. Zafer, SIAM Journal on Computing, 44(3), 819-843, 2015. Preliminary version in PODC 2011.
Min-Max Graph Partitioning and Small Set Expansion, with N. Bansal, U. Feige, R. Krauthgamer, K. Makarychev, J. Naor and R. Schwartz, SIAM J. Computing, 43(2), 872-904, 2014. Preliminary version in FOCS 2011.
A plant location guide for the unsure, with B. Anthony, V. Goyal, and A. Gupta, Mathematics of Operations Research, 35(1), 79-101, 2010. Preliminary version in SODA 2008.