Summary not available

**» 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

Dr. Sadia Sharmin

**» Related Links:**

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

1. | saidurrahman, shareeftamal, A survey on pairwise compatibility graphs, AKCE International Journal of Graphs and Combinatorics, , , 2020. |
---|---|

2. | ShaheenaSultana, saidurrahman, L-shaped point set embeddings of high-degree plane graphs, AKCE International Journal of Graphs and Combinatorics, , , 2019. |

3. | A.H.M.Kamal, mahfuz, A New Histogram-Shifting-Imitated Embedding Scheme, Journal of Computer Engineering, 1(2), 82-86, 2018. |

4. | ChinmayBepery, mahfuz, Md.MahbuburRahman, AsmaAkterMaria, AminaNasrinSumyea, Index Based Gap Position Least Count Forward Backward Multiple Pattern Matching Algorithm, Journal of Computer Engineering, 1(2), 41-48, 2018. |

5. | KatsuhisaYamanaka, saidurrahman, Shin-IchiNakano, Enumerating Floorplans with Columns
, Md. Saidur Rahman, Shin-Ichi Nakano, IEICE TRANS. FUNDAMENTALS, E101-A, 1392-1397, 2018. |

6. | ShaheenaSultana, saidurrahman, Realizability of graphs as triangle cover contact graphs, Theoretical Computur Science, 720, 24-35, 2018. |

7. | ShaheenaSultana, Md.IqbalHossain, saidurrahman, NazmunNessaMoon, TahsinaHashem, On triangle cover contact graphs, Computational Geometry: Theory and Applications, 69, 31-38, 2018. |

8. | mahbubul, sohansayed, msrahman, ayonsn, Palindromic Subsequence Automata and Longest Common Palindromic Subsequence, Mathematics in Computer Science, 11(2), 219–232, 2017. [paper link] |

9. | S.M.Ferdous, msrahman, Solving the Minimum Common String Partition Problem with the Help of Ants, Mathematics in Computer Science, 11(2), 233–249, 2017. [paper link] |

10. | Md.IqbalHossain, SammiAbidaSalma, saidurrahman, DebajyotiMondal, A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs, J. Graph Algorithms Appl., 21(3), 341-352, 2017. |

11. | AliAlatabbi, sohansayed, msrahman, JamieSimpson, WilliamSmyth, Enhanced covers of regular and indeterminate strings using prefix tables, J. Automata, Languages and Combinatorics, 21(3), 131-147, 2016. [paper link] |

12. | AliAlatabbi, JackieDaykin, JuhaKärkkäinen, msrahman, WilliamSmyth, V-order: new combinatorial properties and a simple comparison algorithm, Discrete Applied Mathematics, 215, 41- 46, 2016. [paper link] |

13. | fatema, msrahman, "An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.", Theoretical Computer Science, , , 2016. |

14. | AliAlatabbi, msrahman, W.F.Smyth, Computing Covers Using Prefix Tables, Discrete Applied Mathematics, 212, 2-9, 2016. |

15. | AliAlatabbi, AlessioLangiu, msrahman, Algorithms for Longest Common Abelian Factors, International Journal of Foundations of Computer Science, 27(5), 529-544, 2016. [paper link] |

16. | sumaiya, kaykobad, msrahman, Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees, Swarm and Evolutionary Computation, 24(-), 50-64, 2015. |

17. | mahbubul, sohansayed, mrahman, msrahman, Order preserving pattern matching revisited, Pattern Recognition Letters, 55, 15-21, 2015. [paper link] |

18. | AliAlatabbi, msrahman, W.F.Smyth, Inferring an indeterminate string from a prefix graph, Journal of Discrete Algorithms, 32(-), 6-13, 2015. |

19. | Md.IqbalHossain, saidurrahman, Good spanning trees in graph drawing, Theoretical Computer Science, 607, 149-165, 2015. |

20. | Md.KhaledurRahman, msrahman, Prefix and suffix transreversals on binary and ternary strings, Journal of Discrete Algorithms, 33, 160-170, 2015. |

