| 2007 |
|---|
| 8 | EE | Jittat Fakcharoenphol,
Chris Harrelson,
Satish Rao:
The k-traveling repairmen problem.
ACM Transactions on Algorithms 3(4): (2007) |
| 2005 |
|---|
| 7 | EE | Abraham Bachrach,
Kevin Chen,
Chris Harrelson,
Radu Mihaescu,
Satish Rao,
Apurva Shah:
Lower Bounds for Maximum Parsimony with Gene Order Data.
Comparative Genomics 2005: 1-10 |
| 6 | EE | Andrew V. Goldberg,
Chris Harrelson:
Computing the shortest path: A search meets graph theory.
SODA 2005: 156-165 |
| 2004 |
|---|
| 5 | EE | Aaron Archer,
Jittat Fakcharoenphol,
Chris Harrelson,
Robert Krauthgamer,
Kunal Talwar,
Éva Tardos:
Approximate classification via earthmover metrics.
SODA 2004: 1079-1087 |
| 2003 |
|---|
| 4 | EE | Jittat Fakcharoenphol,
Chris Harrelson,
Satish Rao,
Kunal Talwar:
An improved approximation algorithm for the 0-extension problem.
SODA 2003: 257-265 |
| 3 | EE | Jittat Fakcharoenphol,
Chris Harrelson,
Satish Rao:
The k-traveling repairman problem.
SODA 2003: 655-664 |
| 2 | EE | Chris Harrelson,
Kirsten Hildrum,
Satish Rao:
A polynomial-time tree decomposition to minimize congestion.
SPAA 2003: 34-43 |
| 2001 |
|---|
| 1 | EE | Chris Harrelson,
Iordanis Kerenidis:
Quantum Clock Synchronization with one qubit
CoRR cs.CC/0103021: (2001) |
