|
Search the dblp DataBase
Chris Harrelson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
Lower Bounds for Maximum Parsimony with Gene Order Data. [Citation Graph (0, 0)][DBLP] Comparative Genomics, 2005, pp:1-10 [Conf]
- Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
Approximate classification via earthmover metrics. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1079-1087 [Conf]
- Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
The k-traveling repairman problem. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:655-664 [Conf]
- Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
An improved approximation algorithm for the 0-extension problem. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:257-265 [Conf]
- Andrew V. Goldberg, Chris Harrelson
Computing the shortest path: A search meets graph theory. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:156-165 [Conf]
- Chris Harrelson, Kirsten Hildrum, Satish Rao
A polynomial-time tree decomposition to minimize congestion. [Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:34-43 [Conf]
- Chris Harrelson, Iordanis Kerenidis
Quantum Clock Synchronization with one qubit [Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal]
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|