Dr. M. Kaykobad (ডঃ মোহাম্মদ কায়কোবাদ)

Professor

Research Area:

Algorithms and Theory

Research Interest:

Algorithms
Computational Complexity and Optimization

Academic Background:

Ph.D, 1988
The Flinders University of South Australia, Australia

M.Engg., Computer Applications Technology, 1980-82
Asian Institute of Technology, Thailand

M.S (Hons) in Engg., Automated Management of Merchant Marine, 1973-79
Odessa Marine Engg. Institute

Selected Publications:

Books:

1. Munawar Hafiz, Mohammad Sohel Rahman, Mohammad Saifur Rahman, Mohammed Eunus Ali and M Kaykobad, System Analysis and Design: A Practitioner's Approach, In press for publication by University Grants Commission, Bangladesh

2. Mohammad Kaykobad, Medhabi Manusher Golpo, published by Anyoprokash in February, 2005

3. International Mathematics Olympiad: Problems and Solutions, in coauthorship with M Zafar Iqbal, published by Anonya Prokashani, 2003.

4. Neurone Abaro Onuronon, a collection of brain teasers, in coauthorship woth M Zafar Iqbal published by Anonya Prokashani, 2003

5. Neurone Onuronon, a collection of brain teasers, in coauthorship with M Zafar Iqbal published by Anonya Prokashani, 2002

6. Delightful Mathematics – Brain twister published in coauthorship with Professor M. Shamsher Ali and Tanbir Ahmed, Voyager Publishers, 2002.

7. Computer Programming Contest and Bangladesh, published by Voyager Publications, 2002.

8. Computer Programming, published as a textbook for students of Bangladesh Open University, 1997

9. Information Technology Management-I, published by the Institute of Cost and Management Accountants, Bangladesh, Dhaka, 1993.

10. Information Technology Management-II, published by the Institute of Cost and Management Accountants, Bangladesh, Dhaka, 1993.

11. Member of the Editorial Board for "Computer Basics" published by the Bangladesh Open University, 1997.

12. Editor of the textbook “Madhyamik Computer Shikhsha��? approved by the National Curriculum and Text Book Board for classes IX and X, 1996.

13. Coauthor of Training Manual, Computer Studies (for classes IX and X), National Curriculum and Text Book Board, April, 1996.

Research Reports:

1. Minimum connection time and some related complexity problems, Ph.D. Thesis, The Flinders University of South Australia, Bedford park, South Australia, Australia, 1986

2. Regression with minimum absolute deviations, M.Engg. Thesis, Division of Computer Applications Technology, AIT, Bangkok, Thailand, 1982

3. Mathematical models for a shipping company's ships distribution, M.Sc. Engg. Thesis, Faculty of Engineering Management, OMEI, Odessa, 1979

4. Development of a Bangla Speller, report submitted to CASR ( BRTC Project approved by Res. 40, 113th Meeting of CASR on 4.7.94)

5. Computerization of class scheduling of different universities of Bangladesh, report submitted to University Grants Commission, 1995

[40] Johra Moosa, Rameen Shakur, Mohammad Kaykobad and Mohammad Sohel Rahman, Gene selection for cancer classification with the help of bees, ?BMC Medical Genomics 9(S2) · August 2016 International Journals:

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

[38] Lenin Mehedy, Kamrul Hasan and M Kaykobad, An Improved degree Based Condition for Hamiltonian Cycles, submitted for publication in IPL

[37] Avijit Datta, Moazzem Hossain and M Kaykobad, A MODIFIED ALGORITHM FOR RANKING PLAYERS OF A ROUND-ROBIN TOURNAMENT, submitted for publication

[36] 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

[35] 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

[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

International Conference Papers

1. M. Sohel Rahman, M Kaykobad and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, Accepted for Presentation & Publication in the 20th International Conference on Computers and Their Applications (CATA), 2005.

2. Mohammad Sohel Rahman and M Kaykobad, Set Version: A New Notion and Results, Accepted for Publication and Presentation in the Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, Slovenija.

3. T. Imam and M Kaykobad, New Symbolic Substitution Tables and Algorithms for the design of a fast addition unit, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 98-103.

4. T. Imam and M Kaykobad, A New Symbolic Substitution Based Approach for the conversion of binary numbers to CMSD numbers, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 170-173.

5. Mohammad Sohel Rahman, M Kaykobad and M M Akbar, Independence Number and Hamiltonicity of Graphs, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 150-152.

6. Mohammad Sohel Rahman and M Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 185-187.

7. Graceful Labelling of Complete Binary Trees, pp. 32-35, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Mahbubul Amin Majumder, ASM Obaidul Haque)

8. Use of Phonetic Similarity Property for Bangla Spell Checker, pp. 182-185, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Tamjidul Hoque)

9. Coding System for Bangla Spell Checker, pp. 186-190, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Tamjidul Hoque)

