The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masud Hasan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Masud Hasan, Anna Lubiw
    Equiprojective Polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:47-50 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]

  7. Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. [Citation Graph (, )][DBLP]


  8. Quantum Realization of Some Ternary Circuits Using Muthukrishnan-Stroud Gates. [Citation Graph (, )][DBLP]


  9. Synthesis of GF(3) Based Reversible/Quantum Logic Circuits without Garbage Output. [Citation Graph (, )][DBLP]


  10. Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems. [Citation Graph (, )][DBLP]


  11. Maximum Neighbour Voronoi Games. [Citation Graph (, )][DBLP]


  12. Computing Nice Projections of Convex Polyhedra. [Citation Graph (, )][DBLP]


  13. On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. [Citation Graph (, )][DBLP]


  14. Cutting a Convex Polyhedron Out of a Sphere. [Citation Graph (, )][DBLP]


  15. The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. [Citation Graph (, )][DBLP]


  16. List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity. [Citation Graph (, )][DBLP]


  17. Vindictive Voronoi Games and Stabbing Delaunay Circles. [Citation Graph (, )][DBLP]


  18. Equiprojective polyhedra. [Citation Graph (, )][DBLP]


  19. Characterizing Graphs of Zonohedra [Citation Graph (, )][DBLP]


  20. Sorting by Prefix Reversals and Prefix Transpositions with Forward March [Citation Graph (, )][DBLP]


  21. Cutting a Convex Polyhedron Out of a Sphere [Citation Graph (, )][DBLP]


  22. The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time [Citation Graph (, )][DBLP]


  23. An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002