M. Sohel Rahman, Ph.D., Senior Member, ACM & IEEE
Professor
Department of Computer Science & Engineering
Bangladesh University of Engineering & Technology (BUET)
ECE Building, West Palasi, Dhaka-1205, Bangladesh
msrahman@cse.buet.ac.bd, sohel.kcl@gmail.com
http://msrahman.buet.ac.bd/
Nationality: Bangladesh


Brief Highlights



Education
Work History
Research Interest
String and sequence algorithms, Bioinformatics, Metaheuristics, Big data, Hard computational interdisciplinary problems, Musicolgy, Design and analysis of Algorithms (Sequential, Parallel, Distributed), Theoretical Computer Science with applications, Networks, Multimedia Technology, Natural Computing.
Editorial Activities

Programme Committee Membership

Awards and Honours (after college)
Professional Membership
Professional Activities (Selected)
Post-Publications Reviews:
Grants/Proposals Reviewer:
Research and Development Projects Selected Talks and Presentations:
Short Research Visits
Consultancy 1


Publications



Edited Books

  1. M. Sohel Rahman, Wing-Kin Sung and Ryuhei UEHARA (ed.). WALCOM: Algorithms and Computation - 12th International Workshop, WALCOM 2018, Dhaka, Bangladesh, March 03-05, 2018. Proceedings. Lecture Notes in Computer Science 10755, Springer (2018).
  2. M. Sohel Rahman, Etsuji Tomita (ed.). Special Issue on WALCOM 2015. J. Graph Algorithms Appl. 20(1): 1-2 (2016).
  3. M. Sohel Rahman, Etsuji Tomita (ed.). Special Issue on WALCOM 2015. J. Discrete Algorithms 36: 1-2 (2016).
  4. M. Sohel Rahman, Etsuji Tomita (ed.). WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings. Lecture Notes in Computer Science 8973, Springer (2015).
  5. Joseph Wun-Tat Chan, Jackie Daykin and M. Sohel Rahman (ed.). A Special Issue to Celebrate the 60th birthday of Prof. Maxime Crochemore. Texts in Algorithmics, Volume 11, King's College, London.
  6. Ryszard Janicki, Simon Puglisi and M. Sohel Rahman (ed.). A Special Issue Dedicated to StringMasters at McMaster Workshops. Fundamenta Informaticae 97(3) (2009).
Book Chapters

  1. Costas Iliopoulos, Solon Pissis and M. Sohel Rahman. Searching and Indexing Circular Patterns. In Mourad Elloumi Editors, Algorithms for Next-Generations Sequencing Data: Techniques, Approaches and Applications. Chapter 3, Springer, 2017.
  2. Masud Hasan and M. Sohel Rahman. Advances in Genome Rearrangements Algorithms. In Mourad Elloumi and Albert Y. Zomaya Editors, Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. pp. 749-772, Wiley, 2010.
