>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?
 Research Detail:


  Algorithms and Theory >Algorithms:
  Recent Publications:

39. Mahmuda Naznin, and Md. Shaifur Rahman, Data Collection by Mobile Data Collector in a Clustered Network, poster paper. In Proceedings of the 6th Annual Workshop of N2Women, co-located with ACM SIGCOMM, UCLA, USA, 2017
38. S. Sharmin, Sujoy Das, and Md. Saidur Rahman, Proactive Humanitarian Aid Networks with Guided Topology and Small-World Effect. In Proceedings of The fifth IEEE Region 10 (Asia Pacific) Humanitarian Technology Conference (R10HTC) 2017, IEEE Explore, Dhaka, Bangladeh, 2017
37. Md. Mahbubul Hasan, A. S. Islam, M. Sohel Rahman, and Ayon Sen, On Palindromic Sequence Automata and Applications. Mathematics in Computer Science, :To Appear, 2016
36. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Computing Covers Using Prefix Tables. Discrete Applied Mathematics, Elsevier, 212:2-9, 2016
35. Dipan Shaw, A. S. Islam, Shuvasish Karmaker, and M. Sohel Rahman, Approximation Algorithms for Three Dimensional Protein Folding. In Proceedings of WALCOM, Springer, Nepal, pages 274-285, 2016
34. Effat Farhana, and M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology. Information Sciences, Elsevier, 295:247-257, 2015
33. Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, and Md. Saidur Rahman, On Triangle Cover Contact Graphs. WALCOM 2015: 323-328. In Proceedings of WALCOM 2015, Springer, Lecture Notes in Computer Science, 8973, pages 323-328, 2015
32. Pritom Ahmed, Costas Iliopoulos, A. S. Islam, and M. Sohel Rahman, The swap matching problem revisited. Theoretical Computer Science, Elsevier, 557(6), :34-49, 2014
31. M. Crochemore, A. Langiu, and M. Sohel Rahman, Indexing a sequence for mapping reads with a single mismatch. Phil. Trans. R. Soc. A, Royal Society, 372:20130167, 2014
30. A.H.M.M Rahman, and M. Sohel Rahman, Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems. Journal of Computers, Academy Publisher, 9(8), :1743-1754, 2014
29. M. Tasnim, Shahriar Rouf, and M. Sohel Rahman, A CLONALG-based Approach for the Set Covering Problem. Journal of Computers, Academy Publisher, 9(8), :1787-1795, 2014
28.
27. S.B. Ahsan, S.P Aziz, and M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings. Journal of Computers, Academy Publisher, 9(8), :1769-1775, 2014
26. 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
25. Md. Shaifur Rahman, and Mahmuda Naznin, Shortening the Tour-Length of a Mobile Data Collector in the WSN by the Method of Linear Shortcut. In Proceedings of The 15th Asia-Pacific Web Conference (APWeb), LNCS, Springer, Australia, pages 674-685, 2013
24. Pritom Ahmed, A. S. Islam, and M. Sohel Rahman, A graph-theoretic model to solve the approximate string matching problem allowing for translocations. Journal of Discrete Algorithms, Elsevier, 23:143-156, 2013
23. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, and M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms. International Journal on Digital Libraries, 2012
22. M. Crochemore , C. Iliopoulos, M. Kubica, and 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
21. T. 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
20. E. Farhana, and M. Sohel Rahman, Efficient Algorithm for Restricted LCS Problem. In Proceedings of 4th International Conference on Bioinformatics and Computational Biology (BiCOB), pages 51-56, 2012
19. Tanveer Awal, and 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
18. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. Fundamenta Informaticae, :1–12, 2012
17. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides, Acyclic Coloring with Few Division Vertices. In Proceedings of IWOCA 2012, Lecture Notes in Computer Science, 7643, Springer, pages 86 - 99, 2012
16. Muhammad Abdullah Adnan, Zonohedra, Zone Graphs, and Their Linear Area Straight Line Grid Drawings. In Proceedings of Workshop on Graph Drawing and Graph Algorithms (GDGA), Dhaka, Bangladesh, 2012
15. S. Sharmin, J. A. Telle, M. Vatshelle, and E. M. Hvidevold, Finding good decompositions for dynamic programming on dense graphs. In Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, Springer, LNCS 7112, Germany, pages 219-231, 2011
14. Tanveer Awal, and Md. Saidur Rahman, A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs. INFOCOMP Journal of Computer Science, 9(2), :39-48, 2010
13. Tanveer Awal, and Md. Saidur Rahman, A linear algorithm for resource four-partitioning four-connected planar Graphs. In Proceedings of ICECE 2010, pages 526 - 529, 2010
12. Nurjahan Begum, Samia Tasnim, and Mahmuda Naznin, Efficient Query Processing in Sensor Network Using Multi-commodity Flow Network. In Proceedings of The 17th IEEE International Conference on Industrial Engineering and Management, IEEE, China, 2010
11. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Generating all distributions of objects to bins. International Journal of Computer Mathematics,, 86(3):383 - 392, 2009
10. Masud Hasan, S. Hossain, M. M. Rahman, and M. Sohel Rahman, An Optical Solution for the Subset Sum Problem. In Proceedings of the Fourth International Workshop on Natural Computing (IWNC), pages 165-173, 2009
9. Mohammad Tanvir Parvez, Md. Saidur Rahman, and Shin-ichi Nakano, Generating all triangulations of plane graphs. In Proceedings of WALCOM 2009, Lecture Notes in Computer Science, 5431, Springer, pages 151-164, 2009
8. Md. Shariful Islam Bhuyan, and Md. Saidur Rahman, Efficient Generation of Combinatorial Families. In Proceedings of 11th International Conference on Computer and Information Technology (ICCIT 2008), IEEE Xplore, pages 25-30, 2008
7. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions. International Journal of Computer Mathematics,, 84(7):953-965, 2007
6. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Efficient generation of evolutionary trees. INFOCOMP Journal of Computer Science,, 6(1):30-36, 2007
5. Mahmuda Naznin, Paul Juell, Kendall E. Nygard, and Karl Altenburg, A Clustering Heuristic by Effective Neighbor Selection. In Proceedings of The 40th Annual Midwest Instructional and Computing Symposium (MICS), ND, USA, pages 6, 2007
4. Muhammad Abdullah Adnan, Distribution of distinguishable objects to bins: generating all distributions. In Proceedings of Workshop on Algorithms and Computation (WALCOM), Dhaka, Bangladesh, 2007
3. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Efficient generation of evolutionary trees. In Proceedings of International Conference on Information and Communication Technology (ICICT 2007), Dhaka, Bangladesh, pages 6, 2007
2. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Distribution of objects to bins: generating all distributions. In Proceedings of Proc. of 9th International Conference on Computer and Information Technology (ICCIT 2006), pages 297-302, 2006
1. Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Mathematics in Computer Science (MCS), 3(4), :433-442,

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@cse.buet.ac.bd with questions or comments on this page.  [Development Credits]