Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nira Shafrir
2010 – today
- 2011
[j4]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck: Data structures for mergeable trees. ACM Transactions on Algorithms 7(2): 14 (2011)
2000 – 2009
- 2008
- [c5]
- 2007
- [i1]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck: Data Structures for Mergeable Trees. CoRR abs/0711.1682 (2007)
- 2006
- [j3]Haim Kaplan, Nira Shafrir: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1): 23-27 (2006)
- [c4]Haim Kaplan, Ely Porat, Nira Shafrir: Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101
- 2005
- [j2]Haim Kaplan, Nira Shafrir: The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93(1): 13-17 (2005)
- [j1]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
- [c3]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65
- 2002
- [c2]
- [c1]Haim Kaplan, Nira Shafrir, Robert Endre Tarjan: Meldable heaps and boolean union-find. STOC 2002: 573-582
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:03 CET by the dblp team