10. On Calculation of Optimal Paths in Locally Restorable Bandwidth Constrained Routing in MPLS Networks, pp. 327-331, ,International Conference on Computer and Information Technology, December 27-28, 2002(With Ragib Hasan)

11. On Average Length of Cycle in a Complete Graph, pp. 47-49, International Conference on Computer and Information Technology, December 27-28, 2002(With Asif-ul Haque, Mohammad Saifur Rahman, Mohammad Sohel Rahman)

12. On Spanning Trees with restricted Number of Leaves, pp. 53-54, International Conference on Computer and Information Technology, December 27-28, 2002(With Mohammad Sohel Rahman)

13. An Improvement to MST Algorithm for Round-Robin Tournament Ranking, pp.281-283, International Conference on Electrical and Computer Engineering, December 26-28, 2002(With P Prometheus Mitra and I. King)

14. On the expected number of probes in AVL trees, pp.281-283, International Conference on Electrical and Computer Engineering, January 5-6, 2001(With RA Chowdhury, MZ Rahman, N Mahmood)

15. Isomorphism of regular graphs, pp. 290-296 International Conference on Electrical and Computer Engineering, January 5-6, 2001(With R Ahmed, MA Hossain)

16. On partitioning of consecutive integers, pp297-299, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With M Ahmed, RA Chowdhury)

17. An efficient decoding technique for Huffman codes, pp. 300-301, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With RA Chowdhury, I. King)

18. The minimum connection time problem, pp. 302-306, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With SK Nath, FJM Salzborn)

19. Stirling Numbers and Two Inversion Formulas Adib Hassan Manob and M. Kaykobad, ICCIT2001, pp 6-8, 2001.

20. On Linear Time Algorithm for SSP Problem Pradipta Prometheus Mitra, Ragib Hasan and M. Kaykobad, ICCIT2001, pp 9-12, 2001.

21. Searching Objects on Lines and Rays, Mushfiqur Rouf and M. Kaykobad, ICCIT2001, pp. 13-15, 2001.

22. A Storage Efficient Header for Huffman Coding Mohammad Abdul Mannan, Rezaul Alam Chowdhury and M. Kaykobad, ICCIT2001, pp 57-59, 2001.

23. On Optimal Huffman Compression M. Abdul Mannan and M. Kaykobad, ICCIT2001, pp. 60-61, 2001.

24. Query Optimization by Decomposition of BCNF/3NF Relations Abul Kashem Md. Shirin and M. Kaykobad, ICCIT2001, pp. 179-184, 2001.

25. Compression using Huffman Coding Techniques, Sawsan Eskander, Mustaq Ahmed and M Kaykobad, ICCIT2001, pp. 278-282, 2001.

26. On optimal keyboard layout, pp. 21-25, Proceedings of the International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With Shahriar Manzoor, Munirul Abedin).

27. Fault tolerance of distributed multimedia system using quality adaptation, pp. 55-59, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With MM Akbar, S. Hadian)

28. Block Huffman coding, pp. 60-64, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With MA Mannan)

29. A linear time algorithm for single source shortest path problem, pp. 41-43, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With PP Mitra, R. Hasan)

30. A simple linear time algorithm for triangulation of a simple polygon, pp. 17-20, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With SK Nath)

31. Sorting using heap structure, pp. 26-30, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With RA Chowdhury)

32. Quicksort Using Higher Degree Comparators, IASTED Conference on Simulation and Modeling, 1999, Philadelphia, May 5-8, 1999.(with Md. Mostofa Akbar and M. Mamunul Islam)

33. A linguistically Sortable Coding System and Its Applications in Spell Checking: A Case Study of Multilingual Applications, Proceedings of the 24th AMSE Annual Conference, Oct. 30, 1999, Best Western Hotel, Leesburg, Virginia, USA(With M.M. Murshed, Syed M. Rahman and S.M. Rahman)

34. Improvements in double ended priority queues, pp. 1-5, Proceedings of International Conference on Computer and Information Technology, 1999 (With M. Ziaur Rahman, Rezaul Alam Chowdhury)

35. Min-Max Fine Heaps, pp. 6-10, Proceedings of International Conference on Computer and Information Technology, 1999 (With Suman Kumar Nath, Rezaul Alam Chowdhury)

36. On some issues related To LP Problem, pp. 15-18, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Sumon Kumar Nath)

37. On Optimal d-Huffman Tree, pp. 23-27, Proceedings of International Conference on Computer and Information Technology, 1999 (With Tarique Mesbaul Islam, Rezaul Alam Chowdhury)

38. Quick sort using comparators with higher degree, pp. 28-32, Proceedings of International Conference on Computer and Information Technology, 1999 (With Md. Mostafa Akbar, M. Mamunul Islam)

39. Algorithms for solving systems of linear equations, pp. 33-36, Proceedings of International Conference on Computer and Information Technology, 1999 (With Suman Kumar Nath, Rezaul Alam Chowdhury, Mustaq Ahmed)

