Before joining Google, Nitish received his Ph.D.in Computer Science at the University of Illinois, and his B.E. from Birla Institute of Technology & Science (BITS), Pilani.
An efficient reconciliation algorithm for social networks.
PVLDB (2014), pp. 377-388
Filter & Follow: Do Social Media Encourage Efficient News Curation?
Whole-page optimization and submodular welfare maximization with online bidders
ACM Conference on Electronic Commerce (EC) 2013, pp. 305-322
Online Stochastic Packing Applied to Display Ad Allocation
ESA (1) (2010), pp. 182-194
Online Ad Assignment with Free Disposal
Workshop of Internet Economics (WINE) (2009), pp. 374-385
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
EC (2015), pp. 169-186
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
STOC (2015), pp. 889-898
Partner tiering in display advertising
WSDM (2014), pp. 133-142
Bicriteria Online Matching: Maximizing Weight and Cardinality
WINE (2013), pp. 305-318
Prize-collecting Steiner Problems on Planar Graphs
Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, PA (2011), pp. 1028-1049
Online Stochastic Ad Allocation: Efficiency and Fairness
CoRR, vol. abs/1001.5076 (2010)
Improved Algorithms for Orienteering and Related Problems
Proc. 19th Annual Symposium on Discrete Algorithms (SODA), SIAM (2008)