Refereed Journals (86)

  1. Md. Zahangir Alam, M. Saifur Rahman and M. Sohel Rahman: A Random Forest based Predictor for medical data classification using Feature Ranking. Informatics in Medicine Unlocked, To Appear.
  2. Kazi Ashik Islam, Ibraheem Muhammad Moosa, Jaiaid Mobin, Muhammad Ali Nayeem and M. Sohel Rahman: A heuristic aided Stochastic Beam Search algorithm for solving the transit network design problem. Swarm and Evolutionary Computation 46 (2019), 6-15.
  3. Md. Lisul Islam, Swakkhar Shatabda, Mahmood A. Rashid, M.G.M. Khan and M. Sohel Rahman: Protein structure prediction from inaccurate and sparse NMR data using an enhanced genetic algorithm. Computational Biology and Chemistry 79 (2019) 6-15.
  4. M. Saifur Rahman, Md. Khaledur Rahman, Sanjay Saha, M. Kaykobad and M. Sohel Rahman: Antigenic: An improved prediction model of protective antigens. Artificial Intelligence in Medicine 94 (2019), 28-41.
  5. Nabil Ibtehaz, M. Saifur Rahman and M. Sohel Rahman: VFPred: A fusion of signal processing and machine learning techniques in detecting ventricular fibrillation from ECG signals. Biomedical Signal Processing and Control, 49 (2019) 349-359.
  6. Dipan Shaw, Shuvasish Karmaker, A. S. M. Shohidull Islam, M. Sohel Rahman: Approximation Algorithms for Three Dimensional Protein Folding. Fundamenta Informaticae 161 (2018) 1–19.
  7. M. Saifur Rahman, Swakkhar Shatabda, Sanjay Saha, M. Kaykobad and M. Sohel Rahman:DPP-PseAAC: A DNA-binding protein prediction model using Chou's general PseAAC. Journal of Theoretical Biology 452: 22-34 (2018) (2016 Impact Factor: 2.113).
  8. Ch. Md. Rakin Haider, Anindya Iqbal, Atif Hasan Rahman and M. Sohel Rahman. An ensemble learning based approach for impression fraud detection in mobile advertising. Journal of Network and Computer Applications 112: 126-141 (2018) (2016 Impact Factor: 3.5).
  9. Sumit Tarafder, Md. Toukir Ahmed, Sumaiya Iqbal, Md. Tamjidul Hoque and M. Sohel Rahman. RBSURFpred: Modeling Protein Accessible Surface Area in Real and Binary Space using Regularized and Optimized Regression. Journal of Theoretical Biology 441: 44-57 (2018) (2016 Impact Factor: 2.113).
  10. M. Saifur Rahman, Md. Yusuf Sarwar Uddin, Tahmid Hasan, M. Sohel Rahman, and M. Kaykobad: Using Adaptive Heartbeat Rate on Long-lived TCP Connections. ACM/IEEE Transactions on Networking 26(1) 203-216 (2018) (2016 Impact Factor: 2.186)
  11. Farshid Rayhan, Sajid Ahmed, Swakkhar Shatabda, Dewan Md Farid, Zaynab Mousavian, Abdollah Dehzangi and M. Sohel Rahman. iDTI-ESBoost: Identification of Drug Target Interaction Using Evolutionary and Structural Features with Boosting. Scientific Reports 7:17731 (2017) https://doi.org/10.1038/s41598-017-18025-2 (2016 Impact Factor: 4.259).
  12. M. Saifur Rahman, Md. Khaledur Rahman, M. Kaykobad and M. Sohel Rahman: isGPT: An optimized model to identify sub-Golgi protein types using SVM and random forest based feature selection. Artificial Intelligence in Medicine 84: 90-100 (2018) https://doi.org/10.1016/j.artmed.2017.11.003 (2016 Impact Factor: 2.806).
  13. Md. Khaledur Rahman and M. Sohel Rahman: CRISPRpred: A flexible and efficient tool for sgRNAs on-target activity prediction in CRISPR/Cas9 systems, PLoS ONE 12(8): e0181943 (2017) https://doi.org/10.1371/journal.pone.0181943 (2016 Impact Factor: 2.806).
  14. Md. Zahangir Alam, S. M. Niaz Arifin, Hasan Mohammad Al-Amin, Mohammad Shafiul Alam and M. Sohel Rahman: A spatial agent-based model of Anopheles vagus for malaria epidemiology: examining the impact of vector control interventions. Malaria Journal 16:432 (2017) https://doi.org/10.1186/s12936-017-2075-6 (2016 Impact Factor: 2.715)
  15. Md Mahfuzer Rahman, Ratul Sharker, Sajib Biswas, and M. Sohel Rahman: HaVec: An Efficient de Bruijn Graph Construction Algorithm for Genome Assembly, International Journal of Genomics 2017: 6120980, (2017). doi:10.1155/2017/6120980 (2016 Impact Factor: 2.402)
  16. S.M. Ferdous and M. Sohel Rahman: Solving the Minimum Common String Partition Problem with the Help of Ants, Math. Comput. Sci. (2017) 11(2):233–249 https://doi.org/10.1007/s11786-017-0293-5
  17. Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen: Palindromic Subsequence Automata and Longest Common Palindromic Subsequence, Math. Comput. Sci. (2017) 11(2):219–232.
  18. S. M. Farhad, Muhammad Ali Nayeem, Md. Khaledur Rahman, M. Sohel Rahman: Mapping stream programs onto multicore platforms by local search and genetic algorithm. Computer Languages, Systems & Structures 46: 182-205 (2016)(2015 Impact Factor: 0.556; Source Normalized Impact Factor by Elsevier: 0.944)
  19. Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth: V-Order: New combinatorial properties & a simple comparison algorithm. Discrete Applied Mathematics 215: 41-46 (2016) (2015 Impact Factor: 0.722; Source Normalized Impact Factor by Elsevier: 1.185) https://doi.org/10.1016/j.dam.2016.07.006
  20. Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth: Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables. Journal of Automata, Languages and Combinatorics 21(3): 131-147 (2016) https://doi.org/10.25596/jalc-2016-131
  21. Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman: Algorithms for Longest Common Abelian Factors. Int. J. Found. Comput. Sci. 27(5): 529-544 (2016) (2015 Impact Factor 0.467). https://doi.org/10.1142/S0129054116500143
  22. Fatema Tuz Zohora, M. Sohel Rahman: An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications. Theor. Comput. Sci. 656: 188-214 (2016)(2015 Impact Factor: 0.643; Source Normalized Impact Factor by Elsevier: 1.345).
  23. Johra Muhammad Moosa, Rameen Shakur, Mohammad Kaykobad, and M. Sohel Rahman: Gene selection for cancer classification with the help of bees, BMC Medical Genomics, 2016 9(Suppl 2):47 DOI: 10.1186/s12920-016-0204-7 (2015 Impact Factor: 2.726).
  24. Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman: A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching, IEEE Transactions on Nanobioscience, Vol. 15, No. 2, pages 93-100, MARCH 2016 (2015 Impact Factor: 1.969).
  25. Ali Alatabbi, M. Sohel Rahman, W.F. Smyth: Computing Covers Using Prefix Tables. Discrete Applied Mathematics, 212 (2016) 2-9 (doi:10.1016/j.dam.2015.05.019) (2015 Impact Factor: 0.722; Source Normalized Impact Factor by Elsevier: 1.185).
  26. Mohammad Saifur Rahman, Ali Alatabbi, Tanver Athar, Maxime Crochemore, and M. Sohel Rahman. Absent words and the (dis) similarity analysis of DNA sequences: an experimental study. BMC research notes 9, no. 1 (2016): 1.
  27. Rezaul Karim, Mohd. Momin Al Aziz, Swakkhar Shatabda, M. Sohel Rahman, Md. Abul Kashem Mia, Farhana Zaman & Salman Rakin: CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein Tertiary Structure Retrieval, Scientific Reports 5, Article number: 13275 (2015) doi:10.1038/srep13275 (2015 Impact Factor: 5.228).
  28. Ahammed Ullah, Nasif Ahmed, Subrata Dey Pappu, Swakkhar Shatabda, A. Z. M. Dayem Ullah, M. Sohel Rahman: Efficient conformational space exploration in ab initio protein folding simulation, R. Soc. open sci. 2: 150238. http://dx.doi.org/10.1098/rsos.150238.
  29. Sumaiya Iqbal, M. Kaykobad, M. Sohel Rahman: Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm and Evolutionary Computation 24: 50-64 (2015) (2015 Impact Factor: 2.963; Source Normalized Impact Factor by Elsevier: 2.705).
  30. Md. Kishwar Shafin, Kazi Lutful Kabir, Iffatur Ridwan, Tasmiah Tamzid Anannya, Rashid Saadman Karim, Mohammad Mozammel Hoque and M. Sohel Rahman: Impact of Heuristics in Clustering Large Biological Networks. Computational Biology and Chemistry, 59 (2015) 28-36 (2015 Impact Factor: 1.014).
  31. S.M. Ferdous and M. Sohel Rahman: An Integer Programming Formulation of the Minimum Common String Partition Problem, PLoS ONE 10(7): e0130266 (2015) (2015 Impact Factor: 3.234).
  32. Masud Hasan, Atif Rahman, Md. Khaledur Rahman, M. Sohel Rahman, Mahfuza Sharmin and Rukhsana Yeasmin. Pancake flipping and sorting permutations. J. Discrete Algorithms 33: 139-149 (2015) (Source Normalized Impact Factor by Elsevier: 1.229).
  33. Md. Khaledur Rahmana and M. Sohel Rahman. Prefix and suffix transreversals on binary and ternary strings. J. Discrete Algorithms 33: 160-170 (2015) (Source Normalized Impact Factor by Elsevier: 1.229).
  34. Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman: SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching, International Journal of Genomics, vol. 2015, Article ID 259320 (2015) (2015 Impact Factor 1.830).
  35. Fatema Tuz Zohora and M. Sohel Rahman: Application of Consensus String Matching in the Diagnosis of Allelic Heterogeneity Involving Transposition Mutation. International Journal of Data Mining and Bioinformatics, Inderscience Publishers, 13(4):360-377 (2015) (Impact Factor: 0.528)
  36. S. M. Niaz Arifin, Rumana Reaz Arifin, Dilkushi de Alwis Pitts, M. Sohel Rahman, Sara Nowreen, Gregory R. Madey and Frank H. Collins: Landscape Epidemiology Modeling Using an Agent-Based Model and a Geographic Information System. Land 2015, 4(2), 378-412; doi:10.3390/land4020378
  37. Ali Alatabbi, M. Sohel Rahman, W.F. Smyth: Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms Volume 32, Pages 6-13 (2015) (Source Normalized Impact Factor by Elsevier: 1.229).
  38. Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth: Simple Linear Comparison of Strings in V-order. Fundam. Inform. 139(2): 115-126 (2015) (2015 Impact Factor 0.658)
  39. Md. Mahbubul Hasan, A. S. M. Shohidull Islam, Mohammad Saifur Rahman, Mohammad Sohel Rahman: Order preserving pattern matching revisited. Pattern Recognition Letters 55: 15-21 (2015) (2015 Impact Factor: 1.586; Source Normalized Impact Factor by Elsevier: 2.155).
  40. Effat Farhana and M. Sohel Rahman: Constrained sequence analysis algorithms in computational biology, Information Sciences, Volume 295, 20 February 2015, Pages 247-257, http://dx.doi.org/10.1016/j.ins.2014.10.019. (2014 Impact Factor: 3.364; Source Normalized Impact Factor by Elsevier: 2.489)
  41. Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam, Mohammad Sohel Rahman: The swap matching problem revisited. Theor. Comput. Sci. 557: 34-49 (2014) (2015 Impact Factor: 0.643; Source Normalized Impact Factor by Elsevier: 1.345).
  42. Rezwana Reaz, Md. Shamsuzzoha Bayzid and M. Sohel Rahman: Accurate Phylogenetic Tree Reconstruction from Quartets: A Heuristic Approach, PLoS ONE 9(8): e104008. 2014 doi:10.1371/journal.pone.0104008 (2015 Impact Factor: 3.234).
  43. M. Sohel Rahman, M. Kaykobad, and Jesun Sahariar Firoz: New Sufficient Conditions for Hamiltonian Paths, The Scientific World Journal, vol. 2014, Article ID 743431, 2014. doi:10.1155/2014/743431.
  44. Muhammad Ali Nayeem, Md. Khaledur Rahman and M. Sohel Rahman: Transit network design by genetic algorithm with elitism, Transportation Research Part C: Emerging Technologies, Volume 46, September 2014, Pages 30-45, ISSN 0968-090X, http://dx.doi.org/10.1016/j.trc.2014.05.002. (2015 Impact Factor: 3.075; Source Normalized Impact Factor by Elsevier: 2.462).
  45. M. Crochemore, A. Langiu, M. Sohel Rahman: Indexing a sequence for mapping reads with a single mismatch. Phil. Trans. R. Soc. A372: 20130167. http://dx.doi.org/10.1098/rsta.2013.0167 (2015 Impact Factor: 2.441).
  46. Dipan Shaw, A. S. M. Shohidull Islam, M. Sohel Rahman, Masud Hasan: Protein folding in HP model on hexagonal lattices with diagonals. BMC Bioinformatics 15(S-2): S7 (2014) (2015 Impact Factor: 2.435).
  47. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman. Computing a Longest Common Palindromic Subsequence. Fundamneta Informaticae, 129(4): 329-340 (2014) (2015 Impact Factor 0.658).
  48. A. H. M. Mahfuzur Rahman, M. Sohel Rahman: Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems. JCP 9(8): 1743-1754 (2014).
  49. Shegufta Bakht Ahsan, Syeda Persia Aziz, M. Sohel Rahman: Longest Common Subsequence Problem for Run-Length-Encoded Strings. JCP 9(8): 1769-1775 (2014).
  50. Masruba Tasnim, Shahriar Rouf, M. Sohel Rahman: A CLONALG-based Approach for the Set Covering Problem. JCP 9(8): 1787-1795 (2014).
  51. A. S. M. Shohidull Islam and M. Sohel Rahman: On the protein folding problem in 2D-triangular lattices. Algorithms for Molecular Biology, 2013, 8:30 (2015 Impact Factor: 1.439).
  52. Pritom Ahmed, A. S. M. Shohidull Islam, M. Sohel Rahman: A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations. Journal of Discrete Algorithms, 23: 143-156 (2013) (Source Normalized Impact Factor by Elsevier: 1.229).
  53. Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman and Rezwana Reaz. Inferring Strings from Cover Arrays. Discrete Mathematics, Algorithms and Applications (DMAA), 5(2) (2013).
  54. Muhammad Rashed Alam and M. Sohel Rahman. A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem. Information Processing Letters, 113(13):470-476 (2013) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  55. Johra Muhammad Moosa, M. Sohel Rahman, and Fatema Tuz Zohora. Computing a Longest Common Subsequence that is Almost Increasing on Sequences Having no Repeated Elements. Journal of Discrete Algorithms, 20: 12-20 (2013) (Source Normalized Impact Factor by Elsevier: 1.229).
  56. Deen Mohammad Abdullah, Wali Md Abdullah, and M. Sohel Rahman. Improving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange. Journal of Computers, 8(5): 1119-1126 (2013).
  57. Md Tanvir Islam Aumi, Tanaeem M Moosa and M. Sohel Rahman. Pattern Matching in Indeterminate and Arc-Annotated Sequences. Recent Patents on DNA and Gene Sequences, 7(2): 96-104 (2013).
  58. Amit Kumar Dutta, Masud Hasan and M. Sohel Rahman. Prefix transpositions on binary and ternary strings. Information Processing Letters, 113(8): 265-270 (2013) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  59. Muhammad Rashed Alam and M. Sohel Rahman. The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. Journal of Discrete Algorithms, 17:67-73 (2012) (Source Normalized Impact Factor by Elsevier: 1.229).
  60. Effat Farhana and M. Sohel Rahman. Doubly-Constrained LCS and Hybrid-Constrained LCS Problems Revisited. Information Processing Letters, 112(13):562-565. (2012) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  61. Joseph Wun-Tat Chan, Costas S. Iliopoulos, Spiros Michalakopoulos and M. Sohel Rahman. Exact and Approximate Rhythm Matching Algorithms. International Journal on Digital Libraries, 12(2-3): 149-158 (2012).
  62. Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler and Tomasz Wallen. Improved Algorithms for the Range Next Value Problem and Applications. Theoretical Computer Science, 434: 23-34 (2012) (2015 Impact Factor: 0.643; Source Normalized Impact Factor by Elsevier: 1.345).
  63. Tanaeem M. Moosa and M. Sohel Rahman. Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees. Discrete Mathematics, Algorithms and Applications (DMAA), 4(1) (2012).
  64. Sumaiya Nazeen, M. Sohel Rahman and Rezwana Reaz. Indeterminate string inference algorithms. Journal of Discrete Algorithms 10: 23-34 (2012) (Source Normalized Impact Factor by Elsevier: 1.229).
  65. Tanaeem M. Moosa and M. Sohel Rahman. Sub-quadratic time and linear space Data Structures for Permutation Matching in Binary Strings. Journal of Discrete Algorithms 10: 5-9 (2012) (Source Normalized Impact Factor by Elsevier: 1.229).
  66. Shegufta Bakht Ahsan, Tanaeem M. Moosa, M. Sohel Rahman, and Shampa Shahriyar. Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded. INFOCOMP Journal of Computer Science 10 (3) (2011), pp. 48-55.
  67. Masud Hasan, S.M. Shabab Hossain, Md. Mahmudur 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(1-2):125-140 (2011) (2015 Impact Factor: 0.739).
  68. Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan and M. Sohel Rahman. The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. Journal of Computational Biology 18 (8):1007-1011 (2011) (2015 Impact Factor: 1.537).
  69. Maxime Crochemore, Costas S. Iliopoulos, and M. Sohel Rahman. Finding patterns in given intervals. Fundam. Inform. 101(3): 173-186 (2010) (2015 Impact Factor 0.658).
  70. Tanaeem M. Moosa and M. Sohel Rahman. Indexing permutations for binary strings. Information Processing Letters, 110(18-19):795-798 (2010) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  71. Masud Hasan, S.M. Shabab Hossain, Md. Mahmudur Rahman and M. Sohel Rahman. Solving the Generalized Subset Sum Problem with a Light Based Device. Natural Computing, 10 (1):541-550 (2010) (2015 Impact Factor 0.658).
  72. Masud Hasan, Tanaeem M. Moosa and M. Sohel Rahman. Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Mathematics in Computer Science (MCS), 3(4) (2010), pp. 433-442.
  73. Costas S. Iliopoulos, M. Sohel Rahman, M. Voracek and L. Vagner. Finite Automata Based Algorithms on Subsequences and Supersequences of Degenerate Strings. Journal of Discrete Algorithms, 8(2):117-130 (2010) (Source Normalized Impact Factor by Elsevier: 1.229).
  74. Costas S. Iliopoulos, M. Sohel Rahman, and Wojciech Rytter. Algorithms for two versions of LCS problem for indeterminate strings. Journal of Combinatorial Mathematics and Combinatorial Computing, 71 (Nov 2009), pp. 155-172.
  75. C. S. Iliopoulos and M. Sohel Rahman. A New Efficient Algorithm for Computing the Longest Common Subsequence . Theory of Computing Systems 45(2): 355-371 (2009) (2015 Impact Factor 0.719).
  76. C. S. Iliopoulos and M. Sohel Rahman. Indexing factors with gaps. Algorithmica 55(1):60-70 (2009) (2015 Impact Factor 0.795).
  77. C. S. Iliopoulos and M. Sohel Rahman. Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci., 395(2-3): 255-267 (2008) (2015 Impact Factor: 0.643; Source Normalized Impact Factor by Elsevier: 1.345). .
  78. M. Christodoulakis, C. S. Iliopoulos, M. Sohel Rahman, and W. F. Smyth. Identifying rhythms in musical texts. Int. J. Found. Comput. Sci., 19(1):37-51 (2008) (2015 Impact Factor 0.467).
  79. C. S. Iliopoulos, L. Mouchard, and M. Sohel Rahman. A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching. Mathematics in Computer Science (MCS), 1(4) (2008), pp. 557-569.
  80. C. S. Iliopoulos and M. Sohel Rahman. Faster index for property matching. Inf. Process. Lett., 105(6):218-223 (2008) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  81. C. S. Iliopoulos and M. Sohel Rahman. New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett., 106(1):13-18 (2008) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  82. A. Z. M. Shahriar, M. M. Akbar, M. Sohel Rahman and M. A. H. Newton. A Multiprocessor based Heuristic for Multi-dimensional Multiple-Choice Knapsack Problem. the Journal of Supercomputing, 43(3) (2008), pp. 257-280.
  83. M. M. Akbar, M. Sohel Rahman, M. Kaykobad, E.G. Manning and G.C. Shoja. Solving the Multidimensional Multiple-Choice Knapsack Problem by Constructing Convex Hulls. Computers & OR, 33:1259-1273 (2006) (2015 Impact Factor: 1.988; Source Normalized Impact Factor by Elsevier: 1.940).
  84. M. Sohel Rahman and M. Kaykobad. Complexities of Some Interesting Problems on Spanning Trees. Inf. Process. Lett., 94(2):93-97 (2005) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  85. M. Sohel Rahman, and M. Kaykobad. On Hamiltonian Cycles and Hamiltonian Paths. Inf. Process. Lett., 94(1):37-41 (2005) (2015 Impact Factor: 0.605; Source Normalized Impact Factor by Elsevier: 1.265).
  86. M. Sohel Rahman and M Kaykobad. Independence Number and Degree Bounded Spanning Tree. Appl. Math. E-Notes, 4 (2004), pp. 122-124.
Refereed Conferences (95)

  1. Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Atif Hasan Rahman, Rifat Shahriyar and M. Sohel Rahman: A 'Phylogeny-aware' Multi-objective Optimization Approach for Computing MSA. GECCO 2019: To Appear.
  2. Anik Sarker, Wing-Kin Sung and M. Sohel Rahman: A linear time algorithm for the r-gathering problem on line (Extended Abstract). WALCOM 2019: 56-66.
  3. Ali Alatabbi, Jackie Daykin, Neerja Mhaskar, M. Sohel Rahman and William F. Smyth: Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index. WALCOM 2019: 329-338.
  4. Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman: A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison. WALCOM 2018: 183-194
  5. Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman: On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). WALCOM 2018: 207-215
  6. E. M. Wasifur Rahman Chowdhury, M. Saifur Rahman, A. B. M. Alim Al Islam, M. Sohel Rahman: Salty Secret: Let us secretly salt the secret. NSysS 2017: 115-123 (2017).
  7. Md. Khaledur Rahman and M. Sohel Rahman, CRISPRpred: A flexible and efficient tool for sgRNAs on-target activity prediction in CRISPR/Cas9 systems, GLBIO 2017, Univ. of Illinois at Chicago (2017)
  8. Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman and W. F. Smyth, Algorithms to compute the Lyndon array, Proc. Prague Stringology Conference, (2016) 172-184
  9. Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman: Approximation Algorithms for Three Dimensional Protein Folding. WALCOM 2016: 274-285
  10. Mohammad Saifur Rahman, Md. Yusuf Sarwar Uddin, M. Sohel Rahman, and M. Kaykobad, Using Adaptive Heartbeat rate on Long-lived TCP Connections. In Proceedings of 2016 International Conference on Networking Systems and Security (NSysS 2016), IEEE, Dhaka, pages 16-24, 2016
  11. Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, M. Samiruzzaman: A Filter-Based Approach for Approximate Circular Pattern Matching. ISBRA 2015: 24-35
  12. Md. Kishwar Shafin, Kazi Lutful Kabir, Iffatur Ridwan, Tasmiah Tamzid Anannya, Rashid Saadman Karim, Mohammad Mozammel Hoque, M. Sohel Rahman: New Heuristics for Clustering Large Biological Networks. ISBRA 2015: 309-319
  13. Ali Alatabbi, Shuhana Azmin, Md. Kawser Habib, Costas S. Iliopoulos, M. Sohel Rahman: SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching. IWBBIO (2) 2015: 219-230
  14. Md. Khaledur Rahman, M. A. Nayeem, and M. Sohel Rahman, Transit Network Design by Hybrid Guided Genetic Algorithm With Elitism. In Proceedings of 13th Conference on Advanced Systems in Public Transport, Rotterdam, Netherlands, 2015
  15. Md. Mahbubul Hasan, A. S. M. Sohidull Islam, Mohammad Saifur Rahman, M. Sohel Rahman: Order Preserving Prefix Tables. SPIRE 2014: 111-116
  16. Fatema Tuz Zohora, M. Sohel Rahman: Application of Consensus String Matching in the Diagnosis of Allelic Heterogeneity - (Extended Abstract). ISBRA 2014: 163-175
  17. Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth: Simple Linear Comparison of Strings in V-Order - (Extended Abstract). WALCOM 2014: 80-89
  18. M. A. R. Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman, A fast and lightweight filter-based algorithm for circular pattern matching. In Proceedings of ACM BCB, ACM, Newport Beach, California, USA, pages 621-622, 2014
  19. A. S. M. Shohidull Islam, M. Sohel Rahman: Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract). IWOCA 2013: 244-257
  20. Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen: On Palindromic Sequence Automata and Applications. CIAA 2013: 158-168.
  21. Ali Alatabbi, Costas S. Iliopoulos and Mohammad Sohel Rahman: Maximal Palindromic Factorization, In Proceedings of the Prague Stringology Conference 2013, PSC 2013: 70-77
  22. Dipankar Ranjan Baisya, Mir Md. Faysal and Mohammad Sohel Rahman Degenerate String Reconstruction from Cover Arrays. In Proceedings of the Prague Stringology Conference 2013, PSC 2013: 191-205
  23. Ayon Sen, Tahmid-un-Nabi, Pritom Ahmed, Rezwana Reaz, A. S. M. Sohidull Islam, M. Sohel Rahman: A Modified Scatter Search Approach to Solve the DNA Fragment Assembly Problem. In proceedings of MIC 2013.
  24. S.K.K. Santu, S. Rahman, S. Chakraborty, M. Sohel Rahman: PIssGA: An ultra fast meta-heuristic approach to solve protein inference problem. In proceedings of ICCIT 2013.
  25. Raihanul Ismal and M. Sohel Rahman. An Improved Intelligent Water Drop Algorithm for a Real-life Waste Collection Problem, In Proceedings of Fourth International Conference on Swarm Intelligence (ICSI 2013), ICSI (2) 2013: 472-479 LNCS. [Research work partially supported by a CodeCrafters-Investortools Research Grant for CSE BUET]
  26. S. M. Ferdous and M. Sohel Rahman. Solving the Minimum Common String Partition Problem with the Help of Ants, In Proceedings of Fourth International Conference on Swarm Intelligence (ICSI 2013), ICSI (1) 2013: 306-313, LNCS.
  27. M. Sohel Rahman, M. Kaykobad, Md. Tanvir Kaykobad: Bipartite Graphs, Hamiltonicity and Z graphs. Electronic Notes in Discrete Mathematics 44: 307-312 (2013) (Proceedings of VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2013)). [Research work carried out under a research project by CASR, BUET]
  28. S. Mehnaz, and M. Sohel Rahman, Pairwise Compatibility Graphs Revisited. In Proceedings of ICIEV, Dhaka, Bangladesh, 2013.
  29. Jesun Sahariar Firoz, M. Sohel Rahman and Tanay Kumar Saha. Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data. GECCO 2012: 201-208.
  30. Mahfuza Sharmin, M. Sohel Rahman. Placement of unique restriction sites in synthetic genomes using multi-objective optimization. BIBM 2012: 1-4. [Research work partially supported by a CodeCrafters-Investortools Research Grant for CSE BUET]
  31. Pritom Ahmed, A.S.M. Sohidull Islam and M. Sohel Rahman. A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations, In Proceedings of International Workshop on Combinatorial Algorithms (IWOCA 2012), pp. 169-181 Springer LNCS Series.
  32. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman: Computing a Longest Common Palindromic Subsequence. IWOCA 2012: 219-223
  33. Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman and Rezwana Reaz. Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet, In Md. Saidur Rahman, Shin-Ichi Nakano (Eds.): WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7157 Springer 2012, pp. 160-172.
  34. M. Sohel Rahman, M. Kaykobad,J.S. Firoz: New sufficient conditions for Hamiltonian paths, Computer and Information Technology (ICCIT), 2012 15th International Conference on , vol., no., pp.21,25, 22-24 Dec. 2012 doi: 10.1109/ICCITechn.2012.6509716
  35. R.R. Noel, R. Hasan, M. Sohel Rahman: Maximal path based conflict resolution approach in multiple homologous gene list alignment, Computer and Information Technology (ICCIT), 2012 15th International Conference on , vol., no., pp.587,591, 22-24 Dec. 2012
  36. A.H.M.M.Rahman, M. Sohel Rahman: New efficient algorithms for the merged LCS problem with and without block constraints using sparse dynamic programming, Computer and Information Technology (ICCIT), 2012 15th International Conference on , vol., no., pp.26,35, 22-24 Dec. 2012
  37. S.B. Ahsan, S.P. Aziz, M. Sohel Rahman: Longest common subsequence problem for run-length-encoded strings, Computer and Information Technology (ICCIT), 2012 15th International Conference on , vol., no., pp.36,41, 22-24 Dec. 2012
  38. M. Tasnim, S. Rouf, M. Sohel Rahman: A CLONALG-based approach for the set covering problem, Computer and Information Technology (ICCIT), 2012 15th International Conference on , vol., no., pp.42,49, 22-24 Dec. 2012
  39. Jesun Sahariar Firoz, M. Sohel Rahman and Tanay Kumar Saha. Hybrid Meta-heuristics for DNA Fragment Assembly problem for noiseless data, In Proceedings of 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision 2012, pages 652-656.
  40. Raihanul Ismal and M. Sohel Rahman. An Ant Colony Optimization Algorithm for Waste Collection Vehicle Routing with Time Windows, Driver Rest Period and Multiple Disposal Facilities, In Proceedings of 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision 2012, pages 774-779.
  41. S.M. Ferdous, Anindya Das, M. Sohel Rahman and Md. Musta?zur Rahman. An Ant Colony Optimization approach to solve the Minimum String Cover Problem, In Proceedings of 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision 2012, pages 741-746.
  42. Pritom Ahmed, A.S.M. Sohidull Islam and M. Sohel Rahman. Yet Another Efficient Algorithm for the Swap Matching Problem, In Proceedings of 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision 2012, pages 336-341.
  43. Mahfuza Sharmin, Monjura Afrin, and M. Sohel Rahman. Local Search Techniques for Placing Unique Restriction Sites in Synthetic Genomes. Accepted at the 4th International Conference on Bioinformatics and Computational Biology (BiCOB 2012).
  44. Jesun Sahariar Firoz, M. Sohel Rahman and Tanay Kumar Saha. Analyzing Memetic Algorithm Behavior in DNA Fragment Assembly Problem for Noisy Data. Accepted at the 4th International Conference on Bioinformatics and Computational Biology (BiCOB 2012).
  45. Effat Farhana and M. Sohel Rahman. Efficient Algorithm for Restricted LCS Problem. Accepted at the 4th International Conference on Bioinformatics and Computational Biology (BiCOB 2012).
  46. Sumaiya Iqbal, and M. Sohel Rahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS. In Proceedings of ICECE, IEEE 2012, Dhaka, Bangladesh.
  47. Md. Tanvir Islam Aumi, Tanaeem M. Moosa, M. Sohel Rahman. Fast Algorithms for Finding Patterns in Indeterminate and Arc-Annotated Sequences. In Proceedings of the 14th International Conference on Computer and Information Technology (ICCIT), 2011.
  48. Deen Md Abdullah, Wali Md Abdullah, M. Sohel Rahman. An improved heuristic algorithm for sorting genomes with inverted block-interchange. In Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT), 2011.
  49. Tanaeem M. Moosa, M. Sohel Rahman. Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees. 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings. Lecture Notes in Computer Science 6842 Springer 2011, pp. 204-212.
  50. Rifat Shahriyar, Md. Mostofa Akbar, M. Sohel Rahman, Md. Faizul Bari, and Shampa Shahriyar, CORS - A Cost Optimized Resource Reservation Scheme for Grid. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, Nevada, USA,, 2011
  51. Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman and M. Sohel Rahman. Solving Minimum Hitting Set Problem with a Light-Based Device. 2010 International Conference on Electrical and Computer Engineering (ICECE), Digital Object Identifier: 10.1109/ICELCE.2010.5700719, Publication Year: 2010, Page(s): 423 - 426.
  52. Shahrear Iqbal, Md. Faizul Bari and M. Sohel Rahman. A novel ACO technique for fast and near optimal solutions for the Multi-dimensional Multi-choice Knapsack Problem. 2010 13th International Conference on Computer and Information Technology (ICCIT), Digital Object Identifier: 10.1109/ICCITECHN.2010.5723825 Publication Year: 2010, Page(s): 33 - 38.
  53. Maxime Crochemore, Masud Hasan, Tanaeem Moosa and M. Sohel Rahman. Two dimensional Range Minimum/Maximum Query revisited. 2010 13th International Conference on Computer and Information Technology (ICCIT), Digital Object Identifier: 10.1109/ICCITECHN.2010.5723824 Publication Year: 2010, Page(s): 27 - 32.
  54. S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman. Solving a Generalized Version of the Exact Cover Problem with a Light-Based Device. Shlomi Dolev, Mihai Oltean (Eds.): Optical Supercomputing - Third International Workshop, OSC 2010, Bertinoro, Italy, November 17-19, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6748 Springer 2011, pp. 23-31.
  55. Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, M. Sohel Rahman. Pancake Flipping with Two Spatulas. In ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics 36 (2010), pp. 231-238.
  56. S.B. Ahsan, Tanaeem Moosa, M. Sohel Rahman and Shampa Shahriyar. Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded. Marko Bohanec et al. edited, Proceedings of Information Society - IS 2010, Mini-conference on Applied Theoretical Computer Science, MATCOS 2010, October 11th–15th, 2010 Ljubljana, Slovenia, pp. 366-369.
  57. Effat Farhana, Jannatul Ferdous, Tanaeem Moosa and M. Sohel Rahman. Algorithms for the Generalized Constrained Longest Common Subsequence Problems. In Edgar Chávez, Stefano Lonardi (Eds.): String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Volume 6393 of LNCS, pages 243-249, Springer, 2010.
  58. Shahrear Iqbal and Md. Faizul Bari and M. Sohel Rahman. Solving the multi-dimensional multi-choice knapsack problem with the help of ants. In M. Dorigo et al. (Eds.): ANTS 2010, Brussels, Belgium, September 8-10, 2010. Proceedings. Volume 6234 of LNCS, pages 312-323, Springer, 2010.
  59. Md. Raqibul Hasan, M. Sohel Rahman, Masud Hasan, Md. Mahmudul Hasan and M. Ameer Ali. An Improved Pipelined Processor Architecture Eliminating Branch and Jump Penalty. Second International Conference on Computer Engineering and Applications, pages 621-625, IEEE Computer Society.
  60. Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan and M. Sohel Rahman. The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. In S. Fujuta and Md. Saidur Rahman, editors, WALCOM 2010, volume 5942 of Lecture Notes in Computer Science, pages 161-166. Springer, 2010.
  61. Faizul Bari, M. Sohel Rahman and Rifat Shahriyar. Finding all covers of an indeterminate string in O(n) time on average. In Jan Holub and Jan Zdárek, editors, Stringology, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2009, pp. 263-271.
  62. Raqibul Hasan and M. Sohel Rahman. Computing a solution for the Subset Sum Problem with a Light Based Device. Accepted at the Second International Workshop on Optical Super Computing (OSC) 2009, volume 5882 of Lecture Notes in Computer Science, pages 70-76. Springer, 2009.
  63. Masud Hasan, Shabab Hossain, Md. Mahmudur Rahman and M. Sohel Rahman. An Optical Solution for the Subset Sum Problem. Accepted at the Fourth International Workshop on Natural Computing (IWNC) 2009, Proceedings in Information and Communications Technology 2, pp. 165-173, Springer.
  64. Md. Muhibur Rasheed, Masud Hasan and M. Sohel Rahman. Maximum Neighbour Voronoi Games. In Sandip Das, Ryuhei Uehara, editors, WALCOM 2009, volume 5431 of Lecture Notes in Computer Science, pages 93-104. Springer, 2008.
  65. Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, and M. Sohel Rahman. Implementation of a swap matching algorithm using a graph theoretic model. In Mourad Elloumi, Josef Küng, Michal Linial, Robert F. Murphy, Kristan Schneider, and Cristian Toma, editors, BIRD, volume 13 of Communications in Computer and Information Science, pages 446-455. Springer, 2008.
  66. Tomás Flouri, Costas S. Iliopoulos, M. Sohel Rahman, Ladislav Vagner, and Michal Vorácek. Indexing factors in dna/rna sequences. In Mourad Elloumi, Josef Küng, Michal Linial, Robert F. Murphy, Kristan Schneider, and Cristian Toma, editors, BIRD, volume 13 of Communications in Computer and Information Science, pages 436-445. Springer, 2008.
  67. Joseph Wun-Tat Chan, Costas S. Iliopoulos, Sprios Michalakopoulos and M. Sohel Rahman. Erratic Dancing. In the 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008), Copenhagen, Denmark, 2008.
  68. Costas S. Iliopoulos and M. Sohel Rahman. Indexing circular patterns. In Shin-Ichi Nakano and Md. Saidur Rahman, editors, WALCOM, volume 4921 of Lecture Notes in Computer Science, pages 46-57. Springer, 2008.
  69. Costas S. Iliopoulos and M. Sohel Rahman. A new model to solve the swap matching problem and efficient algorithms for short patterns. In Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, and Mária Bieliková, editors, SOFSEM, volume 4910 of Lecture Notes in Computer Science, pages 316-327. Springer, 2008.
  70. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen. Improved algorithms for the range next value problem and applications. In Susanne Albers, Pascal Weil, and Christine Rochange, editors, STACS, volume 08001 of Dagstuhl Seminar Proceedings, pages 205-216. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008.
  71. Costas S. Iliopoulos, M. Sohel Rahman, and Wojciech Rytter. Algorithms for two versions of LCS problem for indeterminate strings. In International Workshop on Combinatorial Algorithms (IWOCA), 2007. To Appear in Texts in Algorithmics.
  72. Maxime Crochemore, Costas S. Iliopoulos, and M. Sohel Rahman. Finding patterns in given intervals. In Ludek Kucera and Antonín Kucera, editors, MFCS, volume 4708 of Lecture Notes in Computer Science, pages 645-656. Springer, 2007.
  73. Maxime Crochemore, Costas S. Iliopoulos, and M. Sohel Rahman. Optimal prefix and suffix queries on texts. In Philippe Jacquet editor, AofA, DMTCS proc., AH, 2007, pages 645-656.
  74. Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen. Algorithms for computing the longest parameterized common subsequence. In Bin Ma and Kaizhong Zhang, editors, CPM, volume 4580 of Lecture Notes in Computer Science, pages 265-273. Springer, 2007.
  75. M. Sohel Rahman and Costas S. Iliopoulos. Indexing factors with gaps. In Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, and Frantisek Plasil, editors, SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, pages 465-474. Springer, 2007.
  76. M. Sohel Rahman and Costas S. Iliopoulos. A new efficient algorithm for computing the longest common subsequence. In Ming-Yang Kao and Xiang-Yang Li, editors, AAIM, volume 4508 of Lecture Notes in Computer Science, pages 82-90. Springer, 2007.
  77. M. Sohel Rahman and Costas S. Iliopoulos. Pattern matching algorithms with don't cares. In Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil, and Mária Bieliková, editors, SOFSEM (2), pages 116-126. Institute of Computer Science AS CR, Prague, 2007.
  78. Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek and Ladislav Vagner. The Constrained Longest Common Subsequence Problem for Degenerate Strings. In Jan Holub and Jan Zdárek, editors, CIAA, volume 4783 of Lecture Notes in Computer Science, pages 309-311. Springer, 2007.
  79. Arbee L. P. Chen, Costas S. Iliopoulos, Spiridon Michalakopoulos, and M. Sohel Rahman. Implementation of algorithms to classify musical texts according to rhythms. In Charalampos Spyridis, Anastasia Georgaki, Georgios Kouroupetroglou, and Christina Anagnostopoulou, editors, SMC, pages 134-141, 2007.
  80. Costas S. Iliopoulos and M. Sohel Rahman. New efficient algorithms for LCS and constrained LCS problem. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, and Stefan Szeider, editors, ACiD, volume 9 of Texts in Algorithmics, King's College, London, 2007, pages 116-126.
  81. Costas S. Iliopoulos, M. Sohel Rahman, Michal Voracek, and Ladislav Vagner. Computing constrained longest common subsequence for degenerate strings using finite automata. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, and Stefan Szeider, editors, ACiD, volume 9 of Texts in Algorithmics, King's College, London, 2007, pages 95-106.
  82. M. Sohel Rahman, Costas S. Iliopoulos, and Laurent Mouchard. Pattern matching in degenerate dna/rna sequences. In M. Kaykobad and Md. Saidur Rahman, editors, WALCOM, pages 109-120. Bangladesh Academy of Sciences (BAS), 2007.
  83. M. Sohel Rahman and Costas S. Iliopoulos. Algorithms for computing variants of the longest common subsequence problem. In Tetsuo Asano, editor, ISAAC, volume 4288 of Lecture Notes in Computer Science, pages 399-408. Springer, 2006.
  84. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, and William F. Smyth. Finding patterns with variable length gaps or don't cares. In Danny Z. Chen and D. T. Lee, editors, COCOON, volume 4112 of Lecture Notes in Computer Science, pages 146-155. Springer, 2006.
  85. Manolis Christodoulakis, Costas S. Iliopoulos, M. Sohel Rahman, and William F. Smyth. Song classifications for dancing. In Jan Holub and Jan Zdárek, editors, Stringology, pages 41-48. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2006.
  86. R. S. Roy and M. Sohel Rahman. On Communicating with Agents on the Network. In G. Chakraborty, editor, ICDCIT, volume 3816 of Lecture Notes in Computer Science, pages 267-277. Springer, 2005.
  87. M. M. Akbar, M. Sohel Rahman, E. G. Manning and G. C. Shoja. Distributed Utility Model for Distributed Multimedia Server Systems. In Proceedings of Design, Analysis, and Simulation of Distributed Systems (DASD), Spring Simulation Multi-conference, 2005, pp. 148-155.
  88. M. Sohel Rahman, M. Kaykobad and Mohammad Saifur Rahman. A New Sufficient Condition for the Existence of Hamiltonian Paths. In Proceedings of the 20th International Conference on Computers and Their Applications (CATA 2005), USA, March 2005, pp. 56-59.
  89. M. M. Akbar, E. G. Manning, G. C. Shoja and M. Sohel Rahman. Optimal Server Selection for Content Routing. In Proceedings of the 20th International Conference on Computers and Their Applications (CATA 2005), USA, March 2005, pp. 259-264.
  90. M. Sohel Rahman and Md. Abul Kashem. Degree Restricted Spanning Trees of Graphs. In Proceedings of the 19th ACM Symposium of Applied Computing (SAC 2004) pp. 225-228.
  91. M. Sohel Rahman and Md. Abul Kashem. An Efficient Algorithm for Finding an Independency Tree. In Proceedings of the 7th International Conference on Computer and Information Technology (ICCIT), 2004 pp. 1-6.
  92. M. Sohel Rahman and M. Kaykobad. Set Version: A New Notion and Results. In Proceedings of the Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, Slovenia.
  93. M. Sohel Rahman and M. Kaykobad. On Hamiltonian Cycles and Hamiltonian Paths. In Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT), 2003 pp. 185-187.
  94. M. Sohel Rahman, M. Kaykobad and M. M. Akbar Independence Number and Hamiltonicity of Graphs. In Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT), 2003 pp. 150-152.
  95. Asif-ul Haque, Mohammad Saifur Rahman, M. Sohel Rahman, M. Kaykobad and M. Kaykobad. On Average Length of Cycles in Complete Graphs. In Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT), 2002 pp. 47-49.
Text Books

  1. Md. Mostofa Akbar, M. Sohel Rahman, Mohammed Eunus Ali, Shahriar Iqbal, Information and Communication Technology (in Bangla). (ISBN: 978-984-90173-7-0), June 2013.
  2. Munawar Hafiz, M. Sohel Rahman, Mohammed Eunus Ali and M. Kaykobad. System Analysis and Design - A Practitioner's Approach. University Grants Commission of Bangladesh (ISBN: 984-809-018-5), December 2005.
Reviews at Mathematical Review (21)

  1. Review of MR3539478 (Atminas, Aistis; Kaminski, Marcin; Raymond, Jean-Florent Scattered packings of cycles. Theoret. Comput. Sci. 647 (2016), 33–42.)
  2. Review of MR3398868 (Wei, Jianxin ; Zhang, Heping . Proofs of two conjectures on generalized Fibonacci cubes. European J. Combin. 51 (2016), 419-432.)
  3. Review of MR3355838 (Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter ; Villanger, Yngve . An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Algorithmica 72 (2015), no. 3, 836-859.)
  4. Review of MR3334319 ( Egho, Elias ; Raïssi, Chedy ; Calders, Toon ; Jay, Nicolas ; Napoli, Amedeo . On measuring similarity for sequences of itemsets. Data Min. Knowl. Discov. 29 (2015), no. 3, 732-764.)
  5. Review of MR3331886 ( Feige, Uriel ; Jozeph, Shlomo . Oblivious algorithms for the maximum directed cut problem. Algorithmica 71 (2015), no. 2, 409-428.)
  6. Review of MR3292373 ( Kasperski, Adam ; Zielinski, Pawel . Combinatorial optimization problems with uncertain costs and the OWA criterion. Theoret. Comput. Sci. 565 (2015), 102-112.)
  7. Review of MR3258369 ( Demange, Marc ; Ekim, Tinaz ; Ries, Bernard ; Tanasescu, Cerasela . On some applications of the selective graph coloring problem. European J. Oper. Res. 240 (2015), no. 2, 307-314.)
  8. Review of MR3254323 ( Fici, Gabriele ; Gagie, Travis ; Kärkkäinen, Juha ; Kempa, Dominik . A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28 (2014), 41-48.)
  9. Review of MR3198405 ( Akandwanaho, Stephen M. ; Adewumi, Aderemi O. ; Adebiyi, Ayodele A. Solving dynamic traveling salesman problem using dynamic Gaussian process regression. J. Appl. Math. 2014, Art. ID 818529, 10 pp.)
  10. Review of MR3094205 ( Cygan, Marek ; Pilipczuk, Marcin ; Pilipczuk, Michal ; Wojtaszczyk, Jakub Onufry . On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory 5 (2013), no. 1, Art. 3, 11 pp.)
  11. Review of MR3034089 ( Mladenovic, Nenad ; Uroševic, Dragan ; Hanafi, Saïd . Variable neighborhood search for the travelling deliveryman problem. 4OR 11 (2013), no. 1, 57-73.)
  12. Review of MR3035490 ( Schmidt, Jens M. Contractions, removals, and certifying 3-connectivity in linear time. SIAM J. Comput. 42 (2013), no. 2, 494-535.)
  13. Review of MR3028622 ( Bazgan, Cristina ; Gourvès, Laurent ; Monnot, Jérôme ; Pascual, Fanny . Single approximation for the biobjective Max TSP. Theoret. Comput. Sci. 478 (2013), 41-50.)
  14. Review of MR2995308 ( Charikar, Moses ; Li, Shi . A dependent LP-rounding approach for the k-median problem. Automata, languages, and programming. Part I, 194-205, Lecture Notes in Comput. Sci., 7391, Springer, Heidelberg, 2012.)
  15. Review of MR2927102 ( Bille, Philip ; Gørtz, Inge Li ; Vildhøj, Hjalte Wedel ; Wind, David Kofoed . String matching with variable length gaps. Theoret. Comput. Sci. 443 (2012), 25-34.)
  16. Review of MR2886084 ( Eggert, Sebastian ; Kliemann, Lasse ; Munstermann, Peter ; Srivastav, Anand . Bipartite matching in the semi-streaming model. Algorithmica 63 (2012), no. 1-2, 490-508.)
  17. Review of MR2857853 (Jackson, J. ; Faied, M. ; Girard, A. Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems. Internat. J. Robust Nonlinear Control 21 (2011), no. 12, 1358-1371.)
  18. Review of MR2786440 (Aumann, Yonatan ; Lewenstein, Moshe ; Lewenstein, Noa ; Tsur, Dekel . Finding witnesses by peeling. ACM Trans. Algorithms 7 (2011), no. 2, Art. 24, 15 pp.)
  19. Review of MR2764341 (Hemmecke, Raymond ; Onn, Shmuel ; Weismantel, Robert . A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126 (2011), no. 1, Ser. A, 97-117.)
  20. Review of MR2583282 (Ann, Hsing-Yen ; Yang, Chang-Biau ; Peng, Yung-Hsing ; Liaw, Bern-Cherng . Efficient algorithms for the block-edit problems. Inform. and Comput. 208 (2010), no. 3, 221-229.)
  21. Review of MR2545757 (Cadoli, Marco ; Patrizi, Fabio . On the separability of subproblems in Benders decompositions. Ann. Oper. Res. 171 (2009), 27-43).
