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:
149. Shaheena Sultana, Md. Iqbal Hossain, Md. Saidur Rahman, Nazmun Nessa Moon, and Tahsina Hashem, On triangle cover contact graphs. Computational Geometry: Theory and Applications, 69:3138, 2018 
148. 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), :341352, 2017 
147. 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, colocated with ACM SIGCOMM, UCLA, USA, 2017 
146. S. Ahmed, and Md. Saidur Rahman, Multiinterval Pairwise Compatibility Graphs. In Proceedings of Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer, Bern, Switzerland, pages 7184, 2017 
145. Sujoy Das, S. Sharmin, and Md. Saidur Rahman, Proactive Humanitarian Aid Networks with Guided Topology and SmallWorld Effect. In Proceedings of The fifth IEEE Region 10 (Asia Pacific) Humanitarian Technology Conference (R10HTC) 2017, IEEE Explore, Dhaka, Bangladeh, 2017 
144. Katsuhisa Yamanaka, Md. Saidur Rahman, and ShinIchi Nakano, Floorplans with Columns. In Proceedings of COCOA 2017, Springer, Lecture Notes in Computer Science, 10627, pages 3340, 2017 
143. 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 
142. Ali Alatabbi, Jackie Daykin, M. Sohel Rahman, and William Smyth, Vorder: new combinatorial properties and a simple online comparison algorithm. Discrete Applied Mathematics, Elsevier, :To Appear, 2016 
141. 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 
140. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Computing Covers Using Prefix Tables. Discrete Applied Mathematics, Elsevier, 212:29, 2016 
139. 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 
138. F. T. Zohora, and M. Sohel Rahman, "An efficient algorithm to detect common ancestor genes for nonoverlapping inversion and applications.". Theoretical Computer Science, 2016 
137. 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 107113, 2016 
136. 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 
135. 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 172184, 2016 
134. 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 274285, 2016 
133. Ali Alatabbi, J. W. Daykin, M. Sohel Rahman, and W.F. Smyth, Simple Linear Comparison of Strings in VOrder. Fundamenta Informaticae, To Appear2015 
132. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms, Elsevier, 32(), :613, 2015 
131. Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman, On graphs that are not PCGs. Theoretical Computer Science, Elsevier, 571:7887, 2015 
130. Md. Iqbal Hossain, and Md. Saidur Rahman, StraightLine Monotone Grid Drawings of SeriesParallel Graphs. Discrete Mathematics, Algorithms and Applications, World Scientific, 7(2), 2015 
129. Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, and M. Sohel Rahman, Order preserving pattern matching revisited. Pattern Recognition Letters, 55:1521, 2015 [paper link]. 
128. Effat Farhana, and M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology. Information Sciences, Elsevier, 295:247257, 2015 
127. Sumaiya Iqbal, M. Kaykobad, and M. Sohel Rahman, Solving the multiobjective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm and Evolutionary Computation, Elsevier, 24(), :5064, 2015 
126. 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 
125. 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:139149, 2015 
124. Md. Khaledur Rahman, and M. Sohel Rahman, Prefix and suffix transreversals on binary and ternary strings. Journal of Discrete Algorithms, Elsevier, 33:160170, 2015 
123. Md. Iqbal Hossain, and Md. Saidur Rahman, Good spanning trees in graph drawing. Theoretical Computer Science, 607:149165, 2015 
122. Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, and Md. Saidur Rahman, On Triangle Cover Contact Graphs. WALCOM 2015: 323328. In Proceedings of WALCOM 2015, Springer, Lecture Notes in Computer Science, 8973, pages 323328, 2015 
121. K. M. Shahriar, and Md. Saidur Rahman, Bichromatic PointSet Embeddings of Trees with Fewer Bends. In Proceedings of WALCOM 2014, Springer, Lecture Notes in Computer Science, 8344, pages 337348, 2014 
120. Shaheena Sultana, Md. Saidur Rahman, Arpita Roy, and Suraiya Tairin, Bar 1Visibility Drawings of 1Planar Graphs. In Proceedings of ICAA 2014, Springer, Lecture Notes in Computer Science, 8321, 2014 
119. 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 105116, 2014 
118. 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 16, 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 16, 2014 
116. 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 111116, 2014 [paper link]. 
115. Pritom Ahmed, Costas Iliopoulos, A. S. Islam, and M. Sohel Rahman, The swap matching problem revisited. Theoretical Computer Science, Elsevier, 557(6), :3449, 2014 
114. M. Sohel Rahman, M. Kaykobad, and J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths. The Scientific World Journal, 2014:ID: 743431, 2014 
113. 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 
112. 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), :17431754, 2014 
111. M. Tasnim, Shahriar Rouf, and M. Sohel Rahman, A CLONALGbased Approach for the Set Covering Problem. Journal of Computers, Academy Publisher, 9(8), :17871795, 2014 
110. 
109. S.B. Ahsan, S.P Aziz, and M. Sohel Rahman, Longest Common Subsequence Problem for RunLengthEncoded Strings. Journal of Computers, Academy Publisher, 9(8), :17691775, 2014 
108. 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 310321, 2013 
107. Sammi Abida Salma, Md. Saidur Rahman, and Md. Iqbal Hossain, TriangleFree Outerplanar 3Graphs are Pairwise Compatibility Graphs. Journal of Graph Algorithms and Applications (JGAA), 17(2), :81102, 2013 
106. Amit Kumar Dutta, Masud Hasan, and M. Sohel Rahman, Prefix transpositions on binary and ternary strings. Information Processing Letters, 113(8), :265270, 2013 
105. Muhammad Rashed Alam, and M. Sohel Rahman, A divide and conquer approach and a workoptimal parallel algorithm for the LIS problem. Information Processing Letters, 113(13), :470476, 2013 
104. Md. Shaifur Rahman, and Mahmuda Naznin, Shortening the TourLength of a Mobile Data Collector in the WSN by the Method of Linear Shortcut. In Proceedings of The 15th AsiaPacific Web Conference (APWeb), LNCS, Springer, Australia, pages 674685, 2013 
103. 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 306313, 2013 
102. 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:1220, 2013 
101. Md. Manzurul Hasan, Md. Saidur Rahman, and Muhammad Rezaul Karim, BoxRectangular Drawings of Planar Graphs. Jounal of Graph Algorithms and Applications, 17(6), :629646, 2013 
100. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides, Acyclic coloring with few division vertices. J. Discrete Algorithms, 23:4253, 2013 
99. Pritom Ahmed, A. S. Islam, and M. Sohel Rahman, A graphtheoretic model to solve the approximate string matching problem allowing for translocations. Journal of Discrete Algorithms, Elsevier, 23:143156, 2013 
98. 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 
97. M.T.I Aumi, M.T. Moosa, and M. Sohel Rahman, Pattern Matching in Indeterminate and ArcAnnotated Sequences. Recent Patents on DNA and Gene Sequences, Bentham Science, 7(2), :96104, 2013 
96. 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, Rome, Italy, pages 103114, 2013 
95. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, and M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms. International Journal on Digital Libraries, 2012 
94. 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:2334, 2012 
93. T. M. Moosa, and M. Sohel Rahman, Improved Algorithms for the PointSet Embeddability problem for Plane 3Trees. Discrete Mathematics, Algorithms and Applications (DMAA), 4(1), 2012 
92. Sumaiya Nazeen, M. Sohel Rahman, and Rezwana Reaz Rimpi, Indeterminate string inference algorithms. Journal of Discrete Algorithms, 10:2334, 2012 
91. 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 
90. Sammi Abida Salma, and Md. Saidur Rahman, TriangleFree Outerplanar 3Graphs are Pairwise Compatibility Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 7157, Springer, pages 112123, 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 5156, 2012 
88. Tanveer Awal, and Md. Saidur Rahman, A Linear Algorithm for Resource Fourpartitioning Fourconnected Planar Graphs. AKCE International Journal of Graphs and Combinatorics, 9(1), :1120, 2012 
87. 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 160172, 2012 
86. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. In Proceedings of IWOCA, 2012 
85. Sumaiya Iqbal, and M. Sohel Rahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS. In Proceedings of ICECE, 2012 
84. 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 741746, 2012 
83. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. Fundamenta Informaticae, :1–12, 2012 
82. 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 
81. 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 6064, 2012 
80. Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman, Acyclic
colorings of graph subdivisions revisited. Journal of Discrete Algorithms, 16:90103, 2012 
79. 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 95100, 2012 
78. 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:6773, 2012 
77. 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 
76. Mohammad Tanvir Parvez, Md. Saidur Rahman, and Shinichi Nakano, Generating all triangulations of plane graphs. Journal of Graph Algorithms and Applications, :457482, 2011 
75. 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), :4855, 2011 
74. 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(12), :125140, 2011 
73. 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 
72. 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 214220, 2011 
71. 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), :10071011, 2011 
70. T.C. Biedl, Masud Hasan, and Alejandro LopezOrtiz, Efficient viewpoint selection for silhouettes of convex polyhedra. Comutational Geometry: Theory and Application, Elsevier, 44(8), :399408, 2011 
69. T.C. Biedl,, Masud Hasan, and A. LopezOrtiz, Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections. International Journal of Computational Geometry and Applications, World Scientific, 22(2), :215239, 2011 
68. S.I. Ahmed, Masud Hasan, and M.A. Islam, Cutting a Convex Polyhedron out of a Sphere. Graphs and Combinatorics, Springer, 27(3), :307319, 2011 
67. 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 230239, 2011 
66. 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 219231, 2011 
65. Tanveer Awal, and Md. Saidur Rahman, A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs. INFOCOMP Journal of Computer Science, 9(2), :3948, 2010 
64. Md. Mostofa Ali Patwary, and Md. Saidur Rahman, Minimum FaceSpanning Subgraphs of Plane Graphs. AKCE International Journal of Graphs and Combinatorics, 7(2):133150, 2010 
63. 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), :541550, 2010 
62. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem with a LightBased Device. In Proceedings of International Conference on Electrical and Computer Engineering (ICECE), pages 423  426, 2010 
61. 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 
60. 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 231238, 2010 
59. 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 Miniconference on Applied Theoretical Computer Science, MATCOS, pages 366369, 2010 
58. 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 
57. 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 325330, 2010 
56. Masud Hasan, S. Hossain, and M.M.M. Rahman, Solving the minimum hitting set problem with a lightbased device. In Proceedings of International Conference on Electrical and Computer (ICECE), Dhaka,Bangladesh, pages 423426, 2010 
55. 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 
54. 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 124131, 2010 
53. 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 
52. Tanveer Awal, and Md. Saidur Rahman, A linear algorithm for resource fourpartitioning
fourconnected planar Graphs. In Proceedings of ICECE 2010, pages 526  529, 2010 
51. Nurjahan Begum, Samia Tasnim, and Mahmuda Naznin, Efficient Query Processing in Sensor Network Using Multicommodity Flow Network. In Proceedings of The 17th IEEE International Conference on Industrial Engineering and Management, IEEE, China, 2010 
50. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, and Md. Saidur Rahman, Pairwise compatibility graphs. Journal of Applied Mathematics and Computing, 30:479503, 2009 
49. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Generating all distributions of objects to bins. International Journal of Computer Mathematics,, 86(3):383  392, 2009 
48. 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 165173, 2009 
47. M. M. Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum Neighbour Voronoi Games. In Proceedings of WALCOM, pages 93104, 2009 
46. 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), :8892, 2009 
45. 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 215218, 2009 
44. 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 MultiValued Logic 2009, Okinawa, Japan, 2009 
43. Mohammad Tanvir Parvez, Md. Saidur Rahman, and Shinichi Nakano, Generating all
triangulations of plane graphs. In Proceedings of WALCOM 2009, Lecture Notes in Computer Science, 5431, Springer, pages 151164, 2009 
42. M. R. Rahman, Md. A. Kashem, and Md. Ehtesamul Haque, An Efficient OnLine Algorithm for EdgeRanking of Trees. INFOCOMP Journal of Computer Science, 7(2), :2125, 2008 
41. Md. Rezaul Karim, and Md. Saidur Rahman, FourConnected Spanning Subgraphs of Doughnut Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 4921, Springer, pages 132143, 2008 
40. S Shatabda, and Masud Hasan, An approximation algorithm for sorting by reversals and transpositions. Journal of Discrete Algorithms, Elsevier, 6(3), :449457, 2008 
39. Masud Hasan, and A Lubiw, Equiprojective polyhedra. Computational Geometry: Theory and Applications, Elsevier, 40(2), :148155, 2008 
38. 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 
37. Masud Hasan, M.M. Hossain, S. Nusrat, and A. LopezOrtiz, Smallest and some new equiprojective polyhedra. In Proceedings of International Conference on Computer and Information Technology, Khulna, Bangladesh,, 2008 
36. 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 
35. 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 222233, 2008 
34. 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 2530, 2008 
33. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions. International Journal of Computer Mathematics,, 84(7):953965, 2007 
32. Muhammad Abdullah Adnan, and Md. Saidur Rahman, Efficient generation of evolutionary trees. INFOCOMP Journal of Computer Science,, 6(1):3036, 2007 
31. M. R. Rahman, Md. Ehtesamul Haque, M. Islam, and Md. A. Kashem, OnLine Algorithms for VertexRankings of Graphs. In Proceedings of Proc. of the International Conference on Information and Communication Technology (ICICT 2007), Dhaka, pages 2226, 2007 
30. 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 
29. Muhammad Abdullah Adnan, Distribution of distinguishable objects to bins: generating all distributions. In Proceedings of Workshop on Algorithms and Computation (WALCOM), Dhaka, Bangladesh, 2007 
28. 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, China, pages 562568, 2007 
27. 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 
26. M. R. Rahman, Md. A. Kashem, and Md. Ehtesamul Haque, An OnLine Algorithm for EdgeRanking of Trees. In Proceedings of Proc. of the 9th International Conference on Computer and Information Technology, IUB, Bangladesh, pages 5154, 2006 
25. 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 297302, 2006 
24. Tanzima Hashem, Utpal Kumar Paul, and Md. Abul Kashem Mia, An Algorithm for cVertexRanking of Starlike Graphs. In Proceedings of 4th International Conference on Electrical and Computer Engineering (ICECE), Bangladesh, pages 316319, 2006 
23. Tanzima Hashem, and Md. Abul Kashem Mia, A LinearTime Approximation Algorithm for EdgeRanking of SeriesParallel Graphs. In Proceedings of 9th International Conference on Computer and Information Technology (ICCIT), Bangladesh,, pages 3944, 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. Utpal Kumar Paul, Tanzima Hashem, and Md. Abul Kashem Mia, An Algorithm for cEdgeRanking of a Starlike Graph. In Proceedings of 8th International Conference on Computer and Information Technology, Bangladesh, pages 886891, 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. 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 
16. A. Bhattacharjee, and B. K. Debnath, Queue Automata. In Proceedings of 7th International Conference on Computer and Information Technology, Dhaka, Bangladesh., 2004 
15. Md. Saidur Rahman, Takao Nishizeki, and Mahmuda Naznin, Orthogonal Drawings of Plane Graphs. Journal of Graph Algorithms and Applications (JGAA), 7(4), :335362, 2003 
14. 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 392406, 2003 
13. Masud Hasan, Md. Saidur Rahman, and Takao Nishizeki, A linear algorithm for compact boxdrawing of trees. Networks, Wiley, 42(3), :160163, 2003 
12. M. Kaykobad, Asiful 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 4749, 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 4749, 2002 
10. M. A. Kashem, and M.A.H. Newton, Parallel Algorithm for Optimal cVertexRanking of Permutation Graphs. In Proceedings of nternational Conference on Computer and Information Technology, pages 5560, 2002 
9. Md. Abul Kashem Mia, and Mohammed Eunus Ali, A Parallel Algorithm for Generalized Vertex Colorings of Partial kTrees. In Proceedings of 5th International Conference on Computer and Information Technology (ICCIT),, Dhaka, Bangladesh, pages 6166, 2002 
8. M. A. Kashem, and M.A.H. Newton, An efficient algorithm for optimal vertexranking of permutation graphs. In Proceedings of International Conference on Computer and Information Technology, Dhaka, Bangladesh, pages 315320, 1999 
7. Abu Wasif, and Mofizur Rahman Chowdhury, Construction of Classification Trees by the Criterion of Attribute Dependency. Journal of Electrical Engineering, Bangladesh, 1999 
6. Abu Wasif, and Mofizur Rahman Chowdhury, Application of Dynamic Programming Principle inDecision Tree Construction. Journal of Computer Science and Informatics, India, 1999 
5. Abu Wasif, and Mofizur Rahman Chowdhury, Construction of Decision Trees by Using the Criterion of Classdependency. 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. 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), :433442, 
2. M Khan, Quantum realization of some quaternary circuits. 
1. A. S. Islam, and M. Sohel Rahman, On the protein folding problem in 2Dtriangular lattices. Algorithms for Molecular Biology, BMC, 8(30), 
