[45] Md. Forhad Hossain, Md. Momin Al Aziz and M Kaykobad, New Classes of Graceful Trees, to appear in Journal of Discrete Mathematics

[45] M. Sohel Rahman, M Kaykobad and Md Tanvir Kaykobad, Bipartite Graphs, Hamiltonicity and Z Graphs, vol. 44, 5 Nov, 2013, pages 307-12, Electronic Notes in Discrete Mathematics

[44] Md. Mahbubul Hasan, Md. Shahjalal & M Kaykobad, An in-place heapsort algorithm requiring nlogn+nlog*n−0.546871n comparisons, International Journal of Computer Mathematics, Volume 88, Issue 16, 2011, Pages 3350-3360

[43] Mohammad Zulkernine, M Kaykobad, Mohammed Yeasin, Mohammad Ataul Karim: Guest Editorial. JSW 6(1): 1-2 (2011)

[42] Md Kamrul Hasan, M Kaykobad, Young-Koo Lee, Sungyoung Lee, A comprehensive analysis of degree based condition for Hamiltonian cycles, Theoretical Computer Science, Volume 411, Issue 1, 1 January 2010, Pages 285-287

[41] Lenin Mehedy and M Kaykobad, How Bad Can A  Heap Be?, submitted for publication in Algorithmica

[40] Lenin Mehedy, M. Kamrul Hasan, M Kaykobad, An improved degree based condition for Hamiltonian cycles, Information Processing Letters, v.102 n.2-3, p.108-112, April, 2007

[39] Avijit Datta, Moazzem Hossain and M Kaykobad, A MODIFIED ALGORITHM FOR RANKING PLAYERS OF A ROUND-ROBIN TOURNAMENT, International Journal of Computer Mathematics, Vol. 85, Issue 1, First published on 28 September 2007 pp 1-7, Publisher Taylor & Francis.

[38] Tarique Mesbaul Islam and M Kaykobad, Worst-case Analysis of Generalized Heapsort Algorithm Revisited, pp. 59-67, Vol. 83 No. 1, January 2006, International Journal of Computer Mathematics, Publisher Taylor & Francis

[37] M. Sohel Rahman and M Kaykobad, On Hamiltonian cycles and Hamiltonian paths, Volume 94, Issue 1, Pages 37-41 (15 April 2005), (one of top 25 downloaded articles of IPL in September quarter 2005) Information Processing Letters, Elsevier Science

[36] Mohammad Sohel Rahman and M Kaykobad and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, Computers and Their Applications, pp. 56-59, ISCA, 2005.

[35] Md. Mostofa Akbar and Eric G. Manning and Gholamali C. Shoja and Mohammad Sohel Rahman and M Kaykobad, Optimal Server Selection for Content Routing, Computers and Their Applications, pp. 259-264, ISCA, 2005.

[34] M. Sohel Rahman and M Kaykobad, Complexities of some interesting problems on spanning trees, Volume 94, Issue 2, Pages 93-97 (30 April 2005), (one of top 25 downloaded articles of IPL in September quarter 2005) Information Processing Letters, Elsevier Science

[33] Suman Kumar Nath, Rezaul Alam Chowdhury and M Kaykobad, Min-Max Fine Heap, submitted to Information Processing Letters

[32] Tasadduq Imam and M Kaykobad, New Symbolic Substitution Based Addition Algorithm, pp. 1303-1310, Vol. 50(2005)International Journal of Computers and Mathematics with Applications, Publisher Elsevier

[31] M Kaykobad and FJM Salzborn, The Minimum Connection Time and Majority Spanning Trees being revised for Discrete Applied Mathematics

[30] Asif-ul Haque, M Saifur Rahman, Mehedi Bakht and M Kaykobad, Drawing lines by uniform packing, International journal of Computers and Graphics, vol 30, pp. 207-212, 2006, Publisher Elsevier

[29] MM Akbar, M Sohel Rahman, M Kaykobad, EG Manning and GC Shoja, Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls, Available online 5 November 2004 in press in International Journal of Computers and Operations Research, Elsevier.

