 | 2009 |
|---|
| 11 |       | Chandra Chekuri,
Alina Ene,
Nitish Korula:
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.
APPROX-RANDOM 2009: 42-55 |
| 10 | | Chandra Chekuri,
Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications.
ICALP (1) 2009: 254-265 |
| 9 | | Nitish Korula,
Martin Pál:
Algorithms for Secretary Problems on Graphs and Hypergraphs.
ICALP (2) 2009: 508-520 |
| 8 | | Chandra Chekuri,
Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications
CoRR abs/0902.2795: (2009) |
| 7 | | Nikhil Bansal,
Nitish Korula,
Viswanath Nagarajan:
On k-Column Sparse Packing Programs
CoRR abs/0908.2256: (2009) |
| 2008 |
|---|
| 6 | | Chandra Chekuri,
Nitish Korula:
Pruning 2-Connected Graphs.
FSTTCS 2008 |
| 5 | | Chandra Chekuri,
Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements.
FSTTCS 2008 |
| 4 | | Chandra Chekuri,
Nitish Korula,
Martin Pál:
Improved algorithms for orienteering and related problems.
SODA 2008: 661-670 |
| 3 | | Chandra Chekuri,
Nitish Korula:
Min-Cost 2-Connected Subgraphs With k Terminals
CoRR abs/0802.2528: (2008) |
| 2 | | Nitish Korula,
Martin Pal:
Algorithms for Secretary Problems on Graphs and Hypergraphs
CoRR abs/0807.1139: (2008) |
| 2007 |
|---|
| 1 | | Chandra Chekuri,
Nitish Korula:
Approximation Algorithms for Orienteering with Time Windows
CoRR abs/0711.4825: (2007) |
