# Masud Hasan

According to our database

Collaborative distances:

^{1}, 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

Discret. Appl. Math., 2017

2015

J. Discrete Algorithms, 2015

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

BMC Bioinform., 2014

2013

Inf. Process. Lett., 2013

Inf. Process. Lett., 2013

Int. J. Comput. Geom. Appl., 2013

Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics, 2013

2011

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

Int. J. Comput. Geom. Appl., 2011

Graphs Comb., 2011

CoRR, 2011

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

Math. Comput. Sci., 2010

J. Comput., 2010

Electron. Notes Discret. Math., 2010

CoRR, 2010

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

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

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

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

J. Discrete Algorithms, 2008

CoRR, 2008

CoRR, 2008

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

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

Networks, 2003

2002

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002