Nitish Korula

Chandra Chekuri, Nitish Korula: Pruning 2-Connected Graphs. Algorithmica 62(1-2): 436-463 (2012)

Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher Stocker, Jennifer Vandenbussche, Douglas B. West: Overlap number of graphs. Journal of Graph Theory 70(1): 10-28 (2012)

Chandra Chekuri, Nitish Korula, Martin Pál: Improved algorithms for orienteering and related problems. ACM Transactions on Algorithms 8(3): 23 (2012)

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory of Computing 8(1): 533-565 (2012)

Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design. IPCO 2011: 78-91

MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx: Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049

Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: On k-Column Sparse Packing Programs. IPCO 2010: 369-382

Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)

Chandra Chekuri, Alina Ene, Nitish Korula: Prize-Collecting Steiner Tree and Forest in Planar Graphs. CoRR abs/1006.4357 (2010)

Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design. CoRR abs/1009.5734 (2010)

Chandra Chekuri, Alina Ene, Nitish Korula: Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55

Chandra Chekuri, Nitish Korula: A Graph Reduction Step Preserving Element-Connectivity and Applications. ICALP (1) 2009: 254-265

Nitish Korula, Martin Pál: Algorithms for Secretary Problems on Graphs and Hypergraphs. ICALP (2) 2009: 508-520

Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál: Online Ad Assignment with Free Disposal. WINE 2009: 374-385

Chandra Chekuri, Nitish Korula: A Graph Reduction Step Preserving Element-Connectivity and Applications. CoRR abs/0902.2795 (2009)

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan: On k-Column Sparse Packing Programs. CoRR abs/0908.2256 (2009)

Chandra Chekuri, Nitish Korula: Pruning 2-Connected Graphs. FSTTCS 2008: 119-130

Chandra Chekuri, Nitish Korula: Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008: 131-142

Chandra Chekuri, Nitish Korula, Martin Pál: Improved algorithms for orienteering and related problems. SODA 2008: 661-670

Chandra Chekuri, Nitish Korula: Min-Cost 2-Connected Subgraphs With k Terminals. CoRR abs/0802.2528 (2008)

Nitish Korula, Martin Pal: Algorithms for Secretary Problems on Graphs and Hypergraphs. CoRR abs/0807.1139 (2008)

Chandra Chekuri, Nitish Korula: Approximation Algorithms for Orienteering with Time Windows. CoRR abs/0711.4825 (2007)