40. On parameters of search trees, pp. 50-53, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Tarique Mesbaul Islam, Suman Kumar Nath)

41. A new exact string matching algorithm, pp. 187-192, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Mustaq Ahmed)

42. A new map method for minimizing Boolean Expression, pp. 193-196, Proceedings of International Conference on Computer and Information Technology, 1999 (With A.K.M. Ashikur Rahman)

43. A novel hybrid approach to handwritten Bangla character recognition, Proc. International Conference on Computational Linguistics, speech and Document Processing, pp. A5-A10. Calcutta, India, Feb. 18-20, 1998(With A.F.R. Rahman and M.A. Sattar)

44. An Efficient Line Algorithm, pp. 1280-1282, 39th Midwest Symposium on Circuits and Systems, August 18-21, 1996, Iowa State University, Arnes, Iowa, USA(With ATM Shafiqul Khalid)

45. Complexity of Max-Cut on Special Graphs, pp. 28-32, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Mostafa Akbar, A.K.M. Azad and F.J.M. Salzborn)

46. Majority Spanning Trees and Their Applications, pp. 33-36, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Suman Kumar Nath, M. Mamunul Islam, F.J.M. Salzborn and M.M. Murshed)

47. On Some Classes of Spanning Trees, pp. 42-44, An International Conference on Computer and Information Technology, December 18-20, 1998,(With Suman Kumar Nath and Rezaul Alam Chowdhury)

48. On Average Edge Length of Minimum Spanning Trees, PP. 52-53, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Suman Kumar Nath and Rezaul Alam Chowdhury)

49. Minimizing Area Cost of On-Chip Cache Memories, pp. 63-68, An International Conference on Computer and Information Technology, December 18-20, 1998 (With A.K.M. Ashiqur Rahman)

50. Worst-Case Analysis of Generalized Heapsort Algorithm Revisited, pp. 224-228, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Tarique Mesbaul Islam)

51. Differential Sort(D-Sort):A Subtraction-Based Sorting Algorithm, pp. 234-238, An International Conference on Computer and Information Technology, December 18-20, 1998 (With A.K.M. Azad)

52. Geometry in Solving Systems of Linear Equations, presented in the first International Congress on Muslim Youths and Scholars Innovations and Creative Works, held on March 7-9, 1995 at Tehran, Iran.

53. On discrete optimization, invited lecture, Application of Mathematics, the Proceedings of the First UNESCO Regional Workshop, held at Bahawalpur, Pakistan, (1989) pp. 102-11.

54. Application of Graph Theory in the Study of Physical Sciences, Book of Abstracts, International Bose Symposium, 1988.(With M.N. Hossain)

Journal Papers:

