
Search the dblp DataBase
Nira Shafrir:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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:560 [Conf]
 Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Unionfind with deletions. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:1928 [Conf]
 Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Meldable heaps and boolean unionfind. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:573582 [Conf]
 Haim Kaplan, Ely Porat, Nira Shafrir
Finding the Position of the kMismatch and Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:90101 [Conf]
 Haim Kaplan, Nira Shafrir
The greedy algorithm for shortest superstrings. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:93, n:1, pp:1317 [Journal]
 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:2327 [Journal]
 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:602626 [Journal]
Path Minima in Incremental Unrooted Trees. [Citation Graph (, )][DBLP]
Data Structures for Mergeable Trees [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
