The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. - Muhammad Rashed Alam; M. Sohel Rahman (J. Discrete Algorithms, 2012)

A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem. - Muhammad Rashed Alam; M. Sohel Rahman (Inf. Process. Lett., 2013)

Computing the longest common almost-increasing subsequence. - Mohammad Tawhidul Hasan Bhuiyan; Muhammad Rashed Alam; M. Sohel Rahman (Theor. Comput. Sci., 2022)