21. | masudhasan, AtifHasanRahman, Md.KhaledurRahman, msrahman, mahfuza, RukhsanaYeasmin, Pancake flipping and sorting permutations, Journal of Discrete Algorithms, 33, 139-149, 2015. |

22. | S.M.Ferdous, msrahman, An Integer Programming Formulation of the Minimum Common String Partition Problem, PLOS One, 10(7), e0130266, 2015. |

23. | EffatFarhana, msrahman, Constrained sequence analysis algorithms in computational biology, Information Sciences, 295, 247-257, 2015. |

24. | AliAlatabbi, J.W.Daykin, msrahman, W.F.Smyth, Simple Linear Comparison of Strings in V-Order, Fundamenta Informaticae, To Appear, , 2015. |

25. | Md.IqbalHossain, saidurrahman, Straight-Line Monotone Grid Drawings of Series-Parallel Graphs, Discrete Mathematics, Algorithms and Applications, 7(2), , 2015. |

26. | StephaneDurocher, DebajyotiMondal, saidurrahman, On graphs that are not PCGs, Theoretical Computer Science, 571, 78-87, 2015. |

27. | S.B.Ahsan, S.PAziz, msrahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014. |

28. | masruba, ShahriarRouf, msrahman, A CLONALG-based Approach for the Set Covering Problem, Journal of Computers, 9(8), 1787-1795, 2014. |

29. | A.H.M.MRahman, msrahman, Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems, Journal of Computers, 9(8), 1743-1754, 2014. |

30. | M.Crochemore, A.Langiu, msrahman, Indexing a sequence for mapping reads with a single mismatch, Phil. Trans. R. Soc. A, 372, 20130167, 2014. |

31. | msrahman, kaykobad, J.S.Firoz, New Sufficient Conditions for Hamiltonian Paths, The Scientific World Journal, 2014, ID: 743431, 2014. |

32. | PritomAhmed, CostasIliopoulos, sohansayed, msrahman, The swap matching problem revisited, Theoretical Computer Science, 557(6), 34-49, 2014. |

33. | johramoosa, msrahman, fatema, Computing a Longest Common Subsequence that is Almost Increasing on Sequences Having No Repeated Elements, Journal of Discrete Algorithms, Volume 20, 12-20, 2013. |

34. | M.T.IAumi, M.T.Moosa, msrahman, Pattern Matching in Indeterminate and Arc-Annotated Sequences, Recent Patents on DNA and Gene Sequences, 7(2), 96-104, 2013. |

35. | T.M.Moosa, snazeen, msrahman, rezwana, Inferring Strings from Cover Arrays, Discrete Mathematics, Algorithms and Applications (DMAA), 5(2), , 2013. |

36. | PritomAhmed, sohansayed, msrahman, A graph-theoretic model to solve the approximate string matching problem allowing for translocations, Journal of Discrete Algorithms, 23, 143-156, 2013. |

37. | DebajyotiMondal, RahnumaIslamNishat, saidurrahman, SueWhitesides, Acyclic coloring with few division vertices, J. Discrete Algorithms, 23, 42-53, 2013. |

38. | Md.ManzurulHasan, saidurrahman, MuhammadRezaulKarim, Box-Rectangular Drawings of Planar Graphs, Jounal of Graph Algorithms and Applications, 17(6), 629-646, 2013. |

39. | MuhammadRashedAlam, msrahman, A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem, Information Processing Letters, 113(13), 470-476, 2013. |

40. | AmitKumarDutta, masudhasan, msrahman, Prefix transpositions on binary and ternary strings, Information Processing Letters, 113(8), 265-270, 2013. |

41. | SammiAbidaSalma, saidurrahman, Md.IqbalHossain, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs, Journal of Graph Algorithms and Applications (JGAA), 17(2), 81-102, 2013. |

42. | MuhammadRashedAlam, msrahman, The substring inclusion constraint longest common subsequence problem can be solved in quadratic time, Journal of Discrete Algorithms, 17, 67-73, 2012. |

