- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j14 |      | Amit Kumar Dutta, Masud Hasan, M. Sohel Rahman: Prefix transpositions on binary and ternary strings. Inf. Process. Lett. 113(8): 265-270 (2013) |
| 2011 | ||
| j13 | | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Efficient view point selection for silhouettes of convex polyhedra. Comput. Geom. 44(8): 399-408 (2011) |
| j12 | | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam: Cutting a Convex Polyhedron Out of a Sphere. Graphs and Combinatorics 27(3): 307-319 (2011) |
| j11 | | Md. Ashraful Alam, Masud Hasan: Computing Nice Projections of Convex Polyhedra. Int. J. Comput. Geometry Appl. 21(1): 71-85 (2011) |
| j10 | | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geometry Appl. 21(2): 215-239 (2011) |
| j9 | | Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman: Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices. IJUC 7(1-2): 125-140 (2011) |
| j8 | | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman: The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time. Journal of Computational Biology 18(8): 1007-1011 (2011) |
| j7 | | Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman: Solving the generalized Subset Sum problem with a light based device. Natural Computing 10(1): 541-550 (2011) |
| c18 | | |
| c17 | | Ayan Kumar Biswas, Shuvro Chowdhury, Md. Mahmud Muntakim Khan, Masud Hasan, Asif Islam Khan: Some Basic Ternary Operations Using Toffoli Gates Along with the Cost of Implementation. ISMVL 2011: 142-146 |
| i8 | | Ifat Jahangir, Anindya Das, Masud Hasan: Formulation and Development of a Novel Quaternary Algebra. CoRR abs/1108.5497 (2011) |
| 2010 | ||
| j6 | | Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, Mohammad Sohel Rahman: Pancake Flipping with Two Spatulas. Electronic Notes in Discrete Mathematics 36: 231-238 (2010) |
| j5 | | Syed Ishtiaque Ahmed, Md. Ariful Islam, Masud Hasan: Cutting a Cornered Convex Polygon Out of a Circle. JCP 5(1): 4-11 (2010) |
| j4 | | Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman: Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Mathematics in Computer Science 3(4): 433-442 (2010) |
| c16 | | Syed Ishtiaque Ahmed, Masud Hasan, Awalin Sopan: Vindictive Voronoi Games and Stabbing Delaunay Circles. ISVD 2010: 124-131 |
| c15 | | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam: Cutting a Convex Polyhedron Out of a Sphere. WALCOM 2010: 94-101 |
| c14 | | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman: The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. WALCOM 2010: 161-166 |
| c13 | | Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan: On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. WALCOM 2010: 252-262 |
| i7 | | Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz, Sabrina Nusrat, Saad Altaful Quader, Nabila Rahman: Some New Equiprojective Polyhedra. CoRR abs/1009.2252 (2010) |
| i6 | | Anindya Das, Ifat Jahangir, Masud Hasan: On the Design and Analysis of Quaternary Serial and Parallel Adders. CoRR abs/1009.2622 (2010) |
| 2009 | ||
| c12 | | Md. Mahmud Muntakim Khan, Ayan Kumar Biswas, Shuvro Chowdhury, Masud Hasan, Asif Islam Khan: Synthesis of GF(3) Based Reversible/Quantum Logic Circuits without Garbage Output. ISMVL 2009: 98-102 |
| c11 | | Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman: Maximum Neighbour Voronoi Games. WALCOM 2009: 93-104 |
| i5 | | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam: Cutting a Convex Polyhedron Out of a Sphere. CoRR abs/0907.4068 (2009) |
| i4 | | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman: The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time. CoRR abs/0910.3292 (2009) |
| i3 | | Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal, M. Sohel Rahman: An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence. CoRR abs/0911.5031 (2009) |
| 2008 | ||
| j3 | | |
| j2 | | Atif Rahman, Swakkhar Shatabda, Masud Hasan: An approximation algorithm for sorting by reversals and transpositions. J. Discrete Algorithms 6(3): 449-457 (2008) |
| c10 | | Maruf Ahmed, Sharif M. H. Chowdhury, Masud Hasan: List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity. ICDCN 2008: 257-262 |
| c9 | | Maruf Ahmed, Sharif M. H. Chowdhury, Masud Hasan: Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems. SNPD 2008: 720-725 |
| c8 | | Muhammad Ashraful Alam, Masud Hasan: Computing Nice Projections of Convex Polyhedra. WALCOM 2008: 111-119 |
| i2 | | |
| i1 | | Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan: Sorting by Prefix Reversals and Prefix Transpositions with Forward March. CoRR abs/0812.3933 (2008) |
| 2007 | ||
| c7 | | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. FSTTCS 2007: 400-411 |
| c6 | | Asif Islam Khan, Nadia Nusrat, Samira Manabi Khan, Masud Hasan, Mozammel H. A. Khan: Quantum Realization of Some Ternary Circuits Using Muthukrishnan-Stroud Gates. ISMVL 2007: 20 |
| c5 |  | Atif Rahman, Swakkhar Shatabda, Masud Hasan: Approximation Algorithm for Sorting by Reversals and Transpositions. WALCOM 2007: 97-108 |
| 2004 | ||
| c4 | | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS 2004: 735-747 |
| 2003 | ||
| j1 | | Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003) |
| c3 | | |
| 2002 | ||
| c2 | | Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar: Searching for the center of a circle. CCCG 2002: 137-141 |
| c1 | | Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. CCCG 2002: 154-157 |
Colors in the list of coauthors
Last update Fri May 24 10:24:02 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page