|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Data structures for mergeable trees.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir |
Path Minima in Incremental Unrooted Trees.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Data Structures for Mergeable Trees  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir |
The greedy algorithm for edit distance with moves.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Ely Porat, Nira Shafrir |
Finding the Position of the k-Mismatch and Approximate Tandem Repeats.  |
SWAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir |
The greedy algorithm for shortest superstrings.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.  |
J. ACM  |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Union-find with deletions.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Meldable heaps and boolean union-find.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|