[28] T. Imam and M Kaykobad, Symbolic Substitution Based Canonical Recoding Algorithms, vol 48, Issues 10-11, Nov-Dec 2004, pp. 1541-1548, Computers and Mathematics with Applications, Publisher Elsevier.

[27] Adib Hassan Manob, Tarique Mesbaul Islam, M Tanvir Parvez and M Kaykobad, Search Trees and Stirling Numbers, Computers and Mathematics with Applications 48(2004) 747-754, Elsevier   

[26] Mohammad Sohel Rahman and M Kaykobad, Independence Number and Degree Bounded Spanning Tree, Appl. Math. E-Notes, 4(2004), 122-124

[25] Mustaq Ahmed, Rezaul Alam Chowdhury and M Kaykobad, A New String Matching Algorithm, the International Journal of Computer Mathematics,Publisher Vol. 80, #7, pp. 825-834 , 2003, Taylor & Francis

[24] M Abdul Mannan, and M Kaykobad, Block Huffman Coding, Computers and Mathematics with Applications, vol 46 #10-11, pp. 1581-87, 2003, Elsevier.

[23] MZ Rahman, RA Chowdhury and M Kaykobad, Improvements in Double-ended Priority Queues,  International Journal of Computer Mathematics, Elsevier , vol. 80 #9, pp. 1121-29, 2003, Taylor & Francis

[22] RA Chowdhury, MZ Rahman and M Kaykobad, On the bounds of min-max pair heap construction, Computers and Mathematics with Applications, 43(2002) pp 911-916, Elsevier

[21] RA Chowdhury, M Kaykobad and  I. King, An efficient decoding technique for Huffman codes, Information Processing Letters, 81(6): 305-308, 31 March(2002), Elsevier

[20] M Manzur Murshed, M Kaykobad and SM Rahman, A Linguistically Sortable Bengali Coding System and Its Applications in Spell Checking - A Case Study of Multilingual Applications, in Interactive Multimedia Systems, Idea Group Publishing Company, 2002 

[19] F Ahmed, MS Alam, and M Kaykobad, Data Storage and Recording, a chapter in the survey volume on Instrumentation and Measurement, John Wiley & Sons, Inc., 2001

[18] Rezaul Alam Chowdhury, Suman Kumar Nath and M Kaykobad, The Heap Merge Sort, Computer & Mathematics with Applications,Vol. 39, Issue 7-8, pp. 194-97, 2000, Elsevier.

[17] Rezaul Alam Chowdhury, Suman Kumar Nath and M Kaykobad, A Simplified Complexity Analysis of McDiarmid and Reed's Variant of Bottom-up Heapsort Algorithm, IInternational Journal of Computer Mathematics, Vol. 73, pp. 293-297, 2000, Elsevier

[16] Rezaul Alam Chowdhury and M Kaykobad, Calculating the Square Root with Arbitrary Order of Convergence, the International Journal of Computer Mathematics, Vol. 75, pp. 297-302, 1999, Taylor & Francis

[15] Suman Kumar Nath, Rezaul Alam Chowdhury and M Kaykobad, On average edge length of minimum spanning trees, Information Processing Letters, 70(5) 21 June(1999) pp.241-243, Elsevier

[14] M.M. Murshed and M Kaykobad, Linguistically Sortable Bengali Texts: a Case Study of Multilingual Applications, in Effective Utilization and Management of Emerging Information Technologies, Proceedings of the 1998 Information Resources Management Association International Conference, pp. 795-798, Boston, USA, May 1998, Idea Grouping Publishing

[13] M Kaykobad,  M.M. Islam, M.M. Murshed and E. Amyeen, 3 is a more promising algorithmic parameter than 2, Vol 36(6) pp. 19-24, Computers and Mathematics with Applications, 1998, Elsevier Science.

[12] Rezaul Alam Chowdhury, Md. Sanaul Hoque and M Kaykobad, Mode-finding algorithms revisited, International Journal of Computer Mathematics, , 69(1998) pp.253-263, Taylor & Francis

