most citedImproved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees

3 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2011

Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet

Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman +1

Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of string…