 Proportional Volume Sampling and Approximation Algorithms for AOptimal Design, Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat, To Appear in 30th Annual ACMSIAM Symposium on Discrete Algorithms SODA 2019.
 The Price of Fair PCA: One Extra Dimension Samira Samadi, Uthaipon Tantipongpipat, Jamie Morgenstern, Mohit Singh, and Santosh Vempala, In Proceedings of Thirtysecond Conference on Neural Information Processing Systems, NIPS 2018.
 Timing Matters: Online Dynamics in Broadcast Games Shuchi Chawla, Seffi Naor, Debmalya Panigrahi, Mohit Singh and Seeun William Umboh, In Proceedings of the 14th Conference on Web and Internet Economics (WINE), 2018.
 Approximate Positively Correlated Distributions and Approximation Algorithms for Doptimal Design Mohit Singh, Weijun Xie. In Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2018.
 Symmetric Sums of Squares over kSubset Hypercubes, Annie Raymond, James Saunderson, Mohit Singh, Rekha R. Thomas. Math. Programming 167(2): 315354 (2018).
 Approximating Minimum Cost Connectivity Orientation and Augmentation Mohit Singh, Laszlo A. Vegh. SIAM J. Comput. 47(1): 270293 (2018).
A preliminary version appeared in Proceedings of ACMSIAM Symposium on Discrete Algorithms (SODA) 2014.
 LPBased Algorithms for Capacitated Facility Location. HyungChan An, Mohit Singh, Ola Svensson. SIAM J. Comput. 46(1): 272306 (2017).
A preliminary version appeared in 55th Annual Symposium on Foundations of Computer Science (FOCS 2014).
 Efficient Algorithms for Discrepancy Minimization in Convex Sets, Ronen Eldan and Mohit Singh, Random Structures and Algorithms, 2018.
 Symmetry in Turan Sums of Squares Polynomials from Flag Algebras, Annie Raymond, Mohit Singh, Rekha R. Thomas, Algebraic Combinatorics Volume 1 (2018) no. 2 p. 249274.
 Robust submodular maximization: Offline and online algorithms, Nima Anari, Nika Haghtalab, Sebastian Pokutta, Mohit Singh, Alfredo Torrico. Arxiv 2017.
 Minimum Birkhoffvon Neumann Decomposition, Janardhan Kulkarni, Euiwoong Lee, Mohit Singh. In proceedings of 19th Integer Programming and Combinatorial Optimization (IPCO) 2017.
 Nash Social Welfare, Matrix Permanent, and Stable Polynomials, Nima Anari, Shayan Oveis Gharan, Amin Saberi and Mohit Singh, In Proceedings of Innovations in Theoretical Computer Science (ITCS) 2017.
 Random Walks in Polytopes and Negative Dependence, Yuval Peres, Mohit Singh and Nisheeth Vishnoi, In Proceedings of Innovations in Theoretical Computer Science (ITCS) 2017.
 Maximizing determinants under partition constraints, Aleksandar Nikolov, Mohit Singh, In Proceedings of the fortyeighth annual ACM symposium on Theory of Computing (STOC) 2016.
 An Improved Integrality Gap for Asymmetric TSP Paths Zachary Friggstad, Anupam Gupta and Mohit Singh. Math of Operation Research, Vol. 41, No. 3, pp. 745757, August 2016.
A Preliminary version appeared in Proceedings of 16th International Conference on Integer Programming and Combinatorial Optimization IPCO 2013: 181192.
 kTrails: Recognition, Complexity, and Approximations, Mohit Singh, Rico Zenklusen, In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016.
 A geometric alternative to Nesterov's accelerated gradient descent, Sebastien Bubeck, Yin Tat Lee, Mohit Singh, June 2015.
 Online Caching with Convex Costs, Ishai Menache and Mohit Singh. To appear in Proceedings of 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), June 2015.
 Sharing Buffer Pool Memory in MultiTenant Relational DatabaseasaService, Vivek Narasayya, Ishai Menache, Mohit Singh, Feng Li, Manoj Syamala and Surajit Chaudhuri, In Proceedings of 41st International Conference on Very Large Data Bases (VLDB), Vol. 8, no. 7, March 2015.
 Entropy, Optimization and Counting, Mohit Singh and Nisheeth Vishnoi. In Proceedings of 46th ACM Symposium on Theory of Computing (STOC 2014).
 Discrepancy Without Partial Colorings, Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh, In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2014).
 Short Tours through Large Linear Forests, Uriel Feige, R. Ravi and Mohit Singh, In Proceedings of 17th Conference on