[11] A.F.R. Rahman and M. Kaykobad, A Complete Bengali OCR : A Novel Hybrid Approach to Handwritten Bengali Character Recognition, Journal of Computing and Information Technology, Vol. 6(4), 1998, pp. 395-413,

[10] M Kaykobad, Md. Sanaul Hoque, Md. Mostofa Akbar and Suman Kumar Nath, An Efficient Preprocessor for Solving Systems of Linear Equations, International Journal of Computer Mathematics Vol. 64, pp. 309-315, ,1997, Taylor & Francis

[9] M.M. Murshed and M Kaykobad, Seek distances in two-headed disk systems, Information Processing Letters 57(4) 26 February(1996) 205-209, Elsevier

[8] M Kaykobad, Q.N.U. Ahmed, ATM Shafiqul Khalid and R.A. Bakhtiar, A new algorithm for ranking players of a round-robin tournament, International Journal of Computers and Operations Research, 22(2)(1995) 221-226,Elsevier

[7] M Kaykobad, S.T. Rahman, R.A. Bakhtiar and A.A.K. Majumdar, A recursive algorithm for the multi-peg tower of Hanoi problem, International Journal of Computer Mathematics, 57(1995) 67-73, Taylor & Francis

[6] M.H. Ahsan,  M Kaykobad  and M. Shamsher Ali, Variational Monte Carlo calculations for the binding energy of 31 Si, Physical Review C, 43(1)(1991) 156-161

[5] M Kaykobad, On non-negative factorization of matrices, Linear Algebra and Its Applications, 96(1987) 27-33

[4] M Kaykobad, Positive solutions of a class of linear systems, Linear Algebra and Its Applications, 72(1985) 97-105

[3] M Kaykobad, Positive solutions of positive linear systems, Linear Algebra and Its Applications, 64(1985) 133-140

[2] V.Z. Ananina and M Kaykobad, Generalized model of optimum usage of technical resources of a port, Economics and Management of Marine Transport, 16(1980) 56-58

[1] I.P. Tarasova and M Kaykobad, On the method of solving the tasks of optimum planning in conditions of incomplete information, Economics and Management of Marine Transport, 14(1978) 25-30

[10] Comparative Study of Different Compression Algorithms, Vol. EE26, No. I&II, Dec. 1998, pp. 27-32, Journal of Electrical Engineering, The Institution of Engineers, Bangladesh(With S.M. Humayun and Md. Shahid Ullah)

[9] An Approach to Bangla Text Analysis, Vol. EE26 No. I & II, Dec. 1998, pp. 39-42 Journal of Electrical Engineering, The Institution of Engineers, Bangladesh (With S.M. Humayun and Md. Shahid Ullah)

[8] An iterative algorithm for the 5-peg tower of Hanoi problem, J. of Bangladesh Academy of Sciences, Vol. 20 No. 2, 119-128, 1996)With A.A.K. Majumdar)

[7] On the performance of simplex algorithm, IPE Research Bulletin, 6(1995) 39-57(With Md. Shahadatullah Khan)

[6] Minimization procedure for determination of polarized polynomial form, Journal of Bangladesh Computer Society, 6(1)(1993) 27-29(With H.M. Hassan)

[5] An algorithm for designing Boolean functions with exclusive-or(EX-OR) & AND logic elements, Journal of Bangladesh Computer Society, 6(1)(1993) 49-51(With H.M. Hassan)

[4] Performance Analysis of Hashing Techniques,  BUET Studies.(With Dr. Chowdhury Mofizur Rahman)

[3] An algorithm for ranking players in a round-robin tournament, J. of Bangladesh Computer Society, 5(1)(1991) 20-21(With Q.N.U. Ahmed and R.A. Bakhtiar)

[2] Towers of Hanoi with 4 pegs, Journal of Bangladesh Academy of Sciences, 13(1989) 85-90

[1] On polytopes with large number of vertices, Ganit, 8(1)(1988) 47-52