default search action
Masud Hasan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j19]Adrian Dumitrescu
, Anirban Ghosh
Cutting out polygon collections with a saw. Discret. Appl. Math. 228: 98-108 (2017) - 2015
- [j18]Masud Hasan, Atif Rahman, Md. Khaledur Rahman
Pancake flipping and sorting permutations. J. Discrete Algorithms 33: 139-149 (2015) - [c21]Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:
On Collections of Polygons Cuttable with a Segment Saw. CALDAM 2015: 58-68 - 2014
- [j17]Dipan Lal Shaw, A. S. M. Shohidull Islam, M. Sohel Rahman
Protein folding in HP model on hexagonal lattices with diagonals. BMC Bioinform. 15(S-2): S7 (2014) - 2013
- [j16]Adrian Dumitrescu, Masud Hasan:
Cutting out Polygons with a Circular SAW. Int. J. Comput. Geom. Appl. 23(2): 127-140 (2013) - [j15]Amit Kumar Dutta, Masud Hasan, M. Sohel Rahman
Prefix transpositions on binary and ternary strings. Inf. Process. Lett. 113(8): 265-270 (2013) - [j14]Masud Hasan:
On fixed size projection of simplicial polyhedra. Inf. Process. Lett. 113(22-24): 882-887 (2013) - [c20]Asif Salekin, Jeniya Tabassum, Binte Jafar, Masud Hasan:
Extract and rank web communities. WIMS 2013: 25 - 2011
- [j13]Therese 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
Cutting a Convex Polyhedron Out of a Sphere. Graphs Comb. 27(3): 307-319 (2011) - [j11]Muhammad Ashraful Alam, Masud Hasan:
Computing Nice Projections of Convex Polyhedra. Int. J. Comput. Geom. Appl. 21(1): 71-85 (2011) - [j10]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geom. 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. Int. J. Unconv. Comput. 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. J. Comput. Biol. 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. Nat. Comput. 10(1): 541-550 (2011) - [c19]Adrian Dumitrescu, Masud Hasan:
Cutting Out Polygons with a Circular Saw. ISAAC 2011: 230-239 - [c18]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 - [i7]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. Electron. Notes Discret. Math. 36: 231-238 (2010) - [j5]Syed Ishtiaque Ahmed
Cutting a Cornered Convex Polygon Out of a Circle. J. Comput. 5(1): 4-11 (2010) - [j4]Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Math. Comput. Sci. 3(4): 433-442 (2010) - [c17]Syed Ishtiaque Ahmed
Vindictive Voronoi Games and Stabbing Delaunay Circles. ISVD 2010: 124-131 - [c16]Syed Ishtiaque Ahmed
Cutting a Convex Polyhedron Out of a Sphere. WALCOM 2010: 94-101 - [c15]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 - [c14]Syed Ishtiaque Ahmed
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. WALCOM 2010: 252-262 - [i6]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) - [i5]Anindya Das, Ifat Jahangir, Masud Hasan:
On the Design and Analysis of Quaternary Serial and Parallel Adders. CoRR abs/1009.2622 (2010)
2000 – 2009
- 2009
- [c13]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 - [c12]Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman:
An Optical Solution for the Subset Sum Problem. IWNC 2009: 165-173 - [c11]Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman
Maximum Neighbour Voronoi Games. WALCOM 2009: 93-104 - [i4]Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam:
Cutting a Convex Polyhedron Out of a Sphere. CoRR abs/0907.4068 (2009) - [i3]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) - 2008
- [j3]Masud Hasan, Anna Lubiw:
Equiprojective polyhedra. Comput. Geom. 40(2): 148-155 (2008) - [j2]Atif Rahman, Swakkhar Shatabda
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]Muhammad Abdullah Adnan, Masud Hasan:
Characterizing Graphs of Zonohedra. CoRR abs/0811.0254 (2008) - [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 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 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
A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003) - [c3]Masud Hasan, Anna Lubiw:
Equiprojective Polyhedra. CCCG 2003: 47-50 - 2002
- [c2]Therese 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
Coauthor Index
aka: M. Sohel Rahman
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: