| 2025 | ICIP | Leveraging Complementary Attention Maps in Vision Transformers for OCT Image Analysis. | Haz Sameen Shahgir, Tanjeem Azwad Zaman, Khondker Salman Sayeed, Md. Asif Haider, Sheikh Saifur Rahman Jony, M. Sohel Rahman |
| 2023 | ICIP | Forward Diffusion Guided Reconstruction as a Multi-Modal Multi-Task Learning Scheme. | Najibul Haque Sarker, M. Sohel Rahman |
| 2022 | NAACL | BanglaBERT: Language Model Pretraining and Benchmarks for Low-Resource Language Understanding Evaluation in Bangla. | Abhik Bhattacharjee, Tahmid Hasan, Wasi Uddin Ahmad, Kazi Samin Mubasshir, Md Saiful Islam, Anindya Iqbal, M. Sohel Rahman, Rifat Shahriyar |
| 2022 | RECOMB | QT-GILD: Quartet Based Gene Tree Imputation Using Deep Learning Improves Phylogenomic Analyses Despite Missing Data. | Sazan Mahbub, Shashata Sawmya, Arpita Saha, Rezwana Reaz, M. Sohel Rahman, Md. Shamsuzzoha Bayzid |
| 2021 | ACL | XL-Sum: Large-Scale Multilingual Abstractive Summarization for 44 Languages. | Tahmid Hasan, Abhik Bhattacharjee, Md. Saiful Islam, Kazi Samin Mubasshir, Yuan-Fang Li, Yong-Bin Kang, M. Sohel Rahman, Rifat Shahriyar |
| 2020 | BIBE | A Multi-objective Metaheuristic Approach for Accurate Species Tree Estimation. | Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Sakshar Chakravarty, Mohammad Saifur Rahman, M. Sohel Rahman |
| 2020 | EMNLP | Not Low-Resource Anymore: Aligner Ensembling, Batch Filtering, and New Datasets for Bengali-English Machine Translation. | Tahmid Hasan, Abhik Bhattacharjee, Kazi Samin, Masum Hasan, Madhusudan Basak, M. Sohel Rahman, Rifat Shahriyar |
| 2019 | GECCO | A 'phylogeny-aware' multi-objective optimization approach for computing MSA. | Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Atif Hasan Rahman, Rifat Shahriyar, M. Sohel Rahman |
| 2019 | WALCOM | Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. | Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth |
| 2019 | WALCOM | A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). | Anik Sarker, Wing-Kin Sung, M. Sohel Rahman |
| 2018 | WALCOM | A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison. | Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman |
| 2018 | WALCOM | On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). | Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman |
| 2016 | WALCOM | Approximation Algorithms for Three Dimensional Protein Folding. | Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman |
| 2014 | SPIRE | Order Preserving Prefix Tables. | Md. Mahbubul Hasan, A. S. M. Sohidull Islam, Mohammad Saifur Rahman, M. Sohel Rahman |
| 2014 | WALCOM | Simple Linear Comparison of Strings in V-Order - (Extended Abstract). | Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth |
| 2013 | IWOCA | Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract). | A. S. M. Shohidull Islam, M. Sohel Rahman |
| 2012 | GECCO | Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data. | Jesun Sahariar Firoz, M. Sohel Rahman, Tanay Kumar Saha |
| 2012 | IWOCA | A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations. | Pritom Ahmed, A. S. M. Shohidull Islam, M. Sohel Rahman |
| 2012 | IWOCA | Computing a Longest Common Palindromic Subsequence. | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman |
| 2012 | WALCOM | Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract). | Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
| 2011 | COCOON | Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees. | Tanaeem M. Moosa, M. Sohel Rahman |
| 2010 | SPIRE | Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems. | Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman |
| 2010 | WALCOM | The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
| 2009 | WALCOM | Maximum Neighbour Voronoi Games. | Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman |
| 2008 | SOFSEM | A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. | Costas S. Iliopoulos, M. Sohel Rahman |
| 2008 | WALCOM | Indexing Circular Patterns. | Costas S. Iliopoulos, M. Sohel Rahman |
| 2007 | AAIM | A New Efficient Algorithm for Computing the Longest Common Subsequence. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | CPM | Algorithms for Computing the Longest Parameterized Common Subsequence. | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
| 2007 | MFCS | Finding Patterns in Given Intervals. | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman |
| 2007 | SOFSEM | Pattern Matching Algorithms with Don't Cares. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | SOFSEM | Indexing Factors with Gaps. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | WALCOM | Pattern Matching in Degenerate DNA/RNA Sequences. | M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard |
| 2006 | COCOON | Finding Patterns with Variable Length Gaps or Don't Cares. | M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth |
| 2006 | ISAAC | Algorithms for Computing Variants of the Longest Common Subsequence Problem. | M. Sohel Rahman, Costas S. Iliopoulos |