Union-find with deletions. - Haim Kaplan; Nira Shafrir; Robert Endre Tarjan (SODA, 2002)

Meldable heaps and boolean union-find. - Haim Kaplan; Nira Shafrir; Robert Endre Tarjan (STOC, 2002)

The greedy algorithm for shortest superstrings. - Haim Kaplan; Nira Shafrir (Inf. Process. Lett., 2005)

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. - Haim Kaplan; Moshe Lewenstein; Nira Shafrir; Maxim Sviridenko (J. ACM, 2005)

Finding the Position of the k-Mismatch and Approximate Tandem Repeats. - Haim Kaplan; Ely Porat; Nira Shafrir (SWAT, 2006)

The greedy algorithm for edit distance with moves. - Haim Kaplan; Nira Shafrir (Inf. Process. Lett., 2006)

Path Minima in Incremental Unrooted Trees. - Haim Kaplan; Nira Shafrir (ESA, 2008)

Algorithms for NP-Hard problems related to strings and for approximate pattern matching and repeats - Nira Shafrir (2009)

Data structures for mergeable trees. - Loukas Georgiadis; Haim Kaplan; Nira Shafrir; Robert Endre Tarjan; Renato Fonseca F. Werneck (ACM Trans. Algorithms, 2011)