3 citations · 3 across the 2 of their papers we have counts for
2 papers
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…
cs.CG2010★ 3 cited
Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees
Tanaeem M. Moosa, M. Sohel Rahman
In the point set embeddability problem, we are given a plane graph with vertices and a point set with points. Now the goal is to answer the question whether there e…