Masud Hasan

According to our database1, Masud Hasan authored at least 39 papers between 2002 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Cutting out polygon collections with a saw.
Discret. Appl. Math., 2017

2015
Pancake flipping and sorting permutations.
J. Discrete Algorithms, 2015

On Collections of Polygons Cuttable with a Segment Saw.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Protein folding in HP model on hexagonal lattices with diagonals.
BMC Bioinform., 2014

2013
On fixed size projection of simplicial polyhedra.
Inf. Process. Lett., 2013

Prefix transpositions on binary and ternary strings.
Inf. Process. Lett., 2013

Cutting out Polygons with a Circular SAW.
Int. J. Comput. Geom. Appl., 2013

Extract and rank web communities.
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics, 2013

2011
Solving the generalized Subset Sum problem with a light based device.
Nat. Comput., 2011

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in <i>O</i>(<i>n</i> log <i>n</i>) Time.
J. Comput. Biol., 2011

Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices.
Int. J. Unconv. Comput., 2011

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections.
Int. J. Comput. Geom. Appl., 2011

Computing Nice Projections of Convex Polyhedra.
Int. J. Comput. Geom. Appl., 2011

Cutting a Convex Polyhedron Out of a Sphere.
Graphs Comb., 2011

Formulation and Development of a Novel Quaternary Algebra
CoRR, 2011

Efficient view point selection for silhouettes of convex polyhedra.
Comput. Geom., 2011

Some Basic Ternary Operations Using Toffoli Gates Along with the Cost of Implementation.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

2010
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems.
Math. Comput. Sci., 2010

Cutting a Cornered Convex Polygon Out of a Circle.
J. Comput., 2010

Pancake Flipping with Two Spatulas.
Electron. Notes Discret. Math., 2010

On the Design and Analysis of Quaternary Serial and Parallel Adders
CoRR, 2010

Some New Equiprojective Polyhedra
CoRR, 2010

On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Vindictive Voronoi Games and Stabbing Delaunay Circles.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

2009
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time
CoRR, 2009

Maximum Neighbour Voronoi Games.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

An Optical Solution for the Subset Sum Problem.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

Synthesis of GF(3) Based Reversible/Quantum Logic Circuits without Garbage Output.
Proceedings of the ISMVL 2009, 2009

2008
An approximation algorithm for sorting by reversals and transpositions.
J. Discrete Algorithms, 2008

Sorting by Prefix Reversals and Prefix Transpositions with Forward March
CoRR, 2008

Characterizing Graphs of Zonohedra
CoRR, 2008

Equiprojective polyhedra.
Comput. Geom., 2008

Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems.
Proceedings of the Ninth ACIS International Conference on Software Engineering, 2008

List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007
Approximation Algorithm for Sorting by Reversals and Transpositions.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Quantum Realization of Some Ternary Circuits Using Muthukrishnan-Stroud Gates.
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2003
A linear algorithm for compact box-drawings of trees.
Networks, 2003

2002
Searching for the center of a circle.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002


  Loading...