The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chris Harrelson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
    The k-traveling repairman problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:655-664 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Chris Harrelson, Iordanis Kerenidis
    Quantum Clock Synchronization with one qubit [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]

  8. Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002