M. Kaykobad
List of publications from the
2008 |
19 | EE | Avijit Datta,
Moazzem Hossain,
M. Kaykobad:
An improved MST algorithm for ranking players of a round-robin tournament.
Int. J. Comput. Math. 85(1): 1-7 (2008) |
2007 |
18 | | M. Kaykobad,
Md. Saidur Rahman:
Workshop on Algorithms and Computation 2007 - Proceedings of First WALCOM, 12 February 2007, Dhaka, Bangladesh
Bangladesh Academy of Sciences (BAS) 2007 |
17 | | N. M. Mosharaf Kabir Chowdhury,
Md. Mostofa Akbar,
Mohammad Kaykobad:
DiskTrie: An Efficient Data Structure using Flash Memory for Mobile Devices.
WALCOM 2007: 76-87 |
16 | | Md. Shahjalal,
Mohammad Kaykobad:
A New Data Structure for Heapsort with Improved Number of Comparisons.
WALCOM 2007: 88-96 |
15 | EE | Lenin Mehedy,
Md. Kamrul Hasan,
Mohammad Kaykobad:
An improved degree based condition for Hamiltonian cycles.
Inf. Process. Lett. 102(2-3): 108-112 (2007) |
2006 |
14 | EE | Asif-ul Haque,
Mohammad Saifur Rahman,
Mehedi Bakht,
Mohammad Kaykobad:
Drawing lines by uniform packing.
Computers & Graphics 30(2): 207-212 (2006) |
13 | EE | Md. Mostofa Akbar,
Mohammad Sohel Rahman,
Mohammad Kaykobad,
Eric G. Manning,
Gholamali C. Shoja:
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls.
Computers & OR 33: 1259-1273 (2006) |
12 | EE | Tarique Mesbaul Islam,
M. Kaykobad:
Worst-case analysis of generalized heapsort algorithm revisited.
Int. J. Comput. Math. 83(1): 59-67 (2006) |
2005 |
11 | | Md. Mostofa Akbar,
Eric G. Manning,
Gholamali C. Shoja,
Mohammad Sohel Rahman,
Mohammad Kaykobad:
Optimal Server Selection for Content Routing.
Computers and Their Applications 2005: 259-264 |
10 | | Mohammad Sohel Rahman,
Mohammad Kaykobad,
Mohammad Saifur Rahman:
A New Sufficient Condition for the Existence of Hamiltonian Paths.
Computers and Their Applications 2005: 56-59 |
9 | EE | Mohammad Sohel Rahman,
Mohammad Kaykobad:
On Hamiltonian cycles and Hamiltonian paths.
Inf. Process. Lett. 94(1): 37-41 (2005) |
8 | EE | Mohammad Sohel Rahman,
Mohammad Kaykobad:
Complexities of some interesting problems on spanning trees.
Inf. Process. Lett. 94(2): 93-97 (2005) |
2003 |
7 | EE | Mustaq Ahmed,
M. Kaykobad,
Rezaul Alam Chowdhury:
A New String Matching Algorithm.
Int. J. Comput. Math. 80(7): 825-834 (2003) |
6 | EE | M. Ziaur Rahman,
Rezaul Alam Chowdhury,
M. Kaykobad:
Improvements in double ended priority queues.
Int. J. Comput. Math. 80(9): 1121-1129 (2003) |
2002 |
5 | EE | Rezaul Alam Chowdhury,
M. Kaykobad,
Irwin King:
An efficient decoding technique for Huffman codes.
Inf. Process. Lett. 81(6): 305-308 (2002) |
2000 |
4 | EE | Suman Kumar Nath,
Rezaul Alam Chowdhury,
M. Kaykobad:
Min-Max Fine Heaps
CoRR cs.DS/0007043: (2000) |
1999 |
3 | EE | Suman Kumar Nath,
Rezaul Alam Chowdhury,
M. Kaykobad:
On Average Edge Length of Minimum Spanning Trees.
Inf. Process. Lett. 70(5): 241-243 (1999) |
1996 |
2 | EE | M. Manzur Murshed,
M. Kaykobad:
Seek Distances in Two-Headed Disk Systems.
Inf. Process. Lett. 57(4): 205-209 (1996) |
1995 |
1 | EE | Mohammad Kaykobad,
Q. N. U. Ahmed,
A. T. M. Shafiqul Khalid,
Rezwan-al Bakhtiar:
A new algorithm for ranking players of a round-robin tournament.
Computers & OR 22(2): 221-226 (1995) |