An in-place heapsort algorithm requiring nlogn+nlog*n-0.546871n comparisons. - Md. Mahbubul Hasan; Md. Shahjalal; M. Kaykobad (Int. J. Comput. Math., 2011)

On Palindromic Sequence Automata and Applications. - Md. Mahbubul Hasan; A. S. M. Sohidull Islam; M. Sohel Rahman; Ayon Sen (CIAA, 2013)

Order Preserving Prefix Tables. - Md. Mahbubul Hasan; A. S. M. Sohidull Islam; Mohammad Saifur Rahman 001; M. Sohel Rahman (SPIRE, 2014)

Computing a Longest Common Palindromic Subsequence. - Shihabur Rahman Chowdhury; Md. Mahbubul Hasan; Sumaiya Iqbal; M. Sohel Rahman (Fundam. Informaticae, 2014)

Order preserving pattern matching revisited. - Md. Mahbubul Hasan; A. S. M. Shohidull Islam; Mohammad Saifur Rahman 001; Mohammad Sohel Rahman (Pattern Recognit. Lett., 2015)

Palindromic Subsequence Automata and Longest Common Palindromic Subsequence. - Md. Mahbubul Hasan; A. S. M. Sohidull Islam; M. Sohel Rahman; Ayon Sen (Math. Comput. Sci., 2017)