43. | DebajyotiMondal, RahnumaIslamNishat, SueWhitesides, saidurrahman, Acyclic
colorings of graph subdivisions revisited, Journal of Discrete Algorithms, 16, 90-103, 2012. |

44. | shihab, mahbubul, sumaiya, msrahman, Computing a Longest Common Palindromic Subsequence, Fundamenta Informaticae, , 1–12, 2012. |

45. | tanveerawal, saidurrahman, A Linear Algorithm for Resource Four-partitioning Four-connected Planar Graphs, AKCE International Journal of Graphs and Combinatorics, 9(1), 11-20, 2012. |

46. | snazeen, msrahman, rezwana, Indeterminate string inference algorithms, Journal of Discrete Algorithms, 10, 23-34, 2012. |

47. | T.M.Moosa, msrahman, Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees, Discrete Mathematics, Algorithms and Applications (DMAA), 4(1), , 2012. |

48. | M.Crochemore, C.Iliopoulos, M.Kubica, msrahman, German Tischler and Tomasz Wallen. Improved Algorithms for the Range Next Value Problem and Applications, Theor. Comput. Sci., 434, 23-34, 2012. |

49. | J.W.Chan, C.S.Iliopoulos, S.Michalakopoulos, msrahman, Exact and Approximate Rhythm Matching Algorithms, International Journal on Digital Libraries, , , 2012. |

50. | J.S.Firoz, masudhasan, A.Z.Khan, msrahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time, Journal of Computational Biology, 18(8), 1007-1011, 2011. |

51. | S.I.Ahmed, masudhasan, M.A.Islam, Cutting a Convex Polyhedron out of a Sphere, Graphs and Combinatorics, 27(3), 307-319, 2011. |

52. | T.C.Biedl,, masudhasan, A.Lopez-Ortiz, Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections, International Journal of Computational Geometry and Applications, 22(2), 215-239, 2011. |

53. | T.C.Biedl, masudhasan, AlejandroLopez-Ortiz, Efficient viewpoint selection for silhouettes of convex polyhedra, Comutational Geometry: Theory and Application, 44(8), 399-408, 2011. |

54. | masudhasan, S.M.S.Hossain, M.M.Rahman, msrahman, 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. |

55. | S.B.Ahsan, T.M.Moosa, msrahman, shampa, 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. |

56. | MohammadTanvirParvez, saidurrahman, Shin-ichiNakano, Generating all triangulations of plane graphs, Journal of Graph Algorithms and Applications, , 457-482, 2011. |

57. | masudhasan, S.M.S.Hossain, M.M.Rahman, msrahman, Solving the Generalized Subset Sum Problem with a Light Based Device, Natural Computing, 10(1), 541-550, 2010. |

58. | mostofapatwary, saidurrahman, Minimum Face-Spanning Subgraphs of Plane Graphs, AKCE International Journal of Graphs and Combinatorics, 7(2), 133-150, 2010. |

59. | tanveerawal, saidurrahman, A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs, INFOCOMP Journal of Computer Science, 9(2), 39-48, 2010. |

60. | S.I.Ahmed, masudhasan, M.A.Islam, Cutting a Convex Polygon Out of a Circle, International Journal of Recent Trends in Engineering, 2(1), 88-92, 2009. |

61. | adnan, saidurrahman, Generating all distributions of objects to bins, International Journal of Computer Mathematics,, 86(3), 383 - 392, 2009. |

62. | MuhammadNurYanhaona, K.S.M.TozammelHossain, saidurrahman, Pairwise compatibility graphs, Journal of Applied Mathematics and Computing, 30, 479-503, 2009. |

63. | SShatabda, masudhasan, An approximation algorithm for sorting by reversals and transpositions, Journal of Discrete Algorithms, 6(3), 449-457, 2008. |

64. | atif, SwakkharShatabda, masudhasan, An approximation algorithm for sorting by reversals and transpositions, Journal of Discrete Algorithms, 6(3), 449-457, 2008. |

65. | masudhasan, ALubiw, Equiprojective polyhedra, Computational Geometry: Theory and Applications, 40(2), 148-155, 2008. |

