| 2009 |
|---|
| 9 | EE | David R. Karger,
Debmalya Panigrahi:
A near-linear time algorithm for constructing a cactus representation of minimum cuts.
SODA 2009: 246-255 |
| 2008 |
|---|
| 8 | EE | K. V. M. Naidu,
Debmalya Panigrahi,
Rajeev Rastogi:
Detecting Anomalies Using End-to-End Path Measurements.
INFOCOM 2008: 1849-1857 |
| 7 | EE | Partha Dutta,
Sharad Jaiswal,
Debmalya Panigrahi,
Rajeev Rastogi:
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks.
INFOCOM 2008: 2261-2269 |
| 6 | EE | Debmalya Panigrahi,
Partha Dutta,
Sharad Jaiswal,
K. V. M. Naidu,
Rajeev Rastogi:
Minimum Cost Topology Construction for Rural Wireless Mesh Networks.
INFOCOM 2008: 771-779 |
| 5 | EE | Anand Bhalgat,
Ramesh Hariharan,
Telikepalli Kavitha,
Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
SODA 2008: 455-464 |
| 4 | EE | Debmalya Panigrahi:
Gomory-Hu Trees.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 3 | EE | Partha Dutta,
Sharad Jaiswal,
Debmalya Panigrahi,
K. V. M. Naidu,
Rajeev Rastogi,
Ajay Kumar Todimala:
VillageNet: A low-cost, 802.11-based mesh network for rural regions.
COMSWARE 2007 |
| 2 | EE | Ramesh Hariharan,
Telikepalli Kavitha,
Debmalya Panigrahi:
Efficient algorithms for computing all low s-t edge connectivities and related problems.
SODA 2007: 127-136 |
| 1 | EE | Ramesh Hariharan,
Telikepalli Kavitha,
Debmalya Panigrahi,
Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.
STOC 2007: 605-614 |
