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


  Algorithms and Theory:
test summary

  Research Fields:

Algorithms
Computational Complexity
Graph Theory
Stringology
Graph Drawing

  Research Groups:

Graph Drawing Research Group

  Related Faculties:

Dr. M. Kaykobad
Dr. Md. Saidur Rahman
Dr. Masud Hasan
Dr. M. Sohel Rahman

  Related Links:

http://cse.buet.ac.bd/research/group/gd/

  Recent Publications:

146. Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman, and Debajyoti Mondal, A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs. J. Graph Algorithms Appl., 21(3), :341-352, 2017
145. 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
144. S. Ahmed, and Md. Saidur Rahman, Multi-interval Pairwise Compatibility Graphs. In Proceedings of Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer, Bern, Switzerland, pages 71-84, 2017
143. Ali Alatabbi, Alessio Langiu, and M. Sohel Rahman, Algorithms for Longest Common Abelian Factors. International Journal of Foundations of Computer Science, World Scientific, :To Appear, 2016
142. Md. Iqbal Hossain, and Md. Saidur Rahman, A necessary condition and a sufficient condition for pairwise compatibility graphs. In Proceedings of WALCOM 2016, Springer, Lecture Notes in Computer Science, 9627, pages 107-113, 2016
141. Ali Alatabbi, A. S. Islam, M. Sohel Rahman, Jamie Simpson, and William Smyth, Enhanced covers of regular and indeterminate strings using prefix tables. J. Automata, Languages and Combinatorics, :To Appear, 2016
140. Frantisek Franek, A. S. Islam, M. Sohel Rahman, and William Smyth, Algorithms to compute the Lyndon array. In Proceedings of Prague Stringology Conference, Czech Republic, pages 172-184, 2016
139. 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
138. 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
137. F. T. Zohora, and M. Sohel Rahman, "An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.". Theoretical Computer Science, 2016
136. Md. Shaifur Rahman, Mahmuda Naznin, and T. Ahmed, Efficient Routing in a Sensor Network Using Collaborative Ants. In Proceedings of The 7th International Conference on Swarm Intelligence, LNCS, Springer, Bali, Indonesia, 2016
135. Ali Alatabbi, Jackie Daykin, M. Sohel Rahman, and William Smyth, V-order: new combinatorial properties and a simple on-line comparison algorithm. Discrete Applied Mathematics, Elsevier, :To Appear, 2016
134. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Computing Covers Using Prefix Tables. Discrete Applied Mathematics, Elsevier, 212:2-9, 2016
133. Sumaiya Iqbal, M. Kaykobad, and M. Sohel Rahman, Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm and Evolutionary Computation, Elsevier, 24(-), :50-64, 2015
132. Effat Farhana, and M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology. Information Sciences, Elsevier, 295:247-257, 2015
131. Md. Khaledur Rahman, and M. Sohel Rahman, Prefix and suffix transreversals on binary and ternary strings. Journal of Discrete Algorithms, Elsevier, 33:160-170, 2015
130. Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, and M. Sohel Rahman, Order preserving pattern matching revisited. Pattern Recognition Letters, 55:15-21, 2015
129. S.M. Ferdous, and M. Sohel Rahman, An Integer Programming Formulation of the Minimum Common String Partition Problem. PLOS One, PLOS, 10(7), :e0130266, 2015
128. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms, Elsevier, 32(-), :6-13, 2015
127. Md. Iqbal Hossain, and Md. Saidur Rahman, Straight-Line Monotone Grid Drawings of Series-Parallel Graphs. Discrete Mathematics, Algorithms and Applications, World Scientific, 7(2), 2015
126. Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman, On graphs that are not PCGs. Theoretical Computer Science, Elsevier, 571:78-87, 2015
125. 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
124. Masud Hasan, Atif Hasan Rahman, Md. Khaledur Rahman, M. Sohel Rahman, Mahfuza Sharmin, and Rukhsana Yeasmin, Pancake flipping and sorting permutations. Journal of Discrete Algorithms, Elsevier, 33:139-149, 2015
123. Md. Iqbal Hossain, and Md. Saidur Rahman, Good spanning trees in graph drawing. Theoretical Computer Science, 607:149-165, 2015
122. Ali Alatabbi, J. W. Daykin, M. Sohel Rahman, and W.F. Smyth, Simple Linear Comparison of Strings in V-Order. Fundamenta Informaticae, To Appear2015
121.
120. 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
119. 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
118. 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
117. Md. Sazzadur Rahaman, Tousif Ahmed, Sad Al Abdullah, and Md. Saidur Rahman, Antibandwidth problem for itchy caterpillars. In Proceedings of International Conference on Informatics, Electronics & Vision (ICIEV), 2014, IEEE, Dhaka, pages 1-6, 2014
116. Md. Iqbal Hossain, and Md. Saidur Rahman, Monotone Grid Drawings of Planar Graphs. In Proceedings of FAW 2014, Springer, Lecture Notes in Computer Science, 8497, pages 105-116, 2014
115. Shaheena Sultana, Md. Saidur Rahman, Arpita Roy, and Suraiya Tairin, Bar 1-Visibility Drawings of 1-Planar Graphs. In Proceedings of ICAA 2014, Springer, Lecture Notes in Computer Science, 8321, 2014
114. K. M. Shahriar, and Md. Saidur Rahman, Bichromatic Point-Set Embeddings of Trees with Fewer Bends. In Proceedings of WALCOM 2014, Springer, Lecture Notes in Computer Science, 8344, pages 337-348, 2014
113. 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
112. Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, and M. Sohel Rahman, Order Preserving Prefix Tables. In Proceedings of International Symposium on String Processing and Information Retrieval (SPIRE), LNCS, pages 111-116, 2014
111. M. Sohel Rahman, M. Kaykobad, and J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths. The Scientific World Journal, 2014:ID: 743431, 2014
110. 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
109. N. Khan, N. Karima, Md. Saidur Rahman, and Md. Iqbal Hossain, Orthogonal grid pointset embeddings of maximal outerplanar graphs. In Proceedings of International Conference on Electrical Engineering and Information & Communication Technology (ICEEICT), 2014, IEEE, Dhaka, pages 1-6, 2014
108. Amit Kumar Dutta, Masud Hasan, and M. Sohel Rahman, Prefix transpositions on binary and ternary strings. Information Processing Letters, 113(8), :265-270, 2013
107. Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman, On Graphs That Are Not PCGs. In Proceedings of WALCOM 2013, Lecture Notes in Computer Science, 7748, Springer, pages 310-321, 2013
106. 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
105. T.M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, and Rezwana Reaz Rimpi, Inferring Strings from Cover Arrays. Discrete Mathematics, Algorithms and Applications (DMAA), World Scientific, 5(2), 2013
104. 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
103. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides, Acyclic coloring with few division vertices. J. Discrete Algorithms, 23:42-53, 2013
102. Md. Manzurul Hasan, Md. Saidur Rahman, and Muhammad Rezaul Karim, Box-Rectangular Drawings of Planar Graphs. Jounal of Graph Algorithms and Applications, 17(6), :629-646, 2013
101. Sammi Abida Salma, Md. Saidur Rahman, and Md. Iqbal Hossain, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. Journal of Graph Algorithms and Applications (JGAA), 17(2), :81-102, 2013
100. Johra Muhammad Moosa, M. Sohel Rahman, and F. T. Zohora, Computing a Longest Common Subsequence that is Almost Increasing on Sequences Having No Repeated Elements. Journal of Discrete Algorithms, Elsevier, Volume 20:12-20, 2013
99. 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
98. M.T.I Aumi, M.T. Moosa, and M. Sohel Rahman, Pattern Matching in Indeterminate and Arc-Annotated Sequences. Recent Patents on DNA and Gene Sequences, Bentham Science, 7(2), :96-104, 2013
97. S. Sharmin, and F. Manne, Efficient Counting of Maximal Independent sets in Sparse Graphs. In Proceedings of the 12th International Symposium on Experimental Algorithms, SEA’2013,, Springer, LNCS 7933, pages 103-114, 2013
96. S.M. Ferdous, and M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants. In Proceedings of International Conference on Swarm Intelligence (LNCS 7929), Springer, China, pages 306-313, 2013
95. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. In Proceedings of IWOCA, 2012
94. 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
93. J. S. Firoz, M. Sohel Rahman, and T. K. Saha, Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data. In Proceedings of GECCO, 2012
92. Sammi Abida Salma, and Md. Saidur Rahman, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 7157, Springer, pages 112-123, 2012
91. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. Fundamenta Informaticae, :1–12, 2012
90. S.M. Ferdous, Anindya Das, M. Sohel Rahman, and Md. Mustafizur 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, Dhaka, Bangladesh, pages 741-746, 2012
89. 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
88. 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
87. Sumaiya Iqbal, and M. Sohel Rahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS. In Proceedings of ICECE, 2012
86. Sumaiya Nazeen, Tanaeem M Moosa, M. Sohel Rahman, and Rezwana Reaz Rimpi, Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet. In Proceedings of WALCOM, LNCS, Bangladesh, pages 160-172, 2012
85. Md. Rezaul Karim, Md. Jawaherul Alam, and Md. Saidur Rahman, On Some Properties of Doughnut Graphs. In Proceedings of IWOCA 2012, Lecture Notes in Computer Science, 7643, Springer, pages 60-64, 2012
84. 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
83. Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman, Acyclic colorings of graph subdivisions revisited. Journal of Discrete Algorithms, 16:90-103, 2012
82. Abu Reyan Ahmed, Md. Mazharul Islam, and Md. Saidur Rahman, On acyclic colorings of graphs. In Proceedings of 15th International Conference on Computer and Information Technology (ICCIT 2012), pages 95-100, 2012
81. 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, Elsevier, 17:67-73, 2012
80. 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
79. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, and M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms. International Journal on Digital Libraries, 2012
78. 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
77. Sumaiya Nazeen, M. Sohel Rahman, and Rezwana Reaz Rimpi, Indeterminate string inference algorithms. Journal of Discrete Algorithms, 10:23-34, 2012
76. Mohammad Tanvir Parvez, Md. Saidur Rahman, and Shin-ichi Nakano, Generating all triangulations of plane graphs. Journal of Graph Algorithms and Applications, :457-482, 2011
75. Masud Hasan, S. M. S. Hossain, M. M. 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
74. S. B. Ahsan, T. 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), :48-55, 2011
73. A. Dumitrescu, and Masud Hasan, Cutting Out Polygons with a Circular Saw. In Proceedings of In Proc. 22nd International Symposium on Algorithms and Computation, LNCS,Springer, Yokohama, Japan., pages 230-239, 2011
72. 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, pages 219-231, 2011
71. Tonmoy Guha Roy, Sourabh Aryabhatta, Md. Mohsin Uddin, and Md. Saidur Rahman, On Graceful Labelings of Trees. In Proceedings of WALCOM, Lecture Notes in Computer Science, 6552, Springer, pages 214-220, 2011
70. S.I. Ahmed, Masud Hasan, and M.A. Islam, Cutting a Convex Polyhedron out of a Sphere. Graphs and Combinatorics, Springer, 27(3), :307-319, 2011
69. Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman, Acyclic Colorings of Graph Subdivisions. In Proceedings of International Workshop on Combinatorial Algorithms (IWOCA)., 2011
68. T.C. Biedl, Masud Hasan, and Alejandro Lopez-Ortiz, Efficient viewpoint selection for silhouettes of convex polyhedra. Comutational Geometry: Theory and Application, Elsevier, 44(8), :399-408, 2011
67. T.C. Biedl,, Masud Hasan, and A. Lopez-Ortiz, Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections. International Journal of Computational Geometry and Applications, World Scientific, 22(2), :215-239, 2011
66. J.S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time. Journal of Computational Biology, Mary Ann Liebert, Inc. publishers, USA, 18(8), :1007-1011, 2011
65. 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
64. Masud Hasan, Non-)Equiprojectivity and (Non-)Biprojectivity of Simplicial Polyhedra. In Proceedings of 20th Annual Fall Workshop on Computational Geometry (FWCG 2010),, Stony Brook, NY, USA,, 2010
63. M. A. Wahid, M. Kaykobad, and Masud Hasan, Kinetisation of view of 3D point set. In Proceedings of International Conference on Computer and Information Technology (ICCIT), Dhaka,Bangladesh, pages 325-330, 2010
62. 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
61. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving the Generalized Subset Sum Problem with a Light Based Device. Natural Computing, 10(1), :541-550, 2010
60. Md. Mostofa Ali Patwary, and Md. Saidur Rahman, Minimum Face-Spanning Subgraphs of Plane Graphs. AKCE International Journal of Graphs and Combinatorics, 7(2):133-150, 2010
59. Mahfuza Sharmin, R. Yeasmin, Masud Hasan, A. Rahman, and M. Sohel Rahman, Pancake Flipping with Two Spatulas. In Proceedings of ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics, pages 231-238, 2010
58. 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
57. S.I. Ahmed, Masud Hasan, and A. Sopan, Vindictive Voronoi games and stabbing Delaunay circles. In Proceedings of International Symposium on Voronoi Diagram in Science and Engineering, Quebec City, Canada, pages 124-131, 2010
56. M.R Islam, M. Sohel Rahman, Masud Hasan, and M.M. Hasan, IMIPS: An improved pipelined processor architecture with reduced branch penalty and single memory for instruction and data. In Proceedings of International International Conference on Computer Engineering and Applications (, Bali Island, Indonesia, 2010
55. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem with a Light-Based Device. In Proceedings of International Conference on Electrical and Computer Engineering (ICECE), pages 423 - 426, 2010
54. M. Crochemore, Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Two dimensional Range Minimum/Maximum Query revisited. In Proceedings of 13th International Conference on Computer and Information Technology (ICCIT), pages 27 - 32, 2010
53. S. B. Ahsan, T. M. Moosa, M. Sohel Rahman, and Shampa Shahriyar, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded (Conference. In Proceedings of Mini-conference on Applied Theoretical Computer Science, MATCOS, pages 366-369, 2010
52. Masud Hasan, S. Hossain, and M.M.M. Rahman, Solving the minimum hitting set problem with a light-based device. In Proceedings of International Conference on Electrical and Computer (ICECE), Dhaka,Bangladesh, pages 423-426, 2010
51. J. S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Conference. In Proceedings of WALCOM, 2010
50. 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
49. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, and Md. Saidur Rahman, Pairwise compatibility graphs. Journal of Applied Mathematics and Computing, 30:479-503, 2009
48. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Generating all distributions of objects to bins. International Journal of Computer Mathematics,, 86(3):383 - 392, 2009
47. S.I. Ahmed, Masud Hasan, and M.A. Islam, Cutting a Convex Polygon Out of a Circle. International Journal of Recent Trends in Engineering, Academy Publisher, 2(1), :88-92, 2009
46. 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
45. M.M.M. Khan, A.K. Biswas, S. Chowdhury, Masud Hasan, and A.I. Khan, Synthesis of GF(3) based ternary reversible/quantum logic circuits without ancillary qutrits. In Proceedings of International Symposium on Multi-Valued Logic 2009, Okinawa, Japan, 2009
44. Atif Rahman, Mahmuda Naznin, and Masud Hasan, Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications. In Proceedings of International Conference on Electronics and Computer Technology, IEEE, Macau, China, pages 215-218, 2009
43. M. M. Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum Neighbour Voronoi Games. In Proceedings of WALCOM, pages 93-104, 2009
42. M. Ahmed, S.M.H Chowdhury, and Masud Hasan, Fast preemptive task scheduling algorithm for homogeneous and heterogeneous distributed memory systems. In Proceedings of ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, Phuket, Thailand, 2008
41. S Shatabda, and Masud Hasan, An approximation algorithm for sorting by reversals and transpositions. Journal of Discrete Algorithms, Elsevier, 6(3), :449-457, 2008
40. Masud Hasan, and A Lubiw, Equiprojective polyhedra. Computational Geometry: Theory and Applications, Elsevier, 40(2), :148-155, 2008
39. Md. Muhibur Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum neighbor Voronoi games. In Proceedings of Annual Workshop on Algorithms and Computation (WALCOM 2009), LNCS, Kolkata, India, 2008
38. 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
37. Masud Hasan, M.M. Hossain, S. Nusrat, and A. Lopez-Ortiz, Smallest and some new equiprojective polyhedra. In Proceedings of International Conference on Computer and Information Technology, Khulna, Bangladesh,, 2008
36. Md. Rezaul Karim, and Md. Saidur Rahman, Four-Connected Spanning Subgraphs of Doughnut Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 4921, Springer, pages 132-143, 2008
35. M. R. Rahman, Md. A. Kashem, and Md. Ehtesamul Haque, An Efficient On-Line Algorithm for Edge-Ranking of Trees. INFOCOMP Journal of Computer Science, 7(2), :21-25, 2008
34. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, and Md. Saidur Rahman, Pairwise compatibility graphs. In Proceedings of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer, pages 222-233, 2008
33. S. Sharmin, Md. Monirul Islam, D. Barua, and A. Mahmood, Graph Matching Recombination for Evolving Neural Networks. In Proceedings of the European Symposium on Artificial Neural Networks, ESANN’2007, Springer, LNCS 4492, pages 562-568, 2007
32. 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
31. 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
30. Muhammad Abdullah Adnan, Distribution of distinguishable objects to bins: generating all distributions. In Proceedings of Workshop on Algorithms and Computation (WALCOM), Dhaka, Bangladesh, 2007
29. 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
28. M. R. Rahman, Md. Ehtesamul Haque, M. Islam, and Md. A. Kashem, On-Line Algorithms for Vertex-Rankings of Graphs. In Proceedings of Proc. of the International Conference on Information and Communication Technology (ICICT 2007), Dhaka, pages 22-26, 2007
27. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Efficient generation of evolutionary trees. INFOCOMP Journal of Computer Science,, 6(1):30-36, 2007
26. 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
25. Tanzima Hashem, and Md. Abul Kashem Mia, A Linear-Time Approximation Algorithm for Edge-Ranking of Series-Parallel Graphs. In Proceedings of 9th International Conference on Computer and Information Technology (ICCIT), Bangladesh,, pages 39-44, 2006
24. Tanzima Hashem, Utpal Kumar Paul, and Md. Abul Kashem Mia, An Algorithm for c-Vertex-Ranking of Starlike Graphs. In Proceedings of 4th International Conference on Electrical and Computer Engineering (ICECE), Bangladesh, pages 316-319, 2006
23. M. R. Rahman, Md. A. Kashem, and Md. Ehtesamul Haque, An On-Line Algorithm for Edge-Ranking of Trees. In Proceedings of Proc. of the 9th International Conference on Computer and Information Technology, IUB, Bangladesh, pages 51-54, 2006
22. A. Khan, N. Nusrat, S.M. Khan, and Masud Hasan, Novel realization of some ternary circuits for quantum computing. In Proceedings of IEEE TENCON, Hong Kong, 2006
21. A Khan, N. Shahriar, S.M. Khan, and Masud Hasan, Novel realization of quantum ternary mux and demux. In Proceedings of . International Conference on Electrical and Compute Engineering, Dhaka, Bangladesh, 2006
20. M. Sohel Rahman, M. Kaykobad, and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths. In Proceedings of 0th International Conference on Computers and Their Applications (CATA), 2005
19. A. Bhattacharjee, Md. R. Uddin, and B. K. Debnath, DQA: Automata with new Memories, Properties and Applications. In Proceedings of 8th International Conference on Computer and Information Technology, Dhaka, Bangladesh, 2005
18. A. Bhattacharjee, and S. A. Quader, A New Approach to File Encryption and Compression. In Proceedings of 8th International Conference on Computer and Information Technology, Dhaka, bangladesh, 2005
17. Utpal Kumar Paul, Tanzima Hashem, and Md. Abul Kashem Mia, An Algorithm for c-Edge-Ranking of a Starlike Graph. In Proceedings of 8th International Conference on Computer and Information Technology, Bangladesh, pages 886-891, 2005
16. A. Bhattacharjee, and B. K. Debnath, Queue Automata. In Proceedings of 7th International Conference on Computer and Information Technology, Dhaka, Bangladesh., 2004
15. Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, A linear algorithm for compact box-drawing of trees. Networks, Wiley, 42(3), :160-163, 2003
14. Md. Saidur Rahman, Takao Nishizeki, and Mahmuda Naznin, Orthogonal Drawings of Plane Graphs. Journal of Graph Algorithms and Applications (JGAA), 7(4), :335-362, 2003
13. Md. Saidur Rahman, Mahmuda Naznin, and Takao Nishizeki, Orthogonal drawings of plane graphs without bends. In Proceedings of International Conference on Graph Drawing, LNCS, Springer, Austria, pages 392-406, 2003
12. M. Kaykobad, Asif-ul Haque , Mohammad Saifur Rahman, and M. Sohel Rahman, On Average Length of Cycle in a Complete Graph. In Proceedings of International Conference on Computer and Information Technology, pages 47-49, 2002
11. A. H. Tamal, M. S. Rahman, M. Sohel Rahman, and M. Kaykobad, On Average Length of Cycles in Complete Graphs. In Proceedings of 5th International Conference on Computer and Information Technology (ICCIT), pages 47-49, 2002
10. M. A. Kashem, and M.A.H. Newton, Parallel Algorithm for Optimal c-Vertex-Ranking of Permutation Graphs. In Proceedings of nternational Conference on Computer and Information Technology, pages 55-60, 2002
9. Md. Abul Kashem Mia, and Mohammed Eunus Ali, A Parallel Algorithm for Generalized Vertex Colorings of Partial k-Trees. In Proceedings of 5th International Conference on Computer and Information Technology (ICCIT),, Dhaka, Bangladesh, pages 61-66, 2002
8. Abu Wasif, and Mofizur Rahman Chowdhury, Construction of Classification Trees by the Criterion of Attribute Dependency. Journal of Electrical Engineering, Bangladesh, 1999
7. Abu Wasif, and Mofizur Rahman Chowdhury, Application of Dynamic Programming Principle inDecision Tree Construction. Journal of Computer Science and Informatics, India, 1999
6. M. A. Kashem, and M.A.H. Newton, An efficient algorithm for optimal vertex-ranking of permutation graphs. In Proceedings of International Conference on Computer and Information Technology, Dhaka, Bangladesh, pages 315-320, 1999
5. Abu Wasif, and Mofizur Rahman Chowdhury, Construction of Decision Trees by Using the Criterion of Class-dependency. In Proceedings of International Conference on Computer and Information Technology, Dhaka, 1998
4. Abu Wasif, and Mofizur Rahman Chowdhury, Increasing the Performance of Classification Trees by Using a Mixed Criterion of Attribute Dependency and Gain Ratio. In Proceedings of International Conference on Computer and Information Technology, Dhaka, 1998
3. M Khan, Quantum realization of some quaternary circuits.
2. 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,
1. A. S. Islam, and M. Sohel Rahman, On the protein folding problem in 2D-triangular lattices. Algorithms for Molecular Biology, BMC, 8(30),

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]