| 2008 |
|---|
| 14 | EE | Uriel Feige,
Mohit Singh:
Edge Coloring and Decompositions of Weighted Graphs.
ESA 2008: 405-416 |
| 13 | EE | Fabrizio Grandoni,
Anupam Gupta,
Stefano Leonardi,
Pauli Miettinen,
Piotr Sankowski,
Mohit Singh:
Set Covering with our Eyes Closed.
FOCS 2008: 347-356 |
| 12 | EE | Tamás Király,
Lap Chi Lau,
Mohit Singh:
Degree Bounded Matroids and Submodular Flows.
IPCO 2008: 259-272 |
| 11 | EE | Lap Chi Lau,
Mohit Singh:
Additive approximation for bounded degree survivable network design.
STOC 2008: 759-768 |
| 2007 |
|---|
| 10 | EE | Uriel Feige,
Mohit Singh:
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.
APPROX-RANDOM 2007: 104-118 |
| 9 | EE | Lap Chi Lau,
Joseph Naor,
Mohammad R. Salavatipour,
Mohit Singh:
Survivable network design with degree or order constraints.
STOC 2007: 651-660 |
| 8 | EE | Mohit Singh,
Lap Chi Lau:
Approximating minimum bounded degree spanning trees to within one of optimal.
STOC 2007: 661-670 |
| 7 | EE | Mohit Singh,
Amitabha Tripathi:
On an extremal problem related to a theorem of Whitney.
Discrete Applied Mathematics 155(4): 579-583 (2007) |
| 2006 |
|---|
| 6 | EE | R. Ravi,
Mohit Singh:
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.
ICALP (1) 2006: 169-180 |
| 5 | EE | Daniel Golovin,
Viswanath Nagarajan,
Mohit Singh:
Approximating the k-multicut problem.
SODA 2006: 621-630 |
| 2005 |
|---|
| 4 | EE | Kedar Dhamdhere,
Vineet Goyal,
R. Ravi,
Mohit Singh:
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.
FOCS 2005: 367-378 |
| 3 | EE | Kedar Dhamdhere,
R. Ravi,
Mohit Singh:
On Two-Stage Stochastic Minimum Spanning Trees.
IPCO 2005: 321-334 |
| 2004 |
|---|
| 2 | EE | Vittorio Bilò,
Vineet Goyal,
R. Ravi,
Mohit Singh:
On the Crossing Spanning Tree Problem.
APPROX-RANDOM 2004: 51-60 |
| 2003 |
|---|
| 1 | EE | Mohit Singh,
Amitabha Tripathi:
Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree.
Electronic Notes in Discrete Mathematics 15: 196-197 (2003) |
