Nitish Korula

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.

Google Publications

Previous Publications

  •  

    Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models

    Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni

    EC (2015), pp. 169-186

  •  

    Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order

    Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam

    STOC (2015), pp. 889-898

  •  

    Partner tiering in display advertising

    Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni

    WSDM (2014), pp. 133-142

  •  

    Bicriteria Online Matching: Maximizing Weight and Cardinality

    Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam

    WINE (2013), pp. 305-318

  •  

    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), SIAM, Philadelphia, PA (2011), pp. 1028-1049

  •  

    Online Stochastic Ad Allocation: Efficiency and Fairness

    Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein

    CoRR, vol. abs/1001.5076 (2010)

  •   

    Improved Algorithms for Orienteering and Related Problems

    Chandra Chekuri, Nitish Korula, Martin Pál

    Proc. 19th Annual Symposium on Discrete Algorithms (SODA), SIAM (2008)