The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nira Shafrir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:56-0 [Conf]
  2. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
    Union-find with deletions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:19-28 [Conf]
  3. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
    Meldable heaps and boolean union-find. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:573-582 [Conf]
  4. Haim Kaplan, Ely Porat, Nira Shafrir
    Finding the Position of the k-Mismatch and Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:90-101 [Conf]
  5. Haim Kaplan, Nira Shafrir
    The greedy algorithm for shortest superstrings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:1, pp:13-17 [Journal]
  6. Haim Kaplan, Nira Shafrir
    The greedy algorithm for edit distance with moves. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:1, pp:23-27 [Journal]
  7. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:602-626 [Journal]

  8. Path Minima in Incremental Unrooted Trees. [Citation Graph (, )][DBLP]


  9. Data Structures for Mergeable Trees [Citation Graph (, )][DBLP]


Search in 0.003secs, 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