1.	Mohammad Saifur Rahman, Md. khaledur Rahman, Sanjay Saha, M. Kaykobad, M. Sohel Rahman, Antigenic: An improved prediction model of protective antigens, Artificial Intelligence in Medicine, 94, 28-41, 2019. [paper link]
2.	Mohammad Saifur Rahman, Swakkhar Shatabda, Sanjay Saha, M. Kaykobad, M. Sohel Rahman, DPP-PseAAC: A DNA-binding protein prediction model using Chou's general PseAAC, Journal of Theoretical Biology, 452, 22-34, 2018. [paper link]
3.	Mohammad Saifur Rahman, Md. Yusuf Sarwar Uddin, Tahmid Hasan, M. Sohel Rahman, M. Kaykobad, Using Adaptive Heartbeat Rate on Long-Lived TCP Connections, IEEE/ACM TRANSACTIONS ON NETWORKING, 26, 203-216, 2018. [paper link]
4.	Mohammad Saifur Rahman, Md. Khaledur Rahman, M. Kaykobad, M. Sohel Rahman, isGPT: An optimized model to identify sub-Golgi protein types using SVM and Random Forest based feature selection, Artificial Intelligence in Medicine, 84, 90-100, 2018. [paper link]
5.	Johra Muhammad Moosa, Rameen Shakur, M. Kaykobad, M. Sohel Rahman, Gene selection for cancer classification with the help of bees, BMC Medical Genomics, 9, 2016.
6.	Sumaiya Iqbal, M. Kaykobad, M. Sohel Rahman, Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees, Swarm and Evolutionary Computation, 24, 50-64, 2015.
7.	M. Sohel Rahman, M. Kaykobad, J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths, The Scientific World Journal, 2014, ID: 743431, 2014.
8.	Md. Mahbubul Hasan, M. Shahjalal, M. Kaykobad, An in-place heapsort algorithm requiring nlogn+nlog*n?0.546871n comparisons, International Journal of Computer mathematics, 88, 3350-3360, 2011.
9.	Md Kamrul Hasan, M. Kaykobad, Young-Koo Lee, A comprehensive analysis of degree based condition for Hamiltonian cycles, Theoretical Computer Science, 411, 285-287, 2010.
10.	Avijit Datta, Moazzem Hossain , M. Kaykobad, A MODIFIED ALGORITHM FOR RANKING PLAYERS OF A ROUND-ROBIN TOURNAMENT, International Journal of Computer Mathematics, 85, 1-7, 2007.
11.	Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakht, M. Kaykobad, Drawing lines by uniform packing, International journal of Computers and Graphics, 30, 207-212, 2006. [paper link]
12.	T. Mesbaul Islam , M. Kaykobad, Worst-case Analysis of Generalized Heapsort Algorithm, International Journal of Computer Mathematics, 83, 59-67, 2006.
13.	M. Sohel Rahman, M. Kaykobad, Complexities of some interesting problems on spanning trees, Information Processing Letters, Elsevier Science, 94, 93-97, 2005.
14.	Md. Mostofa Akbar, Eric G. Manning, M. Sohel Rahman, M. Kaykobad, Optimal Server Selection for Content Routing, Computers and Their Applications, 259-264, 2005.
15.	M. Sohel Rahman, M. Kaykobad, On Hamiltonian cycles and Hamiltonian paths, Information Processing Letters, Elsevier Science, 94, 37-41, 2005.
16.	M. Sohel Rahman, M. Kaykobad, Independence Number and Degree Bounded Spanning Tree, Appl. Math. E-Notes, 4, 122-124, 2004.
17.	Adib Hassan Manob, Tarique Mesbaul Islam, M Tanvir Parvez , M. Kaykobad, Search Trees and Stirling Numbers, Computers and Mathematics with Applications, 48, 747-754, 2004.
18.	T. Imam, M. Kaykobad, Symbolic Substitution Based Canonical Recoding Algorithms, Computers and Mathematics with Applications, 48, 1541-1548, 2004.
19.	Md. Mostofa Akbar, M. Sohel Rahman, M. Kaykobad, G Manning, GC Shoja, Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls, International Journal of Computers and Operations Research, 2004.
20.	MZ Rahman, RA Chowdhury, M. Kaykobad, Improvements in Double-ended Priority Queues, International Journal of Computer Mathematics, Elsevier, 80, 1121-29, 2003.
21.	M Abdul Mannan, M. Kaykobad, Block Huffman Coding, Computers and Mathematics with Applications, 46, 1581-87, 2003.
22.	Mustaq Ahmed, Rezaul Alam Chowdhury , M. Kaykobad, A New String Matching Algorithm, International Journal of Computer Mathematics, 80, 825-834, 2003.
23.	M Manzur Murshed, M. Kaykobad, SM Rahman, A Linguistically Sortable Bengali Coding System and Its Applications in Spell Checking - A Case Study of Multilingual Applications, Interactive Multimedia Systems, 2002.
24.	RA Chowdhury, MZ Rahman, M. Kaykobad, On the bounds of min-max pair heap construction, Computers and Mathematics with Applications, 43, 911-916, 2002.
25.	F Ahmed, MS Alam, M. Kaykobad, Data Storage and Recording, Instrumentation and Measurement, 2001.
26.	Rezaul Alam Chowdhury, Suman Kumar Nath, M. Kaykobad, A Simplified Complexity Analysis of McDiarmid and Reed s Variant of Bottom-up Heapsort Algorithm, International Journal of Computer Mathematics, 73, 293-297, 2000.
27.	Rezaul Alam Chowdhury, Suman Kumar Nath, M. Kaykobad, The Heap Merge Sort, Computer & Mathematics with Applications, 39, 194-97, 2000.
28.	Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad, On average edge length of minimum spanning trees, Information Processing Letters, 70, 241-243, 1999.
29.	M. Kaykobad, S.M. Humayun , Md. Shahid Ullah, An Approach to Bangla Text Analysis, Journal of Electrical Engineering, The Institution of Engineers, Bangladesh, EE26, 39-42, 1998.
30.	M. Kaykobad, S.M. Humayun , Md. Shahid Ullah, Comparative Study of Different Compression Algorithms, Journal of Electrical Engineering, The Institution of Engineers, Bangladesh, EE26, 27-32, 1998.
31.	A.F.R. Rahman , M. Kaykobad, A Complete Bengali OCR : A Novel Hybrid Approach to Handwritten Bengali Character Recognition, Journal of Computing and Information Technolog, 6, 395-413, 1998.
32.	Rezaul Alam Chowdhury, Md. Sanaul Hoque , M. Kaykobad, Mode-finding algorithms revisited, International Journal of Computer Mathematics, 69, 253-263, 1998.
33.	M. Kaykobad, M.M. Islam, M.M. Murshed , E. Amyeen, 3 is a more promising algorithmic parameter than 2, Computers and Mathematics with Applications, 36, 19-24, 1998.
34.	M.M. Murshed , M. Kaykobad, Linguistically Sortable Bengali Texts: a Case Study of Multilingual Applications, in Effective Utilization and Management of Emerging Information Technologies, Information Resources Management Association International Conference, 795-798, 1998.
35.	M. Kaykobad, Md. Sanaul Hoque, Md. Mostofa Akbar, Suman Kumar Nath, An Efficient Preprocessor for Solving Systems of Linear Equations, International Journal of Computer Mathematics, 64, 309-315, 1997.
36.	M. Kaykobad, A.A.K. Majumdar, An iterative algorithm for the 5-peg tower of Hanoi problem, J. of Bangladesh Academy of Sciences, 20, 119-128, 1996.
37.	M.M. Murshed , M. Kaykobad, Seek distances in two-headed disk systems, Information Processing Letters, 57, 205-209, 1996.
38.	M. Kaykobad, Md. Shahadatullah Khan, On the performance of simplex algorithm, IPE Research Bulletin, 6, 39-57, 1995.
39.	M. Kaykobad, S.T. Rahman, R.A. Bakhtiar , A.A.K. Majumdar, A recursive algorithm for the multi-peg tower of Hanoi problem, International Journal of Computer Mathematics, 57, 67-73, 1995.
40.	M. Kaykobad, Q.N.U. Ahmed, ATM Shafiqul Khalid, R.A. Bakhtiar, A new algorithm for ranking players of a round-robin tournament, International Journal of Computers and Operations Research, 22, 221-226, 1995.
41.	M. Kaykobad, H.M. Hassan, An algorithm for designing Boolean functions with exclusive-or(EX-OR) & AND logic elements, Journal of Bangladesh Computer Society, 6, 49-51, 1993.
42.	M. Kaykobad, H.M. Hassan, Minimization procedure for determination of polarized polynomial form, Journal of Bangladesh Computer Society, 6, 27-29, 1993.
43.	M. Kaykobad, Q.N.U. Ahmed , R.A. Bakhtiar, An algorithm for ranking players in a round-robin tournament, J. of Bangladesh Computer Society, 5, 20-21, 1991.
44.	M.H. Ahsan, M. Kaykobad, M. Shamsher Ali, Variational Monte Carlo calculations for the binding energy of 31 Si, Physical Review C, 43, 156-161, 1991.
45.	M. Kaykobad, Towers of Hanoi with 4 pegs, Journal of Bangladesh Academy of Sciences, 13, 85-90, 1989.
46.	M. Kaykobad, On polytopes with large number of vertices, Ganit, 8, 47-52, 1988.
47.	M. Kaykobad, On non-negative factorization of matrices, Linear Algebra and Its Applications, 96, 27-33, 1987.
48.	M. Kaykobad, Positive solutions of positive linear systems, Linear Algebra and Its Applications, 64, 133-140, 1985.
49.	M. Kaykobad, Positive solutions of a class of linear systems, Linear Algebra and Its Applications, 72, 97-105, 1985.
50.	V.Z. Ananina , M. Kaykobad, Generalized model of optimum usage of technical resources of a port, Economics and Management of Marine Transport, 16, 56-58, 1980.
51.	I.P. Tarasova , M. Kaykobad, On the method of solving the tasks of optimum planning in conditions of incomplete information, Economics and Management of Marine Transport, 14, 25-30, 1978.
52.	M. Kaykobad, FJM Salzborn, The Minimum Connection Time and Majority Spanning Trees, Discrete Applied Mathematics, 0000.
53.	Tasadduq Imam, M. Kaykobad, New Symbolic Substitution Based Addition Algorithm, International Journal of Computers and Mathematics with Applications, 50, 1303-1310, 0000.