66. | M.R.Rahman, Md.A.Kashem, ehtesam, An Efficient On-Line Algorithm for Edge-Ranking of Trees, INFOCOMP Journal of Computer Science, 7(2), 21-25, 2008. |

67. | adnan, saidurrahman, Efficient generation of evolutionary trees, INFOCOMP Journal of Computer Science,, 6(1), 30-36, 2007. |

68. | adnan, saidurrahman, Distribution of distinguishable objects to bins: generating all distributions, International Journal of Computer Mathematics,, 84(7), 953-965, 2007. |

69. | saidurrahman, TakaoNishizeki, mahmudanaznin, Orthogonal Drawings of Plane Graphs, Journal of Graph Algorithms and Applications (JGAA), 7(4), 335-362, 2003. |

70. | masudhasan, saidurrahman, TakaoNishizeki, A linear algorithm for compact box-drawing of trees, Networks, 42(3), 160-163, 2003. |

71. | wasif, MofizurRahmanChowdhury, Application of Dynamic Programming Principle inDecision Tree Construction, Journal of Computer Science and Informatics, , , 1999. |

72. | wasif, MofizurRahmanChowdhury, Construction of Classification Trees by the Criterion of Attribute Dependency, Journal of Electrical Engineering, , , 1999. |

73. | sohansayed, msrahman, On the protein folding problem in 2D-triangular lattices, Algorithms for Molecular Biology, 8(30), , 0000. |

74. | masudhasan, T.M.Moosa, msrahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems, Mathematics in Computer Science (MCS), 3(4), 433-442, 0000. |

75. | shareeftamal, Shin-ichiNakano, saidurrahman, One-Dimensional r-Gathering under Uncertainty, Algorithmic Aspects in Information and Management - 13th International Conference, , 1-15, 2019. |

76. | shareeftamal, Shin-ichiNakano, saidurrahman, r-Gatherings on a Star, WALCOM 2019, , 31-42, 2019. |

77. | AbuReyanAhmed, saidurrahman, StephenG.Kobourov, Online Facility Assignment. :, WALCOM 2018, , 156-168, 2018. |

78. | SujoyDas, sadia, saidurrahman, 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] |

79. | shareeftamal, saidurrahman, Multi-interval Pairwise Compatibility Graphs, Theory and Applications of Models of Computation, , 71-84, 2017. |

80. | KatsuhisaYamanaka, saidurrahman, Shin-IchiNakano, Floorplans with Columns, COCOA 2017, , 33-40, 2017. |

81. | shaifur, mahmudanaznin, toufique, Efficient Routing in a Sensor Network Using Collaborative Ants, The 7th International Conference on Swarm Intelligence, LNCS 9713, , , 2016. |

82. | DipanShaw, sohansayed, ShuvasishKarmaker, msrahman, Approximation Algorithms for Three Dimensional Protein Folding, WALCOM, , 274-285, 2016. |

83. | FrantisekFranek, sohansayed, msrahman, WilliamSmyth, Algorithms to compute the Lyndon array, Prague Stringology Conference, , 172-184, 2016. |

84. | Md.IqbalHossain, saidurrahman, A necessary condition and a sufficient condition for pairwise compatibility graphs, WALCOM 2016, , 107-113, 2016. |

85. | Md.IqbalHossain, ShaheenaSultana, NazmunNessaMoon, TahsinaHashem, saidurrahman, On Triangle Cover Contact Graphs. WALCOM 2015: 323-328, WALCOM 2015, , 323-328, 2015. |

86. | mahbubul, sohansayed, mrahman, msrahman, Order Preserving Prefix Tables, International Symposium on String Processing and Information Retrieval (SPIRE), , 111-116, 2014. [paper link] |

87. | Md.SazzadurRahaman, TousifAhmed, SadAlAbdullah, saidurrahman, Antibandwidth problem for itchy caterpillars, International Conference on Informatics, Electronics & Vision (ICIEV), 2014, , 1-6, 2014. |

88. | N.Khan, N.Karima, saidurrahman, Md.IqbalHossain, Orthogonal grid pointset embeddings of maximal outerplanar graphs, International Conference on Electrical Engineering and Information & Communication Technology (ICEEICT), 2014, , 1-6, 2014. |

