Dr. Masud Hasan (ডঃ মাসুদ হাসান) Professor Contact: Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka 1000, Bangladesh Telephone:Office: 880 2 861464044/6113 Cell: Residence: 880 2 861464044/7283 Email: masudhasan AT cse DOT buet DOT ac DOT bd, mhasan2010 AT gmail DOT com Homepage: http://teacher.buet.ac.bd/masudhasan Research Area:Algorithms and Theory Computer Architecture, Programming Languages and Compilers Bioinformatics and Computational Biology Bioinformatics and Computational Biology
Research Interest: Theory
Algorithms
Computational Geometry
Polyhedra Academic Background: Ph.D., 2005
University of Waterloo, Canada
M.Sc. in Computer Science and Engineering, 2001
Bangladesh University of Engineering and Technology
B.Sc. in Computer Science and Engineering, 1998
Bangladesh University of Engineering and Technology Selected Publications: 2008 and "to appear"
1. An Approximation Algorithm for Closest Phylogenetic Second Root problem, Swakkhar Shatabda, Atif Rahman, and Masud Hasan, accepted for IAENG International Conference on Bioinformatics (ICB'08), Hong Kong 1921 March 2008
2. Equiprojective Polyhedra, Masud Hasan and Anna Lubiw Computational Geometry: Theory and Applications, Elsevier, to appear
3. An approximation algorithm for sorting by reversals and transpositions, Atif Rahman, Swakkhar Shatabda, and Masud Hasan, accepted for Journal of Discrete Algorithms, Elsevier, to appear
4. List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity, Maruf Ahmed and Masud Hasan, in Proc. 9th International Conference on Distributed Computing and Networking, ICDCN 2008, Lecture Notes Computer Science, Vol. 4904 Springer, January 58, 2008, Kolkatta, India
5. Computing nice projections of convex polyhedra, Md. Ashraful Alam and Masud Hasan, in Proc. Workshop on Algorithms and Computations (WALCOM
2008), Lecture Notes Computer Science, Vol 4921, Springer, Dhaka, February 78, 2008
2007
1. Reconstructing polygons and polyhedra from edge and face counts in orthogonal projections, Therese C. Biedl, Masud Hasan, and Alejandro LÏŒpezOrtiz, accepted for FSTTCS 2007, Lecture Notes Computer Science, Vol. 4855 Springer, New Delhi, India 1214 Dec, 2007
2. Quantum Realization of Some Ternary Circuits Using MuthukrishnanStroud Gates, Asif I. Khan, Nadia Nusrat, Samira M. Khan, Masud Hasan, and
Mozammel H. A. Khan, in Proceedings of the 37th IEEE International Symposium on MultipleValued Logic, Oslo, May 1315, 2007, pp. 2025
3. An approximation algorithm for sorting by reversals and transpositions, Atif Rahman, Swakkhar Shatabda, and Masud Hasan, in Proceedings of Workshop on Algorithm and Computation (WALCOM 2007), Dhaka 2006, pp. 97108
2006
1. Some New Equiprojective Polyhedra, Nabila Rahman, Saad Altaful Quader, and Masud Hasan, in Proc. ICCIT, Dhaka, 2123rd December 2006
2. Novel Realization of Some Ternary Circuits for Quantum Computing, Asif Khan, Nadia Nusrat, Samira Manabi Khan, and Masud Hasan, accepted for IEEE
TENCON 2006, to be held on November 1417, 2006, Hong Kong.
3. Novel Realization of Quantum Ternary Mux and Demux, Asif Khan, Nadia Nusrat, Samira Manabi Khan, and Masud Hasan, in Proc. ICECE, December 2006, Dhaka.
4. eGovernment Procurement of Bangladesh, Abu Sayed Md. Latiful Haque, Muhammad Tanvir Parvez, Masud Hasan, Gahangir Hossain, and Muhammad Aminur Rahman Shah, in Proceedings of the National Seminar, Golden Jubilee Convention of Institute of Engineers, Dhaka, Bangladesh, pp. 7580, February, 2006.
5. eGovernment Procurement of Developing Countries, Abu Sayed Md. Latiful Haque, Muhammad Tanvir Parvez, Masud Hasan, Gahangir Hossain, and
Muhammad Aminur Rahman Shah, in Proc. International Conference on Information and Communication Technology for the Muslim World, 2123 November 2006, Kuala Lumpur, Malaysia (accepted).
2004
1. Efficient viewpoint selection for silhouettes of convex polyhedra, Therese Biedl, Masud Hasan, Alex LOrtiz, 29th International Conference on
Mathematical Foundation of Computer Science (MFCS), pp. 735747, LNCS Vol. 3153, Czech Republic, August, 2004
2003
1. Equiprojective Polyhedra, with Anna Lubiw, 15th Canadian Conference on Computational Geometry (CCCG), Halifax, Nova Scotia, pp. 4750, August 2003. [Almost same as the journal version above]
2. A Linear Algorithm for Compact Boxdrawing of Trees, Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, Networks 42(3), pp. 160164, 2003
2002
1. Searching for the Center of a Circle, Therese Biedl, Masud Hasan, Joe Horton, Alex LÏŒpezOrtiz, and Tomas Vinar, 14th Canadian Conference on Computational Geometry (CCCG), Lethbridge, Alberta, pp. 137141, August 2002.
2. A Linear Algorithm for Compact Boxdrawing of Trees, Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, 14th Canadian Conference on Computational Geometry (CCCG), Lethbridge, Alberta, pp. 154157, August 2002.
2001 and earlier
1. A linear Algorithm for Finding Visibility Graphs of Trees, Masud Hasan, and Md. Saidur Rahman, in Proceedings of International Conference on Electrical
and Computer Engineering, pp. 287289, 56 January, 2001, Dhaka, Bangladesh.
2. An Efficient Line Drawing Algorithm, with Md. Abul Kashem, in Proceedings of International Conference on Computer and Information Technology, pp.
204207, 35 December, 1999, Sylhet, Bangladesh.
3. Dynamic Programming based 2Dimensional Warping Algorithm for Handwritten Bangla Character Recognition, Masud Hasan, Md. Meftauddin, and
Muhammad Masroor Ali, in Proceedings of National Conference on Computer and Information Technology, 1997, Dhaka, Bangladesh.
4. Dynamic Programming based 2Dimensional Warping Algorithm for Bangla Character Recognition, Md. Meftauddin, Masud Hasan, and Muhammad Masroor Ali, in Proceedings of International Conference on Computer and Information Technology, pp.153156, 1820 December, 1998, Dhaka, Bangladesh.
Journal Papers:
15. Masud Hasan, Atif Hasan Rahman, Md. Khaledur Rahman, M. Sohel Rahman, Mahfuza Sharmin, and Rukhsana Yeasmin, Pancake flipping and sorting permutations. Journal of Discrete Algorithms, Elsevier, 33:139149, 2015 
14. Dipan Shaw, A. S. Islam, M. Sohel Rahman, and Masud Hasan, Protein folding in HP model on hexagonal lattices with diagonals. BMC Bioinformatics, BMC, 15(S2), :S7, 2014 
13. Amit Kumar Dutta, Masud Hasan, and M. Sohel Rahman, Prefix transpositions on binary and ternary strings. Information Processing Letters, 113(8), :265270, 2013 
12. J.S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time. Journal of Computational Biology, Mary Ann Liebert, Inc. publishers, USA, 18(8), :10071011, 2011 
11. S.I. Ahmed, Masud Hasan, and M.A. Islam, Cutting a Convex Polyhedron out of a Sphere. Graphs and Combinatorics, Springer, 27(3), :307319, 2011 
10. T.C. Biedl,, Masud Hasan, and A. LopezOrtiz, Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections. International Journal of Computational Geometry and Applications, World Scientific, 22(2), :215239, 2011 
9. T.C. Biedl, Masud Hasan, and Alejandro LopezOrtiz, Efficient viewpoint selection for silhouettes of convex polyhedra. Comutational Geometry: Theory and Application, Elsevier, 44(8), :399408, 2011 
8. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices. Int. Journ. of Unconventional Computing, 7(12), :125140, 2011 
7. S.I. Ahmed, M.A. Islam, and Masud Hasan, Cutting a cornered convex polygon out of a circle. Journal of Computers, Academy Publisher, 5(1), :411, 2010 
6. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving the Generalized Subset Sum Problem with a Light Based Device. Natural Computing, 10(1), :541550, 2010 
5. S.I. Ahmed, Masud Hasan, and M.A. Islam, Cutting a Convex Polygon Out of a Circle. International Journal of Recent Trends in Engineering, Academy Publisher, 2(1), :8892, 2009 
4. S Shatabda, and Masud Hasan, An approximation algorithm for sorting by reversals and transpositions. Journal of Discrete Algorithms, Elsevier, 6(3), :449457, 2008 
3. Masud Hasan, and A Lubiw, Equiprojective polyhedra. Computational Geometry: Theory and Applications, Elsevier, 40(2), :148155, 2008 
2. Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, A linear algorithm for compact boxdrawing of trees. Networks, Wiley, 42(3), :160163, 2003 
1. Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Mathematics in Computer Science (MCS), 3(4), :433442, 
Conference Papers:
33. Mohiuddin Abdul Qader, S. Rahman, and Masud Hasan, Structured Web Search in Small Domain. In Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2013 
32. A. Biswas, S. Chowdhury, M.M.M. Khan, Masud Hasan, and A.I. Khan, Some Basic Ternary Operations Using Toffoli Gates along with the Cost of Implementation. In Proceedings of IEEE International Symposium on MultiValued Logic, Tusula, Finland, 2011 
31. A. Dumitrescu, and Masud Hasan, Cutting Out Polygons with a Circular Saw. In Proceedings of In Proc. 22nd International Symposium on Algorithms and Computation, LNCS,Springer, Yokohama, Japan., pages 230239, 2011 
30. A. Das, I. Jahangir, Masud Hasan, and S. Hossain, On the design and analysis of quaternary serial and parallel adders. In Proceedings of IEEE TENCON, Fukuoka, Japan, pages 16911695, 2010 
29. Masud Hasan, Non)Equiprojectivity and (Non)Biprojectivity of Simplicial Polyhedra. In Proceedings of 20th Annual Fall Workshop on Computational Geometry (FWCG 2010),, Stony Brook, NY, USA,, 2010 
28. S.I. Ahmed, Masud Hasan, and A. Sopan, Vindictive Voronoi games and stabbing Delaunay circles. In Proceedings of International Symposium on Voronoi Diagram in Science and Engineering, Quebec City, Canada, pages 124131, 2010 
27. M.R Islam, M. Sohel Rahman, Masud Hasan, and M.M. Hasan, IMIPS: An improved pipelined processor architecture with reduced branch penalty and single memory for instruction and data. In Proceedings of International International Conference on Computer Engineering and Applications (, Bali Island, Indonesia, 2010 
26. Chowdhury Sayeed Hyder, A. Rahman, and Masud Hasan, On the Longest Vulnerable Path inside a Sensor Network from Boundary Regions. In Proceedings of IEEE GCC Conference & Exhibition, Kuwait City, Kuwait, 2010 
25. Masud Hasan, S. Hossain, and M.M.M. Rahman, Solving the minimum hitting set problem with a lightbased device. In Proceedings of International Conference on Electrical and Computer (ICECE), Dhaka,Bangladesh, pages 423426, 2010 
24. M. A. Wahid, M. Kaykobad, and Masud Hasan, Kinetisation of view of 3D point set. In Proceedings of International Conference on Computer and Information Technology (ICCIT), Dhaka,Bangladesh, pages 325330, 2010 
23. A. Das, I. Jahangir, and Masud Hasan, Design of quaternary serial and parallel adders. In Proceedings of 13th International Conference on Electrical and Computer (ICECE), Dhaka,Bangladesh, pages 466469, 2010 
22. J. S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Conference. In Proceedings of WALCOM, 2010 
21. M. R. Hasan, M. Sohel Rahman, Masud Hasan, M. M. Hasan, and M. A. Ali, An Improved Pipelined Processor Architecture Eliminating Branch and Jump Penalty. In Proceedings of Second International Conference on Computer Engineering and Applications, pages 621625, 2010 
20. Mahfuza Sharmin, R. Yeasmin, Masud Hasan, A. Rahman, and M. Sohel Rahman, Pancake Flipping with Two Spatulas. In Proceedings of ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics, pages 231238, 2010 
19. M. Crochemore, Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Two dimensional Range Minimum/Maximum Query revisited. In Proceedings of 13th International Conference on Computer and Information Technology (ICCIT), pages 27  32, 2010 
18. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem with a LightBased Device. In Proceedings of International Conference on Electrical and Computer Engineering (ICECE), pages 423  426, 2010 
17. M.M.M. Khan, A.K. Biswas, S. Chowdhury, Masud Hasan, and A.I. Khan, Synthesis of GF(3) based ternary reversible/quantum logic circuits without ancillary qutrits. In Proceedings of International Symposium on MultiValued Logic 2009, Okinawa, Japan, 2009 
16. Atif Rahman, Mahmuda Naznin, and Masud Hasan, Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications. In Proceedings of International Conference on Electronics and Computer Technology, IEEE, Macau, China, pages 215218, 2009 
15. M. M. Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum Neighbour Voronoi Games. In Proceedings of WALCOM, pages 93104, 2009 
14. Masud Hasan, S. Hossain, M. M. Rahman, and M. Sohel Rahman, An Optical Solution for the Subset Sum Problem. In Proceedings of the Fourth International Workshop on Natural Computing (IWNC), pages 165173, 2009 
13. Chowdhury Sayeed Hyder, A. Rahman, and Masud Hasan, On the Longest Vulnerable Path inside Sensor Network from Boundary Regions. In Proceedings of 5th IEEEGCC Conference, Kuwait City, Kuwait, 2009 
12. Masud Hasan, M.M. Hossain, S. Nusrat, and A. LopezOrtiz, Smallest and some new equiprojective polyhedra. In Proceedings of International Conference on Computer and Information Technology, Khulna, Bangladesh,, 2008 
11. M. Ahmed, S.M.H Chowdhury, and Masud Hasan, Fast preemptive task scheduling algorithm for homogeneous and heterogeneous distributed memory systems. In Proceedings of ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, Phuket, Thailand, 2008 
10. Md. Muhibur Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum neighbor Voronoi games. In Proceedings of Annual Workshop on Algorithms and Computation (WALCOM 2009), LNCS, Kolkata, India, 2008 
9. Md. Ashraful Alam, and Masud Hasan, Computing Nice Projections of Convex Polyhedra. In Proceedings of Workshop on Algorithms and Computation 2008 (WALCOM 2008), LNCS (Vol 4921 ), Dhaka, pages 111119, 2008 
8. M. Ahmed, S.M.H Chowdhury, and Masud Hasan, List heuristic scheduling algorithms for distributed memory systems with improved time complexity. In Proceedings of International Conference on Distributed Computing and Networking, Springer, Kolkata, India, 2008 
7. A Khan, N. Shahriar, S.M. Khan, and Masud Hasan, Novel realization of quantum ternary mux and demux. In Proceedings of . International Conference on Electrical and Compute Engineering, Dhaka, Bangladesh, 2006 
6. Abu Sayed Md. Latiful Hoque, M.T parvez, and Masud Hasan, eGovernment Procurement of Developing Countries. In Proceedings of International Conference on Information and Communication Technology, Kuala Lumpur, Malaysia, 2006 
5. A. Khan, N. Nusrat, S.M. Khan, and Masud Hasan, Novel realization of some ternary circuits for quantum computing. In Proceedings of IEEE TENCON, Hong Kong, 2006 
4. Abu Sayed Md. Latiful Hoque, Masud Hasan, M. T. Parvez, and G. Hossain, eGovernment Procurement of Bangladesh: Problems and Prospects. In Proceedings of Proceedings of the National Seminar on Good Governance and Engineering, Golden Jubilee Convention, The Institution of Engineers, Dhaka, 2006 
3. Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, A linear algorithm for compact boxdrawings of trees. In Proceedings of 14th Canadian Conference on Computational Geometry (CCCG 2002), pages 154157, 2002 
2. Masud Hasan, and Md. Saidur Rahman, A linear algorithm for finding visibility graph of trees. In Proceedings of International Conference on Electrical and Computer Engineering (ICECE 2001),, pages 287289, 2001 
1. Masud Hasan, On Finding a Better Position of a Convex Polygon inside a Circle to Minimize the Cutting Cost. 
