| 2008 |
|---|
| 9 | EE | Haim Kaplan,
Nira Shafrir:
Path Minima in Incremental Unrooted Trees.
ESA 2008: 565-576 |
| 2007 |
|---|
| 8 | EE | Loukas Georgiadis,
Haim Kaplan,
Nira Shafrir,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Data Structures for Mergeable Trees
CoRR abs/0711.1682: (2007) |
| 2006 |
|---|
| 7 | EE | Haim Kaplan,
Ely Porat,
Nira Shafrir:
Finding the Position of the k-Mismatch and Approximate Tandem Repeats.
SWAT 2006: 90-101 |
| 6 | EE | Haim Kaplan,
Nira Shafrir:
The greedy algorithm for edit distance with moves.
Inf. Process. Lett. 97(1): 23-27 (2006) |
| 2005 |
|---|
| 5 | EE | Haim Kaplan,
Nira Shafrir:
The greedy algorithm for shortest superstrings.
Inf. Process. Lett. 93(1): 13-17 (2005) |
| 4 | EE | Haim Kaplan,
Moshe Lewenstein,
Nira Shafrir,
Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM 52(4): 602-626 (2005) |
| 2003 |
|---|
| 3 | EE | Haim Kaplan,
Moshe Lewenstein,
Nira Shafrir,
Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
FOCS 2003: 56- |
| 2002 |
|---|
| 2 | EE | Haim Kaplan,
Nira Shafrir,
Robert Endre Tarjan:
Union-find with deletions.
SODA 2002: 19-28 |
| 1 | EE | Haim Kaplan,
Nira Shafrir,
Robert Endre Tarjan:
Meldable heaps and boolean union-find.
STOC 2002: 573-582 |