89. | Md.IqbalHossain, saidurrahman, Monotone Grid Drawings of Planar Graphs, FAW 2014, , 105-116, 2014. |

90. | ShaheenaSultana, saidurrahman, ArpitaRoy, SuraiyaTairin, Bar 1-Visibility Drawings of 1-Planar Graphs, ICAA 2014, 8321, , 2014. |

91. | khaledshahriar, saidurrahman, Bichromatic Point-Set Embeddings of Trees with Fewer Bends, WALCOM 2014, , 337-348, 2014. |

92. | sadia, F.Manne, Efficient Counting of Maximal Independentsets in Sparse Graphs, Proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013,, 7933, 103-114, 2013. [paper link] |

93. | S.M.Ferdous, msrahman, Solving the Minimum Common String Partition Problem with the Help of Ants, International Conference on Swarm Intelligence (LNCS 7929), , 306-313, 2013. |

94. | shaifur, mahmudanaznin, 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. |

95. | StephaneDurocher, DebajyotiMondal, saidurrahman, On Graphs That Are Not PCGs, WALCOM 2013, , 310-321, 2013. |

96. | S.M.Ferdous, AnindyaDas, msrahman, mmrahman, An Ant Colony Optimization approach to solve the Minimum String Cover Problem, 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision, , 741-746, 2012. |

97. | adnan, Zonohedra, Zone Graphs, and Their Linear Area Straight Line Grid Drawings, Workshop on Graph Drawing and Graph Algorithms (GDGA), , , 2012. |

98. | AbuReyanAhmed, Md.MazharulIslam, saidurrahman, On acyclic colorings of graphs, 15th International Conference on Computer and Information Technology (ICCIT 2012), , 95-100, 2012. |

99. | Md.RezaulKarim, Md.JawaherulAlam, saidurrahman, On Some Properties of
Doughnut Graphs, IWOCA 2012, , 60-64, 2012. |

100. | DebajyotiMondal, RahnumaIslamNishat, saidurrahman, SueWhitesides, Acyclic
Coloring with Few Division Vertices, IWOCA 2012, , 86 - 99, 2012. |

101. | sumaiya, msrahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS, ICECE, , , 2012. |

102. | shihab, mahbubul, sumaiya, msrahman, Computing a Longest Common Palindromic Subsequence, IWOCA, , , 2012. |

103. | snazeen, TanaeemMMoosa, msrahman, rezwana, Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet, WALCOM, , 160-172, 2012. |

104. | E.Farhana, msrahman, Efficient Algorithm for Restricted LCS Problem, 4th International Conference on Bioinformatics and Computational Biology (BiCOB), , 51-56, 2012. |

105. | SammiAbidaSalma, saidurrahman, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs, WALCOM, , 112-123, 2012. |

106. | J.S.Firoz, msrahman, T.K.Saha, Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data, GECCO, , , 2012. |

107. | sadia, 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] |

108. | A.Dumitrescu, masudhasan, Cutting Out Polygons with a Circular Saw, In Proc. 22nd International Symposium on Algorithms and Computation, , 230-239, 2011. |

109. | TonmoyGuhaRoy, SourabhAryabhatta, Md.MohsinUddin, saidurrahman, On Graceful Labelings of Trees, WALCOM, , 214-220, 2011. |

110. | DebajyotiMondal, RahnumaIslamNishat, SueWhitesides, saidurrahman, Acyclic Colorings of Graph Subdivisions, International Workshop on Combinatorial Algorithms (IWOCA)., , , 2011. |

111. | NurjahanBegum, SamiaTasnim, mahmudanaznin, Efficient Query Processing in Sensor Network Using Multi-commodity Flow Network, The 17th IEEE International Conference on Industrial Engineering and Management, , , 2010. |

112. | masudhasan, Non-)Equiprojectivity and (Non-)Biprojectivity of Simplicial Polyhedra, 20th Annual Fall Workshop on Computational Geometry (FWCG 2010),, , , 2010. |

