default search action
Mohammad Kaykobad
Person information
- unicode name: মোহাম্মদ কায়কোবাদ
- affiliation: Bangladesh University of Engineering and Technology, Dhaka, Bangladesch
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j30]Nabil Ibtehaz
, M. Kaykobad, M. Sohel Rahman:
Multidimensional segment trees can do range updates in poly-logarithmic time. Theor. Comput. Sci. 854: 30-43 (2021) - [c8]Mohammad Kaykobad, Franz J. M. Salzborn:
Majority Spanning Trees, Cotrees and Their Applications. WALCOM 2021: 3-12
2010 – 2019
- 2019
- [j29]Mohammad Saifur Rahman, Md. Khaledur Rahman, Sanjay Saha, M. Kaykobad, M. Sohel Rahman:
Antigenic: An improved prediction model of protective antigens. Artif. Intell. Medicine 94: 28-41 (2019) - [c7]Mazharul Islam, Novia Nurain, Mohammad Kaykobad, Sriram Chellappan, A. B. M. Alim Al Islam:
HEliOS: huffman coding based lightweight encryption scheme for data transmission. MobiQuitous 2019: 70-79 - 2018
- [j28]Mohammad Saifur Rahman, Md. Khaledur Rahman
isGPT: An optimized model to identify sub-Golgi protein types using SVM and Random Forest based feature selection. Artif. Intell. Medicine 84: 90-100 (2018) - [j27]Rossella Petreschi, Mohammad Kaykobad:
Preface. Theor. Comput. Sci. 718: 1 (2018) - [j26]Mohammad Saifur Rahman
Using Adaptive Heartbeat Rate on Long-Lived TCP Connections. IEEE/ACM Trans. Netw. 26(1): 203-216 (2018) - [c6]Masud Rana, M. Kaykobad, A. B. M. Alim Al Islam:
A New Approach for Selecting Aggregated Multicast Trees to Reduce Forwarding States. NSysS 2018: 10-18 - [i3]Nabil Ibtehaz, M. Kaykobad, M. Sohel Rahman:
Multidimensional segment trees can do range queries and updates in logarithmic time. CoRR abs/1811.01226 (2018) - 2017
- [j25]Mohammad Kaykobad, Rossella Petreschi:
Guest Editors' Foreword. J. Graph Algorithms Appl. 21(3): 245-246 (2017) - 2016
- [c5]Mohammad Saifur Rahman, Yusuf Sarwar Uddin
Using adaptive heartbeat rate on long-lived TCP connections. NSysS 2016: 1-9 - [e2]Mohammad Kaykobad, Rossella Petreschi:
WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings. Lecture Notes in Computer Science 9627, Springer 2016, ISBN 978-3-319-30138-9 [contents] - 2015
- [j24]Sumaiya Iqbal
Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm Evol. Comput. 24: 50-64 (2015) - 2013
- [j23]M. Sohel Rahman
Bipartite Graphs, Hamiltonicity and Z graphs. Electron. Notes Discret. Math. 44: 307-312 (2013) - 2011
- [j22]Md. Mahbubul Hasan, Md. Shahjalal, M. Kaykobad:
An in-place heapsort algorithm requiring nlogn+nlog*n-0.546871n comparisons. Int. J. Comput. Math. 88(16): 3350-3360 (2011) - [j21]Mohammad Zulkernine, Mohammad Kaykobad, Mohammed Yeasin, Mohammad Ataul Karim:
Guest Editorial. J. Softw. 6(1): 1-2 (2011) - 2010
- [j20]Md. Kamrul Hasan, Mohammad Kaykobad, Young-Koo Lee, Sungyoung Lee:
A comprehensive analysis of degree based condition for Hamiltonian cycles. Theor. Comput. Sci. 411(1): 285-287 (2010) - [i2]Md. Enamul Azim, Md. Mostofa Akbar, M. Kaykobad:
Some fascinating series and their sums. CoRR abs/1012.0122 (2010)
2000 – 2009
- 2008
- [j19]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
- [j18]Lenin Mehedy, Md. Kamrul Hasan, Mohammad Kaykobad:
An improved degree based condition for Hamiltonian cycles. Inf. Process. Lett. 102(2-3): 108-112 (2007) - [c4]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 - [c3]Md. Shahjalal, Mohammad Kaykobad:
A New Data Structure for Heapsort with Improved Number of Comparisons. WALCOM 2007: 88-96 - [e1]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 [contents] - 2006
- [j17]Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakht, Mohammad Kaykobad:
Drawing lines by uniform packing. Comput. Graph. 30(2): 207-212 (2006) - [j16]Md. Mostofa Akbar, Mohammad Sohel Rahman
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls. Comput. Oper. Res. 33: 1259-1273 (2006) - [j15]Tarique Mesbaul Islam, M. Kaykobad:
Worst-case analysis of generalized heapsort algorithm revisited. Int. J. Comput. Math. 83(1): 59-67 (2006) - 2005
- [j14]Mohammad Sohel Rahman
On Hamiltonian cycles and Hamiltonian paths. Inf. Process. Lett. 94(1): 37-41 (2005) - [j13]Mohammad Sohel Rahman
Complexities of some interesting problems on spanning trees. Inf. Process. Lett. 94(2): 93-97 (2005) - [c2]Mohammad Sohel Rahman, Mohammad Kaykobad, Mohammad Saifur Rahman:
A New Sufficient Condition for the Existence of Hamiltonian Paths. CATA 2005: 56-59 - [c1]Md. Mostofa Akbar, Eric G. Manning, Gholamali C. Shoja, Mohammad Sohel Rahman, Mohammad Kaykobad:
Optimal Server Selection for Content Routing. CATA 2005: 259-264 - 2003
- [j12]Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury:
A New String Matching Algorithm. Int. J. Comput. Math. 80(7): 825-834 (2003) - [j11]M. Ziaur Rahman, Rezaul Alam Chowdhury, M. Kaykobad:
Improvements in double ended priority queues. Int. J. Comput. Math. 80(9): 1121-1129 (2003) - 2002
- [j10]Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
An efficient decoding technique for Huffman codes. Inf. Process. Lett. 81(6): 305-308 (2002) - 2001
- [j9]Rezaul Alam Chowdhury, Mohammad Kaykobad:
Sorting using heap structure. Int. J. Comput. Math. 77(3): 347-354 (2001) - 2000
- [j8]Rezaul Alam Chowdhury, M. Kaykobad, Suman Kumar Nath:
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort. Int. J. Comput. Math. 73(3): 293-297 (2000) - [j7]Rezaul Alam Chowdhury, M. Kaykobad:
Calculating the square root with arbitrary order of convergence. Int. J. Comput. Math. 75(3): 297-302 (2000) - [i1]Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad:
Min-Max Fine Heaps. CoRR cs.DS/0007043 (2000)
1990 – 1999
- 1999
- [j6]Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad:
On Average Edge Length of Minimum Spanning Trees. Inf. Process. Lett. 70(5): 241-243 (1999) - 1998
- [j5]M. Kaykobad, Rezaul Alam Chowdhury, Md. Sanaul Hoque
Mode-finding algorithms revisited. Int. J. Comput. Math. 69(3-4): 253-263 (1998) - 1997
- [j4]M. Kaykobad, Md. Sanaul Hoque
An efficient preprocessor for solving systems of linear equations. Int. J. Comput. Math. 64(3-4): 309-315 (1997) - 1996
- [j3]M. Manzur Murshed
Seek Distances in Two-Headed Disk Systems. Inf. Process. Lett. 57(4): 205-209 (1996) - 1995
- [j2]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. Comput. Oper. Res. 22(2): 221-226 (1995) - [j1]Mohammad Kaykobad, S. T. Rahman, Rezwan-al Bakhtiar, A. A. K. Majumdar:
A recursive algorithm for the multi-peg tower of hanoi problem. Int. J. Comput. Math. 57(1-2): 67-73 (1995)
Coauthor Index
aka: M. Sohel Rahman
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: