| |
| 2009 | ||
|---|---|---|
| 7 | EE | Chandra Chekuri, Nitish Korula: A Graph Reduction Step Preserving Element-Connectivity and Applications CoRR abs/0902.2795: (2009) |
| 2008 | ||
| 6 | EE | Chandra Chekuri, Nitish Korula: Pruning 2-Connected Graphs. FSTTCS 2008 |
| 5 | EE | Chandra Chekuri, Nitish Korula: Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008 |
| 4 | EE | Chandra Chekuri, Nitish Korula, Martin Pál: Improved algorithms for orienteering and related problems. SODA 2008: 661-670 |
| 3 | EE | Chandra Chekuri, Nitish Korula: Min-Cost 2-Connected Subgraphs With k Terminals CoRR abs/0802.2528: (2008) |
| 2 | EE | Nitish Korula, Martin Pal: Algorithms for Secretary Problems on Graphs and Hypergraphs CoRR abs/0807.1139: (2008) |
| 2007 | ||
| 1 | EE | Chandra Chekuri, Nitish Korula: Approximation Algorithms for Orienteering with Time Windows CoRR abs/0711.4825: (2007) |
| 1 | Chandra Chekuri | [1] [3] [4] [5] [6] [7] |
| 2 | Martin Pál (Martin Pal) | [2] [4] |