Conference Papers:

1.	Mohammad Saifur Rahman, Md. Yusuf Sarwar Uddin, M. Sohel Rahman, M. Kaykobad, Using Adaptive Heartbeat rate on Long-lived TCP Connections, 2016 International Conference on Networking Systems and Security (NSysS 2016), 16-24, 2016. [paper link]
2.	M. A. Wahid, M. Kaykobad, Masud Hasan, Kinetisation of view of 3D point set, International Conference on Computer and Information Technology (ICCIT), 325-330, 2010.
3.	N. M. M. K. Chowdhury, Md. Mostofa Akbar, M. Kaykobad, An Efficient Data Structure using Flash Memory for Mobile Devices, in the proceedings of WALCOM 2007, 76-87, 2007.
4.	Md Shahjalal , M. Kaykobad, A New Data Structure for Heapsort with Improved Number of Comparisons, Workshop on Algorithms and Computation (WALCOM 2007), 88-96, 2007.
5.	N.M. Mosharaf Kabir Chowdhury , Md. Mostofa Akbar, M. Kaykobad, DiskTrie: An Efficient Data Structure Using Flash Memory for Mobile De, Workshop on Algorithms and Computation (WALCOM 2007), 76-87, 2007.
6.	Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakht, M. Kaykobad, Drawing Lines by Uniform Packing, International Conference on Computer and Information Technology (ICCIT), 186-190, 2004.
7.	M. Sohel Rahman, M. Kaykobad, Set Version: A New Notion and Results (Conference, Proceedings of the Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, 2004.
8.	M. Sohel Rahman, M. Kaykobad, Set Version: A New Notion and Results, Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, 2004.
9.	M. Sohel Rahman, M. Kaykobad, Md. Mostofa Akbar, Independence Number and Hamiltonicity of Graphs (Conference, 6th International Conference on Computer and Information Technology (ICCIT), 150-152, 2003.
10.	M. Sohel Rahman, M. Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths (Conference, 6th International Conference on Computer and Information Technology (ICCIT), 185-187, 2003.
11.	SM Niaz Arifin , Lenin Mehedy , M. Kaykobad, Segmented Display for Bangla Numerals: Simplicity vs. Accuracy, 6th International Conference on Computer and Information Technology (ICCIT), 2003.
12.	M. Sohel Rahman, M. Kaykobad, Md. Mostofa Akbar, Independence Number and Hamiltonicity of Graphs, Computer and Information Technology (ICCIT), 150-152, 2003.
13.	T. Imam , M. Kaykobad, A New Symbolic Substitution Based Approach for the conversion of binary numbers to CMSD numbers, 6th International Conference on Computer and Information Technology (ICCIT), 170-173, 2003.
14.	T. Imam , M. Kaykobad, New Symbolic Substitution Tables and Algorithms for the design of a fast addition unit, 6th International Conference on Computer and Information Technology (ICCIT), 98-103, 2003.
15.	A. H. Tamal, M. S. Rahman, M. Sohel Rahman, M. Kaykobad, On Average Length of Cycles in Complete Graphs, 5th International Conference on Computer and Information Technology (ICCIT), 47-49, 2002.
16.	M. Kaykobad, P Prometheus Mitra , I. King , An Improvement to MST Algorithm for Round-Robin Tournament Ranking, International Conference on Electrical and Computer Engineering, 281-283, 2002.
17.	M. Kaykobad, M. Sohel Rahman, On Spanning Trees with restricted Number of Leaves, International Conference on Computer and Information Technology, 53-54, 2002.
18.	M. Kaykobad, Asif-ul Haque , Mohammad Saifur Rahman, M. Sohel Rahman, On Average Length of Cycle in a Complete Graph, International Conference on Computer and Information Technology, 47-49, 2002.
19.	M. Kaykobad, Ragib Hasan , On Calculation of Optimal Paths in Locally Restorable Bandwidth Constrained Routing in MPLS Networks, International Conference on Computer and Information Technology, 327-331, 2002.
20.	M. Kaykobad, Md Tamjidul Hoque , Coding System for Bangla Spell Checke, International Conference on Computer and Information Technology, 186-190, 2002.
21.	M. Kaykobad, Md Tamjidul Hoque , Use of Phonetic Similarity Property for Bangla Spell Checker, International Conference on Computer and Information Technology, 182-185, 2002.
22.	M. Kaykobad, Md Mahbubul Amin Majumder , ASM Obaidul Haque , Graceful Labelling of Complete Binary Trees, International Conference on Computer and Information Technology, 32-35, 2002.
23.	M. Kaykobad, RA Chowdhury, Sorting using heap structure, Proceedings of International Conference on Computer and Information Technology, 2000, 26-30, 2001.
24.	M. Kaykobad, SK Nath, A simple linear time algorithm for triangulation of a simple polygon, Proceedings of International Conference on Computer and Information Technology, 2000, 17-20, 2001.
25.	M. Kaykobad, PP Mitra, R. Hasan, A linear time algorithm for single source shortest path problem, Proceedings of International Conference on Computer and Information Technology, 2000, 41-43, 2001.
26.	M. Kaykobad, Md. Mostofa Akbar, S. Hadian, Fault tolerance of distributed multimedia system using quality adaptation, Proceedings of International Conference on Computer and Information Technology, 2000, 55-59, 2001.
27.	M. Kaykobad, Shahriar Manzoor, Munirul Abedin, On optimal keyboard layout, Proceedings of the International Conference on Computer and Information Technology, 2000, 21-25, 2001.
28.	Sawsan Eskander, Mustaq Ahmed, M. Kaykobad, Compression using Huffman Coding Techniques, ICCIT2001, 278-282, 2001.
29.	Abul Kashem Md. Shirin, M. Kaykobad, Query Optimization by Decomposition of BCNF/3NF Relations, ICCIT2001, 179-184, 2001.
30.	M. Abdul Mannan, M. Kaykobad, On Optimal Huffman Compression, ICCIT2001, 60-61, 2001.
31.	Mohammad Abdul Mannan, Rezaul Alam Chowdhury, M. Kaykobad, A Storage Efficient Header for Huffman Coding, ICCIT2001, 57-59, 2001.
32.	Mushfiqur Rouf, M. Kaykobad, Searching Objects on Lines and Rays, ICCIT2001, 13-15, 2001.
33.	Pradipta Prometheus Mitra, Ragib Hasan, M. Kaykobad, On Linear Time Algorithm for SSP Problem, ICCIT2001, 9-12, 2001.
34.	Adib Hassan Manob, M. Kaykobad, Stirling Numbers and Two Inversion Formulas, ICCIT2001, 6-8, 2001.
35.	M. Kaykobad, SK Nath, FJM Salzborn, The minimum connection time problem, International Conference on Electrical and Computer Engineering, 302-306, 2001.
36.	M. Kaykobad, RA Chowdhury , I. King , An efficient decoding technique for Huffman codes, International Conference on Electrical and Computer Engineering, 300-301, 2001.
37.	M. Kaykobad, M Ahmed , RA Chowdhury , On partitioning of consecutive integers, International Conference on Electrical and Computer Engineering, 297-299, 2001.
38.	M. Kaykobad, R Ahmed , MA Hossain , Isomorphism of regular graphs, International Conference on Electrical and Computer Engineering, 290-296, 2001.
39.	M. Kaykobad, RA Chowdhury , MZ Rahman , N Mahmood , On the expected number of probes in AVL trees, International Conference on Electrical and Computer Engineering, 281-283, 2001.
40.	A.K.M. Ashikur Rahman, M. Kaykobad, A new map method for minimizing Boolean Expressions, International Conference on Computer and Information Technology, 1999.
41.	M. Kaykobad, A.K.M. Ashikur Rahman, A new map method for minimizing Boolean Expression, Proceedings of International Conference on Computer and Information Technology, 193-196, 1999.
42.	M. Kaykobad, Rezaul Alam Chowdhury, Mustaq Ahmed, A new exact string matching algorithm, Proceedings of International Conference on Computer and Information Technology, 187-192, 1999.
43.	M. Kaykobad, Rezaul Alam Chowdhury, Tarique Mesbaul Islam, Suman Kumar Nath, On parameters of search trees, Proceedings of International Conference on Computer and Information Technology, 50-53, 1999.
44.	M. Kaykobad, Suman Kumar Nath, Rezaul Alam Chowdhury, Mustaq Ahmed, Algorithms for solving systems of linear equations, Proceedings of International Conference on Computer and Information Technology, 33-36, 1999.
45.	M. Kaykobad, Md. Mostofa Akbar, M. Mamunul Islam, Quick sort using comparators with higher degree, Proceedings of International Conference on Computer and Information Technology, 28-32, 1999.
46.	M. Kaykobad, Tarique Mesbaul Islam, Rezaul Alam Chowdhury, On Optimal d-Huffman Tree, Proceedings of International Conference on Computer and Information Technology, 23-27, 1999.
47.	M. Kaykobad, Rezaul Alam Chowdhury, Sumon Kumar Nath, On some issues related To LP Problem, Proceedings of International Conference on Computer and Information Technology, 15-18, 1999.
48.	M. Kaykobad, Suman Kumar Nath, Rezaul Alam Chowdhury, Min-Max Fine Heaps, Proceedings of International Conference on Computer and Information Technology, 6-10, 1999.
49.	M. Kaykobad, M. Ziaur Rahman, Rezaul Alam Chowdhury, Improvements in double ended priority queues, Proceedings of International Conference on Computer and Information Technology, 1-5, 1999.
50.	M. Kaykobad, M.M. Murshed, Syed M. Rahman, S.M. Rahman, A linguistically Sortable Coding System and Its Applications in Spell Checking: A Case Study of Multilingual Applications, Proceedings of the 24th AMSE Annual Conference, 1999.
51.	M. Kaykobad, Md. Mostofa Akbar, M. Mamunul Islam, Quicksort Using Higher Degree Comparators, IASTED Conference on Simulation and Modeling, 1999, 1999.
52.	M. Kaykobad, Md. Mostofa Akbar, A. K. M. Azad, F. J. M. Salzborn, Complexity of Max Cut on Special Graphs, International Conference on Computer and Information Technology, 28-32, 1998.
53.	M. Kaykobad, A.K.M. Azad, Differential Sort(D-Sort):A Subtraction-Based Sorting Algorithm, An International Conference on Computer and Information Technology, 234-238, 1998.
54.	M. Kaykobad, Tarique Mesbaul Islam, Worst-Case Analysis of Generalized Heapsort Algorithm Revisited, An International Conference on Computer and Information Technology, 224-228, 1998.
55.	M. Kaykobad, A.K.M. Ashikur Rahman, Minimizing Area Cost of On-Chip Cache Memories, An International Conference on Computer and Information Technology, 63-68, 1998.
56.	M. Kaykobad, Suman Kumar Nath, Rezaul Alam Chowdhury, On Some Classes of Spanning Trees, An International Conference on Computer and Information Technology, 42-44, 1998.
57.	M. Kaykobad, Suman Kumar Nath, M. Mamunul Islam, F.J.M. Salzborn, M.M. Murshed, Majority Spanning Trees and Their Applications, An International Conference on Computer and Information Technology, 33-36, 1998.
58.	M. Kaykobad, Md. Mostofa Akbar, A.K.M. Azad , F.J.M. Salzborn, Complexity of Max-Cut on Special Graphs, An International Conference on Computer and Information Technology, 28-32, 1998.
59.	M. Kaykobad, A.F.R. Rahman, Md. Abdus Sattar, A novel hybrid approach to handwritten Bangla character recognition, Proc. International Conference on Computational Linguistics, speech and Document Processing,, A5-A10, 1998.
60.	A.K.M. Ashikur Rahman, M. Kaykobad, Seek time in replicated two-headed disk systems, National Conference on Computer and Information Systems, 15-20, 1997.
61.	M. Z. Rahman, S. Ghosh, Md. Mostofa Akbar, M. Kaykobad, M. M. Murshed, Divide and Conquer Approach to Solving System of Linear Equations, First National Conference on Computer and Information Systems,, 7-12, 1997.
62.	M. Kaykobad, Nazmul Haque, Syed M. Rahman, Retrieval Effectiveness of Thumbnail Transformation, National Conference on Computer and Information Systems, 167-172, 1997.
63.	M. Kaykobad, A.K.M. Azad, A Variation of MergeSort Algorithm Requiring Fewer Comparisons, National Conference on Computer and Information Systems, 52-57, 1997.
64.	M. Kaykobad, Rezaul Alam Chowdhury, Md. Abdul Hakim, An Iterative Method for Calculating the Square Root with Arbitrary Order of Convergence, National Conference on Computer and Information Systems, 48-51, 1997.
65.	M. Kaykobad, Rezaul Alam Chowdhury, Tarique Mesbaul Islam, On Merging Two Heaps, National Conference on Computer and Information Systems, 44-47, 1997.
66.	M. Kaykobad, Rezaul Alam Chowdhury, Md. Ziaur Rahman, Improvement in Mode-Finding Algorithms, National Conference on Computer and Information Systems, 32-37, 1997.
67.	M. Kaykobad, Suman Kumar Nath, An Algorithm for Ranking Objects with Weight, National Conference on Computer and Information Systems, 21-26, 1997.
68.	M. Kaykobad, A.K.M. Ashikur Rahman, Seek Time in Replicated Two Headed Disk Systems, National Conference on Computer and Information Systems, 15-20,1-6, 1997.
69.	M. Kaykobad, M. Ziaur Rahman, Md. Mostofa Akbar, M. Manzur Murshed, Divide and Conquer Approach in Solving System of Linear Equations, National Conference on Computer and Information Systems, 7-12, 1997.
70.	M. Kaykobad, S. Masum Emran, A New Approach to Solving the Closest-Pair Problem, National Conference on Computer and Information Systems, 1-6, 1997.
71.	M. Kaykobad, ATM Shafiqul Khalid, An Efficient Line Algorithm, 39th Midwest Symposium on Circuits and Systems, 1280-1282, 1996.
72.	M. Kaykobad, A New Algorithm for Systems of Linear Equations, Tenth Mathematics Conference, Bangladesh Mathematical Society, 1995.
73.	M. Kaykobad, Geometry in Solving Systems of Linear Equations, first International Congress on Muslim Youths and Scholars Innovations and Creative Works, 1995.
74.	M. Kaykobad, Mahboob Hasan Chowdhury , S.M.M.R. Chowdhury, On Optimization of Arithmetic Computation, 15th Annual Bangladesh Science Conference, 92-96, 1990.
75.	M. Kaykobad, S.M. Humayun, Syed Mahbubur Rahman, Standard Static Huffman Code for Bangla Alphabet, 15th Annual Bangladesh Science Conference, 85-88, 1990.
76.	M. Kaykobad, Ram Krishna Talukder , M. Musa, A VS FORTRAN Code for Simplex Algorithm Using Column Generation Technique, 14th Annual Bangladesh Science Conference, 59-61, 1989.
77.	M. Kaykobad, M. Musa, On the Average performance of the Heapsort, 14th Annual Bangladesh Science Conference, 14, 1989.
78.	M. Kaykobad, M.A. Shaheed, Some Techniques for Representing and Operating on Sparse Matrices, 14th Annual Bangladesh Science Conference, 14, 1989.
79.	M. Kaykobad, M. Farhad Hossain, On Nonnegative Factorization of a Class of Matrices, 13th Annual Bangladesh Science Conference, 19, 1988.
80.	M. Kaykobad, Ram Krishna Talukder, M. Musa, An MIP Model for Transportation Problems Using Subgraph Selection, 13th Annual Bangladesh Science Conference, 19-20, 1988.
81.	M. Kaykobad, Ziaul Hasan Masum, M. Musa, On Graceful Labelling of Trees, 13th Annual Bangladesh Science Conference, 21, 1988.
82.	M. Kaykobad, An Algorithm for Towers of Hanoi with p>=3 Pegs, 14th Annual Bangladesh Science Conference, 0000.