The SCEAS System
| |||||||

## Search the dblp DataBase
Masud Hasan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar
**Searching for the center of a circle.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:137-141 [Conf] - Masud Hasan, Anna Lubiw
**Equiprojective Polyhedra.**[Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:47-50 [Conf] - Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
**A linear algorithm for compact box-drawings of trees.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:154-157 [Conf] - Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz
**Efficient View Point Selection for Silhouettes of Convex Polyhedra.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:735-747 [Conf] - Atif Rahman, Swakkhar Shatabda, Masud Hasan
**Approximation Algorithm for Sorting by Reversals and Transpositions.**[Citation Graph (0, 0)][DBLP] WALCOM, 2007, pp:97-108 [Conf] - Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
**A linear algorithm for compact box-drawings of trees.**[Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:160-164 [Journal] **Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.**[Citation Graph (, )][DBLP]**Quantum Realization of Some Ternary Circuits Using Muthukrishnan-Stroud Gates.**[Citation Graph (, )][DBLP]**Synthesis of GF(3) Based Reversible/Quantum Logic Circuits without Garbage Output.**[Citation Graph (, )][DBLP]**Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems.**[Citation Graph (, )][DBLP]**Maximum Neighbour Voronoi Games.**[Citation Graph (, )][DBLP]**Computing Nice Projections of Convex Polyhedra.**[Citation Graph (, )][DBLP]**On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost.**[Citation Graph (, )][DBLP]**Cutting a Convex Polyhedron Out of a Sphere.**[Citation Graph (, )][DBLP]**The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in**[Citation Graph (, )][DBLP]*O*(*n*log*n*) Time.**List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity.**[Citation Graph (, )][DBLP]**Vindictive Voronoi Games and Stabbing Delaunay Circles.**[Citation Graph (, )][DBLP]**Equiprojective polyhedra.**[Citation Graph (, )][DBLP]**Characterizing Graphs of Zonohedra**[Citation Graph (, )][DBLP]**Sorting by Prefix Reversals and Prefix Transpositions with Forward March**[Citation Graph (, )][DBLP]**Cutting a Convex Polyhedron Out of a Sphere**[Citation Graph (, )][DBLP]**The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time**[Citation Graph (, )][DBLP]**An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence**[Citation Graph (, )][DBLP]
Search in 0.043secs, Finished in 0.044secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |