Research Detail:

Algorithms

» Research Fields:

» Research Groups:

» Related Faculties:
Dr. Sadia Sharmin

» Related Links:


» Recent Publications:
1. Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano, Enumerating Floorplans with Columns , Md. Saidur Rahman, Shin-Ichi Nakano, IEICE TRANS. FUNDAMENTALS, E101-A, 1392-1397, 2018.
2. Shaheena Sultana, Md. Saidur Rahman, Realizability of graphs as triangle cover contact graphs, Theoretical Computur Science, 720, 24-35, 2018.
3. Ali Alatabbi, M. Sohel Rahman, W.F. Smyth, Computing Covers Using Prefix Tables, Discrete Applied Mathematics, 212, 2-9, 2016.
4. Effat Farhana, M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology, Information Sciences, 295, 247-257, 2015.
5. S.B. Ahsan, S.P Aziz, M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014.
6. M. Tasnim, Shahriar Rouf, M. Sohel Rahman, A CLONALG-based Approach for the Set Covering Problem, Journal of Computers, 9(8), 1787-1795, 2014.
7. A.H.M.M Rahman, M. Sohel Rahman, Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems, Journal of Computers, 9(8), 1743-1754, 2014.
8. M. Crochemore, A. Langiu, M. Sohel Rahman, Indexing a sequence for mapping reads with a single mismatch, Phil. Trans. R. Soc. A, 372, 20130167, 2014.
9. Pritom Ahmed, Costas Iliopoulos, A. S. Islam, M. Sohel Rahman, The swap matching problem revisited, Theoretical Computer Science, 557(6), 34-49, 2014.
10. Pritom Ahmed, A. S. 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.
11. Muhammad Rashed Alam, 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.
12. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence, Fundamenta Informaticae, , 1–12, 2012.
13. Tanveer Awal, Md. Saidur Rahman, A Linear Algorithm for Resource Four-partitioning Four-connected Planar Graphs, AKCE International Journal of Graphs and Combinatorics, 9(1), 11-20, 2012.
14. T. M. Moosa, M. Sohel Rahman, Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees, Discrete Mathematics, Algorithms and Applications (DMAA), 4(1), , 2012.
15. M. Crochemore , C. Iliopoulos, M. Kubica, M. Sohel Rahman, German Tischler and Tomasz Wallen. Improved Algorithms for the Range Next Value Problem and Applications, Theor. Comput. Sci., 434, 23-34, 2012.
16. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms, International Journal on Digital Libraries, , , 2012.
17. Tanveer Awal, Md. Saidur Rahman, A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs, INFOCOMP Journal of Computer Science, 9(2), 39-48, 2010.
18. Muhammad Abdullah Adnan, Md. Saidur Rahman, Generating all distributions of objects to bins, International Journal of Computer Mathematics,, 86(3), 383 - 392, 2009.
19. Muhammad Abdullah Adnan, Md. Saidur Rahman, Efficient generation of evolutionary trees, INFOCOMP Journal of Computer Science,, 6(1), 30-36, 2007.
20. Muhammad Abdullah Adnan, Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions, International Journal of Computer Mathematics,, 84(7), 953-965, 2007.
21. Masud Hasan, T. M. Moosa, M. Sohel Rahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems, Mathematics in Computer Science (MCS), 3(4), 433-442, 0000.
22. S. Ahmed, Shin-ichi Nakano, Md. Saidur Rahman, One-Dimensional r-Gathering under Uncertainty, Algorithmic Aspects in Information and Management - 13th International Conference, , 1-15, 2019.
23. Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov, Online Facility Assignment. :, WALCOM 2018, , 156-168, 2018.
24. Sujoy Das, S. Sharmin, Md. Saidur Rahman, Proactive Humanitarian Aid Networks with Guided Topology and Small-World Effect, The fifth IEEE Region 10 (Asia Pacific) Humanitarian Technology Conference (R10HTC) 2017, 1(1), 682-685, 2017. [paper link]
25. Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano, Floorplans with Columns, COCOA 2017, , 33-40, 2017.
26. Dipan Shaw, A. S. Islam, Shuvasish Karmaker, M. Sohel Rahman, Approximation Algorithms for Three Dimensional Protein Folding, WALCOM, , 274-285, 2016.
27. Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, Md. Saidur Rahman, On Triangle Cover Contact Graphs. WALCOM 2015: 323-328, WALCOM 2015, , 323-328, 2015.
28. Md. Shaifur Rahman, Mahmuda Naznin, Shortening the Tour-Length of a Mobile Data Collector in the WSN by the Method of Linear Shortcut, The 15th Asia-Pacific Web Conference (APWeb), LNCS 7808, , 674-685, 2013. [paper link]
29. Muhammad Abdullah Adnan, Zonohedra, Zone Graphs, and Their Linear Area Straight Line Grid Drawings, Workshop on Graph Drawing and Graph Algorithms (GDGA), , , 2012.
30. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides, Acyclic Coloring with Few Division Vertices, IWOCA 2012, , 86 - 99, 2012.
31. E. Farhana, M. Sohel Rahman, Efficient Algorithm for Restricted LCS Problem, 4th International Conference on Bioinformatics and Computational Biology (BiCOB), , 51-56, 2012.
32. S. Sharmin, J. A. Telle, M. Vatshelle, E. M. Hvidevold, Finding good decompositions for dynamic programming on dense graphs, Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 7112, 219-231, 2011. [paper link]
33. Nurjahan Begum, Samia Tasnim, Mahmuda Naznin, Efficient Query Processing in Sensor Network Using Multi-commodity Flow Network, The 17th IEEE International Conference on Industrial Engineering and Management, , , 2010. [paper link]
34. Tanveer Awal, Md. Saidur Rahman, A linear algorithm for resource four-partitioning four-connected planar Graphs, ICECE 2010, , 526 - 529, 2010.
35. Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano, Generating all triangulations of plane graphs, WALCOM 2009, , 151-164, 2009.
36. Masud Hasan, S. Hossain, M. M. Rahman, M. Sohel Rahman, An Optical Solution for the Subset Sum Problem, the Fourth International Workshop on Natural Computing (IWNC), , 165-173, 2009.
37. Md. Shariful Islam Bhuyan, Md. Saidur Rahman, Efficient Generation of Combinatorial Families, 11th International Conference on Computer and Information Technology (ICCIT 2008), , 25-30, 2008.
38. Muhammad Abdullah Adnan, Distribution of distinguishable objects to bins: generating all distributions, Workshop on Algorithms and Computation (WALCOM), , , 2007.
39. Mahmuda Naznin, Paul Juell, Kendall E. Nygard, Karl Altenburg, A Clustering Heuristic by Effective Neighbor Selection, The 40th Annual Midwest Instructional and Computing Symposium (MICS), , 6, 2007.
40. Muhammad Abdullah Adnan, Md. Saidur Rahman, Efficient generation of evolutionary trees, International Conference on Information and Communication Technology (ICICT 2007), , 6, 2007.
41. Muhammad Abdullah Adnan, Md. Saidur Rahman, Distribution of objects to bins: generating all distributions, Proc. of 9th International Conference on Computer and Information Technology (ICCIT 2006), , 297-302, 2006.
42. S.B. Ahsan, S.P. Aziz, M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014.