Integer Programming and Combinatorial Optimization (IPCO 2014).
 New approaches to multiobjective optimization Fabrizio Grandoni, R. Ravi, Mohit Singh and Rico Zenklusen. Mathematical Programming (2014).
 Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints, Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh, Automata, Languages, and Programming  39th International Colloquium, ICALP (1) 2012: 145156.
 A Rounding by Sampling Approach to the Minimum Size kArc Connected Subgraph Problem, Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh, Automata, Languages, and Programming  39th International Colloquium, ICALP (1) 2012: 606616.
 A Randomized Rounding Approach to the Traveling Salesman Problem, Shayan Oveis Gharan, Amin Saberi and Mohit Singh, 52nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2011: 550559. Full version.
 Online Nodeweighted Steiner Tree and Related Problems. Seffi Naor, Debmalya Panigrahy and Mohit Singh, 52nd Annual IEEE Symposium on Foundations of Computer Science FOCS 2011: 210219.

Approximation Algorithms for Online Submodular Function Maximization subject to a Matroid Constraint. Niv Buchbinder, Seffi Naor, R. Ravi and Mohit Singh, Submitted, 2010.

Incentives in Online Auctions via Linear Programming. Niv Buchbinder, Kamal Jain and Mohit Singh, In Proceedings of Sixth Workshop on Internet and Network Economics (WINE), 2010.

Improving Integrality Gaps via ChvatalGomory Rounding. Mohit Singh and Kunal Talwar, In Proceedings of the 13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems  APPROX 2010.
 Secretary Problems via Linear Programming. Niv Buchbinder, Kamal Jain and Mohit Singh, To Appear In Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2010.
 Deploying Mesh Nodes under NonUniform Propagation. Joshua Robinson, Mohit Singh, R. Swaminathan, and E. Knightly, To Appear in Proceedings of IEEE INFOCOM 2010, San Diego, CA, March 2010.
 Iterative Rounding for MultiObjective Optimization Problems. Fabrizio Grandoni, R. Ravi, Mohit Singh, In Proceedings of European Symposium of Algorithms, ESA 2009: 95106.
 Set Covering with Our Eyes Closed. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh, In Proceedings of 49th Annual Symposium on Foundations of Computer Science Conference, FOCS 2008: 347356.
 Edge Coloring and Decompositions of Weighted Graphs. Uriel Feige and Mohit Singh, In Proceedings of European Symposium of Algorithms, ESA 2008: 405416.
 Additive Approximation for Bounded Degree Survivable Network Design. Lap Chi Lau and Mohit Singh, In Proceedings of 40th ACM Symposium on Theory of Computing, STOC 2008: 759768.
 Degree Bounded Matroids and Submodular Flows. Tamas Kiraly, Lap Chi Lau and Mohit Singh, In Proceedings of 13th Conference on Integer Programming and Combinatorial Optimization, IPCO 2008: 259272.
 Improved Approximation Ratios for Traveling Salesman Tours and Paths in Directed Graphs. Uriel Feige and Mohit Singh, In Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007: 104118.
 Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. Mohit Singh and Lap Chi Lau, In Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007: 661670.
 Survivable Network Design with Degree or Order Constraints. Lap Chi Lau, S. Naor, M. Salavatipour and M. Singh, In Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007: 651660. Journal Version SIAM Journal of Computing, Volume 39, Issue 3, 2009: 10621087.
 Delegate and Conquer: An LPbased Approximation Algorithms for Minimum Degree MSTs. R. Ravi and Mohit Singh, In Proceedings of 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006: 169180.
 Approximating the kMulticut Problem. Daniel Golovin, Viswanath Nagarajan and Mohit Singh, In Proceedings of ACMSIAM Symposium on Discrete Algorithms, SODA 2006: 621630.
 How to Pay, Come What May: Approximation Algorithms for DemandRobust Covering Problems. Kedar Dhamdere, Vineet Goyal, R. Ravi and Mohit Singh, In Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005: 367378.
 On Stochastic Minimum Spanning Trees. Kedar Dhamdere, R. Ravi and Mohit Singh, In Proceedings of Eleventh Conference on Integer Programming and Combinatorial Optimization, IPCO 2005: 321324.
 On the Crossing Spanning Tree Problem,. Vittorio Bilo, Vineet Goyal, R. Ravi and Mohit Singh, In Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004: 5160. Latest Version.
