Nira Shafrir

The greedy algorithm for shortest superstrings

Haim Kaplan, Nira Shafrir, Haim Kaplan, 2005, Inf. Process. Lett..

Union-find with deletions

Haim Kaplan, Robert E. Tarjan, Nira Shafrir, 2002, SODA '02.

Finding the Position of the k-Mismatch and Approximate Tandem Repeats

Haim Kaplan, Ely Porat, Nira Shafrir, 2006, SWAT.

The greedy algorithm for edit distance with moves

Haim Kaplan, Nira Shafrir, Haim Kaplan, 2006, Inf. Process. Lett..

Path Minima in Incremental Unrooted Trees

Haim Kaplan, Nira Shafrir, 2008, ESA.

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Moshe Lewenstein, Haim Kaplan, Maxim Sviridenko, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Moshe Lewenstein, Haim Kaplan, Maxim Sviridenko, 2005, JACM.

Data structures for mergeable trees

Haim Kaplan, Robert E. Tarjan, Loukas Georgiadis, 2007, TALG.

Meldable heaps and boolean union-find

Haim Kaplan, Robert E. Tarjan, Nira Shafrir, 2002, STOC '02.