113. | S.I.Ahmed, masudhasan, A.Sopan, Vindictive Voronoi games and stabbing Delaunay circles, International Symposium on Voronoi Diagram in Science and Engineering, , 124-131, 2010. |

114. | M.RIslam, msrahman, masudhasan, M.M.Hasan, IMIPS: An improved pipelined processor architecture with reduced branch penalty and single memory for instruction and data, International International Conference on Computer Engineering and Applications (, , , 2010. |

115. | tanveerawal, saidurrahman, A linear algorithm for resource four-partitioning
four-connected planar Graphs, ICECE 2010, , 526 - 529, 2010. |

116. | masudhasan, S.Hossain, M.M.M.Rahman, Solving the minimum hitting set problem with a light-based device, International Conference on Electrical and Computer (ICECE), , 423-426, 2010. |

117. | M.A.Wahid, kaykobad, masudhasan, Kinetisation of view of 3D point set, International Conference on Computer and Information Technology (ICCIT), , 325-330, 2010. |

118. | J.S.Firoz, masudhasan, A.Z.Khan, msrahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Conference, WALCOM, , , 2010. |

119. | S.B.Ahsan, T.M.Moosa, msrahman, shampa, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded (Conference, Mini-conference on Applied Theoretical Computer Science, MATCOS, , 366-369, 2010. |

120. | mahfuza, R.Yeasmin, masudhasan, A.Rahman, msrahman, Pancake Flipping with Two Spatulas, ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics, , 231-238, 2010. |

121. | M.Crochemore, masudhasan, T.M.Moosa, msrahman, Two dimensional Range Minimum/Maximum Query revisited, 13th International Conference on Computer and Information Technology (ICCIT), , 27 - 32, 2010. |

122. | masudhasan, S.M.S.Hossain, M.M.Rahman, msrahman, Solving Minimum Hitting Set Problem with a Light-Based Device, International Conference on Electrical and Computer Engineering (ICECE), , 423 - 426, 2010. |

123. | M.M.M.Khan, A.K.Biswas, S.Chowdhury, masudhasan, A.I.Khan, Synthesis of GF(3) based ternary reversible/quantum logic circuits without ancillary qutrits, International Symposium on Multi-Valued Logic 2009, , , 2009. |

124. | AtifRahman, mahmudanaznin, masudhasan, Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications, International Conference on Electronics and Computer Technology, , 215-218, 2009. |

125. | MohammadTanvirParvez, saidurrahman, Shin-ichiNakano, Generating all
triangulations of plane graphs, WALCOM 2009, , 151-164, 2009. |

126. | M.M.Rasheed, masudhasan, msrahman, Maximum Neighbour Voronoi Games, WALCOM, , 93-104, 2009. |

127. | masudhasan, S.Hossain, M.M.Rahman, msrahman, An Optical Solution for the Subset Sum Problem, the Fourth International Workshop on Natural Computing (IWNC), , 165-173, 2009. |

128. | masudhasan, M.M.Hossain, S.Nusrat, A.Lopez-Ortiz, Smallest and some new equiprojective polyhedra, International Conference on Computer and Information Technology, , , 2008. |

129. | M.Ahmed, S.M.HChowdhury, masudhasan, Fast preemptive task scheduling algorithm for homogeneous and heterogeneous distributed memory systems, ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, , , 2008. |

130. | mdmuhibur, masudhasan, msrahman, Maximum neighbor Voronoi games, Annual Workshop on Algorithms and Computation (WALCOM 2009), , , 2008. |

131. | sharif, saidurrahman, Efficient Generation of Combinatorial Families, 11th International Conference on Computer and Information Technology (ICCIT 2008), , 25-30, 2008. |

132. | MuhammadNurYanhaona, K.S.M.TozammelHossain, saidurrahman, Pairwise
compatibility graphs, WALCOM 2008, , 222-233, 2008. |

133. | Md.RezaulKarim, saidurrahman, Four-Connected Spanning Subgraphs of Doughnut Graphs, WALCOM, , 132-143, 2008. |

134. | sadia, mdmonirulislam, D.Barua, A.Mahmood, Graph Matching Recombination for Evolving Neural Networks, Proceedings of the European Symposium on Artificial Neural Networks, ESANN 2007, 4492(1), 562-568, 2007. [paper link] |

135. | adnan, Distribution of distinguishable objects to bins: generating all distributions, Workshop on Algorithms and Computation (WALCOM), , , 2007. |

136. | mahmudanaznin, PaulJuell, KendallE.Nygard, KarlAltenburg, A Clustering Heuristic by Effective Neighbor Selection, The 40th Annual Midwest Instructional and Computing Symposium (MICS), , 6, 2007. |

137. | M.R.Rahman, ehtesam, M.Islam, Md.A.Kashem, On-Line Algorithms for Vertex-Rankings of Graphs, Proc. of the International Conference on Information and Communication Technology (ICICT 2007), , 22-26, 2007. |

138. | adnan, saidurrahman, Efficient generation of evolutionary trees, International Conference on Information and Communication Technology (ICICT 2007), , 6, 2007. |

139. | AKhan, N.Shahriar, S.M.Khan, masudhasan, Novel realization of quantum ternary mux and demux, . International Conference on Electrical and Compute Engineering, , , 2006. |

140. | A.Khan, N.Nusrat, S.M.Khan, masudhasan, Novel realization of some ternary circuits for quantum computing, IEEE TENCON, , , 2006. |

141. | adnan, saidurrahman, Distribution of objects to bins: generating all distributions, Proc. of 9th International Conference on Computer and Information Technology (ICCIT 2006), , 297-302, 2006. |

142. | M.R.Rahman, Md.A.Kashem, ehtesam, An On-Line Algorithm for Edge-Ranking of Trees, Proc. of the 9th International Conference on Computer and Information Technology, , 51-54, 2006. |

143. | A.Bhattacharjee, Md.R.Uddin, B.K.Debnath, DQA: Automata with new Memories, Properties and Applications, 8th International Conference on Computer and Information Technology, , , 2005. |

144. | A.Bhattacharjee, S.A.Quader, A New Approach to File Encryption and Compression, 8th International Conference on Computer and Information Technology, , , 2005. |

145. | msrahman, kaykobad, mrahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, 0th International Conference on Computers and Their Applications (CATA), , , 2005. |

146. | A.Bhattacharjee, B.K.Debnath, Queue Automata, 7th International Conference on Computer and Information Technology, , , 2004. |

147. | saidurrahman, mahmudanaznin, TakaoNishizeki, Orthogonal drawings of plane graphs without bends, International Conference on Graph Drawing, LNCS 2265, 7(4),, 392-406, 2003. |

148. | kaykobad, Asif-ulHaque, mrahman, msrahman, On Average Length of Cycle in a Complete Graph, International Conference on Computer and Information Technology, , 47-49, 2002. |

149. | M.A.Kashem, M.A.H.Newton, Parallel Algorithm for Optimal c-Vertex-Ranking of Permutation Graphs, nternational Conference on Computer and Information Technology, , 55-60, 2002. |

150. | A.H.Tamal, M.S.Rahman, msrahman, kaykobad, On Average Length of Cycles in Complete Graphs, 5th International Conference on Computer and Information Technology (ICCIT), , 47-49, 2002. |

151. | M.A.Kashem, M.A.H.Newton, An efficient algorithm for optimal vertex-ranking of permutation graphs, International Conference on Computer and Information Technology, Dhaka, Bangladesh, , 315-320, 1999. |

152. | wasif, MofizurRahmanChowdhury, Increasing the Performance of Classification Trees by Using a Mixed Criterion of Attribute Dependency and Gain Ratio, International Conference on Computer and Information Technology, , , 1998. |

153. | wasif, MofizurRahmanChowdhury, Construction of Decision Trees by Using the Criterion of Class-dependency, International Conference on Computer and Information Technology, , , 1998. |

154. | MKhan, Quantum realization of some quaternary circuits, , , , 0000. |

155. | S.B.Ahsan, S.P.Aziz, msrahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014. |