Reviews at ACM Computing Review (11)

  1. Review of (Toward optimal self-adjusting heaps Elmasry A. ACM Transactions on Algorithms 13 (4): 1-14, 2017)
  2. Review of (Support vector machines and perceptrons: learning, optimization, classification, and application to social networks Murty M., Raghava R., Springer International Publishing, New York, NY, 2016. 95 pp.)
  3. Review of (Improved algorithms for constructing consensus trees Jansson J., Shen C., Sung W. Journal of the ACM 63(3): 1-24, 2016.)
  4. Review of (Computing equality-free and repetitive string factorisations Schmid M. Theoretical Computer Science 618(C): 42-51, 2016.)
  5. Review of (Faster compressed suffix trees for repetitive collections Navarro G., Ordóñez Pereira A. Journal of Experimental Algorithmics 21(1): 1-38, 2016.)
  6. Review of (Improved parameterized and exact algorithms for cut problems on trees Kanj I., Lin G., Liu T., Tong W., Xia G., Xu J., Yang B., Zhang F., Zhang P., Zhu B. Theoretical Computer Science 607, Part 3, : 455-470, 2015.)
  7. Review of (Sorting and selection with imprecise comparisons Ajtai M., Feldman V., Hassidim A., Nelson J. ACM Transactions on Algorithms 12(2): 1-19, 2015.)
  8. Review of (Mining high utility itemsets by dynamically pruning the tree structure Song W., Liu Y., Li J. Applied Intelligence 40(1): 29-43, 2014.)
  9. Review of (Core words and Parikh matrices Teh W., Kwa K. Theoretical Computer Science 582(C): 60-69, 2015.)
  10. Review of (Complex networks: an algorithmic perspective Erciyes K. CRC Press, Inc., Boca Raton, FL, 2014.)
  11. Review of (Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times Kodaganallur V., Sen A., Mitra S. Computers and Industrial Engineering 67: 10-19, 2014.)


M. Sohel Rahman
Senior Member, ACM & IEEE
Professor
Department of CSE, BUET

Footnotes:

1Consultancy conducted under the auspices of the bureau of research training and consultation (BRTC), BUET as per the rules and regulations of BUET.


File translated from TEX by TTH, version 4.03.
On 09 Apr 2019, 22:14.