Nira Shafrir

Publication Activity (10 Years)

Years Active: 2002-2011
Publications (10 Years): 0

Publications

Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data structures for mergeable trees. ACM Trans. Algorithms 7 (2) (2011)
Haim Kaplan, Nira Shafrir
Path Minima in Incremental Unrooted Trees. ESA (2008)
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data Structures for Mergeable Trees CoRR (2007)
Haim Kaplan, Nira Shafrir
The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97 (1) (2006)
Haim Kaplan, Ely Porat, Nira Shafrir
-Mismatch and Approximate Tandem Repeats. SWAT (2006)
Haim Kaplan, Nira Shafrir
The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93 (1) (2005)
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52 (4) (2005)
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS (2003)
Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Meldable heaps and boolean union-find. STOC (2002)
Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Union-find with deletions. SODA (2002)