Nitish is a Research Scientist at Google. His research interests lie in algorithm design, especially for optimization problems where it is hard to find optimal solutions. In particular, he is interested in approximation and online algorithms, combinatorial optimization, graph theory, and algorithmic game theory.
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.
“Online Stochastic Packing Applied to Display Ad Allocation”, Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein, ESA (1), 2010, pp. 182-194.
[doi] [search]
“Algorithms for Secretary Problems on Graphs and Hypergraphs”, Nitish Korula, Martin Pál, ICALP 2009.
[abstract] [front.math.ucdavis.edu] [search]
“Online Ad Assignment with Free Disposal”, Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál, Workshop of Internet Economics (WINE), 2009, pp. 374-385.
[doi] [search]
“Prize-collecting Steiner Problems on Planar Graphs”, Mohammadhossein Bateni, Chandra Chekuri, Alina Ene, MohammadTaghi Hajiaghayi, Nitish Korula, Daniel Marx, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011, pp. 1028-1049.
[search]
“Improved Algorithms for Orienteering and Related Problems”, Chandra Chekuri, Nitish Korula, Martin Pál, Proc. 19th Annual Symposium on Discrete Algorithms (SODA), 2008.
[cs.uiuc.edu] [pdf] [search]