The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time (2009)
Firoz, Jesun Sahariar, Hasan, Masud, Khan, Ashik Zinnat, Rahman, M. Sohel
Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SPbT. We use the...
Cutting a Convex Polyhedron Out of a Sphere (2009)
Ahmed, Syed Ishtiaque, Hasan, Masud, Islam, Md. Ariful
Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an $O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and has cutting cost $O((\log n)^2)$ times the...
Abstract. We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both...
Efficient View Point Selection for Silhouettes of Convex Polyhedra (2008)
Abstract. The silhouette of polyhedra is an important primitive in application areas such as machine vision and computer graphics. In this paper, we study how to select view points of convex...
Sorting by Prefix Reversals and Prefix Transpositions with Forward March (2008)
Sharmin, Mahfuza, Yeasmin, Rukhsana, Hasan, Masud
Sorting permutations by reversals and/or transpositions is an important genome rearrangement problem in computational molecular biology. From theoretical point of view, finding efficient algorithms...
Characterizing Graphs of Zonohedra (2008)
Adnan, Muhammad Abdullah, Hasan, Masud
A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the...
An Approximation Algorithm for Sorting by Reversals and Transpositions (2008)
Atif Rahman, Swakkhar Shatabda, Masud Hasan
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial...
Reconstruction and Visualization of Polyhedra Using Projections (2005)
Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and...
Reconstruction and Visualization of Polyhedra Using Projections (2005)
Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. Three problems are considered in reconstruction of polygons and polyhedra, given a set...
Reconstruction and Visualization of Polyhedra Using Projections (2005)
Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. Three problems are considered in reconstruction of polygons and polyhedra, given a set...
Reconstruction and Visualization of Polyhedra Using Projections (2005)
Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. Three problems are considered in reconstruction of polygons and polyhedra, given a set...
Reconstruction and Visualization of Polyhedra Using Projections (2005)
Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. Three problems are considered in reconstruction of polygons and polyhedra, given a set...
A linear Algorithm for Compact Box-Drawings of Trees (2002)
Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
In a box-drawing of a tree each node is drawn by a rectangular box of prescribed size, no two boxes overlap each other, all boxes corresponding to siblings of the tree have the same x-coordinate at...