Dr. Mohammad Kaykobad
Professor
kaykobad@bracu.ac.bd
Address
CSE Department
4th floor, Room No # 4G11,
Brac University,
Kha 224 Bir Uttam Rafiqul Islam Avenue,
Merul Badda, Dhaka, Bangladesh
Professor Kaykobad served as a Distinguished Professor of the Department of Computer Science and Engineering at Brac University. He retired from CSE Department, BUET in 2020. He was awarded the Gold Medal for contribution to ICT Education by the Bangladesh Computer Society in 2005. In 2006 he won the Bangladesh Academy of Sciences Gold Medal for Physical Sciences Senior Group. He was one of the pioneers in introducing competitive programming in Bangladesh. He led the BUET team to the ACM Finals numerous times and his 2000 team finished 11th in the world. He received the Outstanding Coach Award at the ACM ICPC Finals held in Honolulu, Hawaii in 2002. In 2013 he was awarded the Senior Coach Award at the ACM ICPC Finals in St. Petersburg. In 2019 he was awarded ICPC Foundation Life Coach Award at Porto, Portugal. He is one of the pioneers in introducing Mathematics, Informatics and Science Olympiads in Bangladesh. He has worked as a Director of the Dhaka and Chittagong Stock Exchanges for many years and is a member of the Academic Councils and Syndicates of several universities. He is currently an Independent Director of Sonali Bank.
Dr. Kaykobad was a Visiting Professor at the Department of Computer Science and Engineering, the Chinese University of Hong Kong during the years 2000 and 2001, KAIST, Korea, Monash University Gippsland Campus, Australian National University, Amritapuri University, India Kyong Hee University, Korea. He is keen to popularize science and develop analytical skill in Bangladeshi students. He is a very frequent column writer inspiring educational excellence and patriotism in young people. Dr Kaykobad is a Fellow of Bangladesh Academy of Sciences.
MS Rahman, S Shatabda, S Saha, M Kaykobad… - Journal of theoretical …, 2018 - Elsevier
A DNA-binding protein (DNA-BP) is a protein that can bind and interact with a DNA. Identification
of DNA-BPs using experimental methods is expensive as well as time consuming. As …
Save Cite Cited by 129 Related articles All 4 versions
MS Rahman, MK Rahman, M Kaykobad… - Artificial intelligence in …, 2018 - Elsevier
The Golgi Apparatus (GA) is a key organelle for protein synthesis within the eukaryotic cell.
The main task of GA is to modify and sort proteins for transport throughout the cell. Proteins …
Save Cite Cited by 46 Related articles All 3 versions
MM Akbar, MS Rahman, M Kaykobad… - Computers & operations …, 2006 - Elsevier
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack
Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a transformation …
Save Cite Cited by 202 Related articles All 12 versions
S Iqbal, M Kaykobad, MS Rahman - Swarm and evolutionary computation, 2015 - Elsevier
This paper presents a new model and solution for the multi-objective Vehicle Routing
Problem with Soft Time Windows (VRPSTW) using a hybrid metaheuristic technique. The …
Save Cite Cited by 89 Related articles All 3 versions
MS Rahman, M Kaykobad - Information Processing Letters, 2005 - Elsevier
A Hamiltonian cycle is a spanning cycle in a graph, ie, a cycle through every vertex, and a
Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient …
Save Cite Cited by 77 Related articles All 9 versions
MK Hasan, M Kaykobad, YK Lee… - 2008 11th International …, 2008 - ieeexplore.ieee.org
… Hasan and Kaykobad showed case by case that under the condition of Rahman and Kaykobad,
… This paper relates the results of Mehedy, Hasan and Kaykobad with the two exceptional …
Save Cite Cited by 10 Related articles All 19 versions
MS Rahman, MK Rahman, S Saha, M Kaykobad… - Artificial intelligence in …, 2019 - Elsevier
An antigen is a protein capable of triggering an effective immune system response. Protective
antigens are the ones that can invoke specific and enhanced adaptive immune response …
Save Cite Cited by 34 Related articles All 4 versions
M Kaykobad - Linear Algebra and its applications, 1987 - angelfire.com
It is shown that a sufficient condition for a nonnegative real symmetric matrix to be
completely positive is that the matrix is diagonally dominant.
Save Cite Cited by 68 Related articles All 8 versions
M Kaykobad - Linear algebra and its applications, 1985 - angelfire.com
Easily verifiable sufficient conditions are obtained for the existence of a positive solution
(componentwise) of a linear nonhomogeneous system of equations with positive …
Save Cite Cited by 48 Related articles All 11 versions
JM Moosa, R Shakur, M Kaykobad, MS Rahman - BMC medical genomics, 2016 - Springer
Background Development of biologically relevant models from gene expression data
notably, microarray data has become a topic of great interest in the field of bioinformatics and …
L Mehedy, N Arifin, M Kaykobad - Proceedings of International …, 2003 - researchgate.net
A few researches have been carried out to efficiently recognize natural Bangla sentences.
This paper proposes a technique to parse Bangla sentences in a new approach using context-…
Save Cite Cited by 40 Related articles All 2 versions
MA Abrar, M Kaykobad, MS Rahman, MAH Samee - bioRxiv, 2022 - biorxiv.org
Spatial transcriptomics (ST) holds the promise to identify the existence and extent of spatial
variation of gene expression in complex tissues. Such analyses could help identify gene …
Save Cite Related articles All 2 versions
RA Chowdhury, M Kaykobad, I King - Information processing letters, 2002 - Elsevier
We present a new data structure for Huffman coding in which in addition to sending symbols
in order of their appearance in the Huffman tree one needs to send codes of all circular leaf …
Save Cite Cited by 28 Related articles All 15 versions
MA Abrar, M Kaykobad, MS Rahman… - …, 2023 - academic.oup.com
Motivation Spatial transcriptomics (ST) can reveal the existence and extent of spatial
variation of gene expression in complex tissues. Such analyses could help identify spatially …
Save Cite Related articles All 6 versions
MA Mannan, M Kaykobad - Computers & Mathematics with Applications, 2003 - Elsevier
Dynamic or adaptive Huffman coding, proposed by Gallager [1] and extended by Knuth [21,
can be used for compressing a continuous stream. Our proposal for accomplishing the same …
Save Cite Cited by 21 Related articles All 3 versions
M Ahmed, M Kaykobad… - International journal of …, 2003 - Taylor & Francis
<p>In this paper a new exact string-matching algorithm with sub-linear average case
complexity has been presented. Unlike other sub-linear string-matching algorithms it never …
Save Cite Cited by 17 Related articles All 14 versions
L Mehedy, MK Hasan, M Kaykobad - Information Processing Letters, 2007 - Elsevier
A Hamiltonian cycle is a closed path through all the vertices of a graph. Since discovering
whether a graph has a Hamiltonian path or a Hamiltonian cycle are both NP-complete …
Save Cite Cited by 13 Related articles All 11 versions
M Islam, N Nurain, M Kaykobad, S Chellappan… - Proceedings of the 16th …, 2019 - dl.acm.org
Demand for fast data sharing among smart devices is rapidly increasing. This trend creates
challenges towards ensuring essential security for online shared data while maintaining the …
Save Cite Cited by 8 Related articles All 4 versions
RA Chowdhury, M Kaykobad… - International journal of …, 2000 - Taylor & Francis
McDiarmid and Reed (1989) presented a variant of BOTTOM-UP-HEAPSORT which requires
nlog 2 n+n element comparisons (for n= 2 h+1 -1) in the worst case, but requires an extra …
Save Cite Cited by 3 Related articles All 4 versions
M Kaykobad, ST Rahman, RA Bakhtiar… - … journal of computer …, 1995 - Taylor & Francis
This paper gives a recursive algorithm to solve the multi-peg Tower of Hanoi problem. The
algorithm is based on the dynamic programming equation satisfied by the optimal value …
MS Rahman, M Kaykobad - Information Processing Letters, 2005 - Elsevier
This paper deals with the complexity issues of some new interesting spanning tree problems.
Here we define some new spanning tree problems by imposing various constraints and …
Save Cite Cited by 15 Related articles All 9 versions
PP Mitra, R Hasan, M Kaykobad - Proceedings of the International …, 2000 - ragibhasan.com
The shortest path problem is one of the most studied problems in computer science. In this
paper, we suggest an algorithm for the solution of the single source shortest path problem in …
Save Cite Cited by 3 Related articles All 5 versions
M Kaykobad - Linear algebra and its applications, 1985 - Elsevier
A set of easily verifiable sufficient conditions are derived for the existence of a positive
(componentwise) solution of a linear nonhomogeneous system of equations in which the …
Save Cite Cited by 11 Related articles All 10 versions
…, T Hasan, MS Rahman, M Kaykobad - IEEE/ACM …, 2017 - ieeexplore.ieee.org
In this paper, we propose techniques for dynamically adjusting heartbeat or keep-alive
interval of long-lived TCP connections, particularly the ones that are used in push notification …
Save Cite Cited by 9 Related articles All 5 versions
…, MMA Aziz, M Kaykobad - Journal of Discrete …, 2014 - downloads.hindawi.com
Graceful labeling is one of the most researched problems. One of the earliest results is that
caterpillars are graceful. We show that caterpillars connected to a vertex recursively …
Save Cite Cited by 10 Related articles All 6 versions
K Cabral, T Kaykobad, JA Delamer, P Jardine… - Journal of Intelligent & …, 2023 - Springer
In self-assembly tasks, local interactions between robotic structure parts induce a collective
behaviour that guides the robots to assume a desired shape. In this work, we propose a self-…
Save Cite Related articles All 2 versions
MT Hoque, M Kaykobad - 5th international conference on …, 2002 - researchgate.net
Development of Bangla application is relatively complex due to the complexities of Bangla
character set. In case of Bangla Spell Checker application, detection of replacement errors, …
Save Cite Cited by 10 Related articles
M Kaykobad, QNU Ahmed, ATMS Khalid - Computers & operations …, 1995 - Elsevier
In this paper we present a new algorithm for solving the problem of ranking players in a
round-robin tournament in which outcome of any match is a win or a loss. We also compare …
Save Cite Cited by 14 Related articles All 10 versions
M Kaykobad, MM Islam, ME Amyeen… - Computers & Mathematics …, 1998 - Elsevier
In this paper we have observed and shown that ternary systems are more promising than
the more traditional binary systems used in computers. In particular, ternary number system, …
Save Cite Cited by 15 Related articles All 11 versions
N Ibtehaz, M Kaykobad, MS Rahman - Theoretical Computer Science, 2021 - Elsevier
Updating and querying on a range is a classical algorithmic problem with a multitude of
applications. The Segment Tree data structure is particularly notable in handling the range query …
MS Rahman, M Kaykobad - Information Processing Letters, 2005 - Elsevier
This paper deals with the complexity issues of some new interesting spanning tree problems.
Here we define some new spanning tree problems by imposing various constraints and …
Save Cite Cited by 15 Related articles All 9 versions
PP Mitra, R Hasan, M Kaykobad - Proceedings of the International …, 2000 - ragibhasan.com
The shortest path problem is one of the most studied problems in computer science. In this
paper, we suggest an algorithm for the solution of the single source shortest path problem in …
Save Cite Cited by 3 Related articles All 5 versions
M Kaykobad - Linear algebra and its applications, 1985 - Elsevier
A set of easily verifiable sufficient conditions are derived for the existence of a positive
(componentwise) solution of a linear nonhomogeneous system of equations in which the …
Save Cite Cited by 11 Related articles All 10 versions
…, T Hasan, MS Rahman, M Kaykobad - IEEE/ACM …, 2017 - ieeexplore.ieee.org
In this paper, we propose techniques for dynamically adjusting heartbeat or keep-alive
interval of long-lived TCP connections, particularly the ones that are used in push notification …
Save Cite Cited by 9 Related articles All 5 versions
…, MMA Aziz, M Kaykobad - Journal of Discrete …, 2014 - downloads.hindawi.com
Graceful labeling is one of the most researched problems. One of the earliest results is that
caterpillars are graceful. We show that caterpillars connected to a vertex recursively …
Save Cite Cited by 10 Related articles All 6 versions
[PDF] Coding system for bangla spell checker
MT Hoque, M Kaykobad - 5th international conference on …, 2002 - researchgate.net
Development of Bangla application is relatively complex due to the complexities of Bangla
character set. In case of Bangla Spell Checker application, detection of replacement errors, …
Save Cite Cited by 10 Related articles
M Kaykobad, QNU Ahmed, ATMS Khalid - Computers & operations …, 1995 - Elsevier
In this paper we present a new algorithm for solving the problem of ranking players in a
round-robin tournament in which outcome of any match is a win or a loss. We also compare …
Save Cite Cited by 14 Related articles All 10 versions
M Kaykobad, MM Islam, ME Amyeen… - Computers & Mathematics …, 1998 - Elsevier
In this paper we have observed and shown that ternary systems are more promising than
the more traditional binary systems used in computers. In particular, ternary number system, …
Save Cite Cited by 15 Related articles All 11 versions
N Ibtehaz, M Kaykobad, MS Rahman - Theoretical Computer Science, 2021 - Elsevier
Updating and querying on a range is a classical algorithmic problem with a multitude of
applications. The Segment Tree data structure is particularly notable in handling the range query …
NMMK Chowdhury, MM Akbar, M Kaykobad - WALCOM, 2007 - pdfs.semanticscholar.org
… Kaykobad …
Save Cite Cited by 6 Related articles All 13 versions
…, MF Hossain, T Faequa, M Kaykobad - … on Computer and …, 2014 - ieeexplore.ieee.org
Any tree with n vertices is conjectured to be graceful if its vertices can be labeled using
integers 0, 1, ..., n - 1 such that each vertex label as well as the corresponding edge label is …
Save Cite Cited by 5 Related articles All 4 versions
MT Kaykobad - 2020 - ruor.uottawa.ca
We explore the problem of transforming plane triangulations using simultaneous diagonal
flips. Wagner showed that any n-vertex plane triangulation can be transformed to any other …
Save Cite Cited by 3 Related articles All 3 versions
RA Chowdhury, SK Nath, M Kaykobad - Computers & Mathematics with …, 2000 - Elsevier
In this paper, we present a new mergesort algorithm which can sort n(= 2 h+1 − 1) elements
using no more than n log 2 (n+1) − ( 13 12 )n − 1 element comparisons in the worst case. …
Save Cite Cited by 5 Related articles All 10 versions
ATMS Khalid, M Kaykobad - … of the 39th Midwest Symposium on …, 1996 - ieeexplore.ieee.org
We present a new algorithm for drawing lines in a raster device in which a suitable data
structure has been chosen to avoid comparisons that are required, for example, in Bresenham's …
Save Cite Cited by 5 Related articles
[PDF] tandfonline.comFull View
A Datta, M Hossain, M Kaykobad - International Journal of …, 2008 - Taylor & Francis
<p>The problem of ranking players in a round-robin tournament, in which the outcome of any
match is a win or a loss, is to rank them according to their performances in the tournament. …
Save Cite Cited by 4 Related articles All 6 versions
*…, NZ Nahim, T Anwar, M Kaykobad - … on Computer and …, 2022 - ieeexplore.ieee.org
Hurricanes are tropical storms that cause substantial loss of human life and property. Damage
assessment after a storm is vital for emergency personnel to allocate resources suitably. …
MS Rahman, M Kaykobad, MT Kaykobad - Electronic Notes in Discrete …, 2013 - Elsevier
In this paper, we present Dirac-type sufficient conditions for a bipartite graph to possess a
Hamiltonian path. We also define a seemingly new family of bipartite graphs, which we call the …
Save Cite Cited by 3 Related articles All 3 versions
JL De Carufel, T Kaykobad - Information Processing Letters, 2021 - Elsevier
We study the number of simultaneous diagonal flips required to transform any triangulation
into any other. The best known algorithm requires no more than 4 × ( 2 log 54 53 + 2 log …
Save Cite Cited by 1 Related articles
MM Murshed, M Kaykobad - … of the 9th International Conference of …, 1998 - researchgate.net
In the last decade, the use of Bengali scripts in daily computer usage has gained wide
acceptance in Bangladesh. Wide ranges of Bengali software have been developed so far to meet …
MM Murshed, M Kaykobad - Information processing letters, 1996 - Elsevier
We make a correction to the calculation of mean seek time in a recent algorithm of
intelligently positioned two-headed disk systems. We also introduce a new two-headed disk …
Save Cite Cited by 3 Related articles All 12 versions
…, RA Chowdhury, M Kaykobad - International journal of …, 2003 - Taylor & Francis
<p>In this paper, we present improved algorithms for min-max pair heaps introduced by S.
Olariu <italic>et al.</italic> (A Mergeable Double-ended Priority Queue - <italic>The Comp. J.…
Save Cite Cited by 3 Related articles All 14 versions
N Ibtehaz, M Kaykobad… - arXiv preprint arXiv …, 2018 - researchgate.net
Updating and querying on a range is a classical algorithmic problem with a multitude of
applications. The Segment Tree data structure is particularly notable in handling the range query …
Save Cite Cited by 2 Related articles
T Imam, M Kaykobad - Computers & Mathematics with Applications, 2005 - Elsevier
Symbolic substitution, a parallel processing technique, has been proposed in computing
literature to perform fast, carry-free addition of numbers. Several algorithms and corresponding …
Save Cite Cited by 2 Related articles All 5 versions
MM Murshed, MR Syed, M Kaykobad - Interactive multimedia …, 2002 - igi-global.com
… was surprising to learn that no Bengali coding scheme was available which could sort Bengali
texts in complete linguistic order until we have recently proved in (Murshed and Kaykobad…
Save Cite Cited by 2 Related articles All 8 versions
M Shahjalal, M Kaykobad - WALCOM, 2007 - angelfire.com
In this paper we present a new data structure for implementing heapsort algorithm for pairs
of which can be simultaneously stored and processed in a single register. Since time …
Save Cite Cited by 2 Related articles All 8 versions
PP Mitra, R Hasan, M Kaykobad - 2000 - Citeseer
The shortest path problem is one of the most studied problems in computer science. In a
previous paper [7], we suggested an algorithm (the Augmented Shortest Path Algorithm) for the …
Save Cite Cited by 2 Related articles All 5 versions
RA Chowdhury, MZ Rahman, M Kaykobad - Computers & Mathematics with …, 2002 - Elsevier
In this paper, lower and upper bounds for min-max pair heap construction has been presented.
It has been shown that the construction of a min-max pair heap with n elements requires …
Save Cite Cited by 2 Related articles All 11 versions
…, IA Prome, M Kaykobad, T Kaykobad - … on Innovations in …, 2022 - ieeexplore.ieee.org
As the number of journal issues, conferences and the overall scientific literature have been
increasing at an exponential rate, it has become challenging for researchers to find …
MK Kaykobad - 2016 - search.proquest.com
Mobile devices are increasing in an astronomical rate throughout the world. While it is
bringing a lot of comfort to the users it is not coming without any hazards. Now a user is …
Save Cite Cited by 1 Related articles All 4 versions
MK Kaykobad, P Madiraju… - … , 3rd Intl Conf on Big Data …, 2017 - ieeexplore.ieee.org
Mobile devices are increasing in an astronomical rate throughout the world. While it is bringing
a lot of comfort to the users, it introduces new kinds of challenges. A user is susceptible to …
Save Cite Cited by 1 Related articles All 2 versions
M Kaykobad - Olympiads in Informatics, 2013 - ioinformatics.org
This paper details the growing popularity of olympiad-type academic competitions in
Bangladesh. We concentrate on improving our students’ ability to solve problems, develop …
Save Cite Cited by 1 Related articles All 6 versions
MA Wahid, M Kaykobad… - 2010 13th International …, 2010 - ieeexplore.ieee.org
Given a set of n points in the plane, the problem of computing the circular ordering of the
points about a viewpoint v and efficiently maintaining this ordering information as v moves is …
Save Cite Cited by 1 Related articles All 2 versions
SK Nath, RA Chowdhury, M Kaykobad - arXiv preprint cs/0007043, 2000 - arxiv.org
In this paper we present a new data structure for double ended priority queue, called min-max
fine heap, which combines the techniques used in fine heap and traditional min-max heap…
Save Cite Cited by 1 Related articles All 5 versions
M Kaykobad, FJM Salzborn - … , Yangon, Myanmar, February 28–March 2 …, 2021 - Springer
We show that in any digraph on an underlying connected graph with non-negative weights
on its edges, there is a Majority Spanning Tree for which sum of weights of edges of a …
Save Cite Related articles All 2 versions
SMN Arifin, L Mehedy, M Kaykobad - … of International Conference on Computer and …, 2003
Save Cite Cited by 9 Related articles
M Kaykobad, YW Lee, S Lee - 2009 - academia.edu
… ] followed Rahman–Kaykobad condition but did not … –Kaykobad condition based on
existing results. We find out what is the maximum diameter of a graph under Rahman–Kaykobad …
MS Rahman, M Kaykobad, JS Firoz - academia.edu
… improvements over the result of Rahman and Kaykobad [5]. To the best of our … -Kaykobad”
condition was reported in [9]. In particular, in [9], the authors show that “Rahman-Kaykobad” …
M Kaykobad - Olympiads in Informatics, 2013 - ioinformatics.org
This paper details the growing popularity of olympiad-type academic competitions in
Bangladesh. We concentrate on improving our students’ ability to solve problems, develop …
Save Cite Cited by 1 Related articles All 6 versions
MA Wahid, M Kaykobad… - 2010 13th International …, 2010 - ieeexplore.ieee.org
Given a set of n points in the plane, the problem of computing the circular ordering of the
points about a viewpoint v and efficiently maintaining this ordering information as v moves is …
Save Cite Cited by 1 Related articles All 2 versions
SK Nath, RA Chowdhury, M Kaykobad - arXiv preprint cs/0007043, 2000 - arxiv.org
In this paper we present a new data structure for double ended priority queue, called min-max
fine heap, which combines the techniques used in fine heap and traditional min-max heap…
Save Cite Cited by 1 Related articles All 5 versions
M Kaykobad, FJM Salzborn - … , Yangon, Myanmar, February 28–March 2 …, 2021 - Springer
We show that in any digraph on an underlying connected graph with non-negative weights
on its edges, there is a Majority Spanning Tree for which sum of weights of edges of a …
Save Cite Related articles All 2 versions
SMN Arifin, L Mehedy, M Kaykobad - … of International Conference on Computer and …, 2003
Save Cite Cited by 9 Related articles
M Kaykobad, YW Lee, S Lee - 2009 - academia.edu
… ] followed Rahman–Kaykobad condition but did not … –Kaykobad condition based on
existing results. We find out what is the maximum diameter of a graph under Rahman–Kaykobad …
MS Rahman, M Kaykobad, JS Firoz - academia.edu
… improvements over the result of Rahman and Kaykobad [5]. To the best of our … -Kaykobad”
condition was reported in [9]. In particular, in [9], the authors show that “Rahman-Kaykobad” …
M Kaykobad - Olympiads in Informatics, 2013 - ioinformatics.org
This paper details the growing popularity of olympiad-type academic competitions in
Bangladesh. We concentrate on improving our students’ ability to solve problems, develop …
Save Cite Cited by 1 Related articles All 6 versions
MA Wahid, M Kaykobad… - 2010 13th International …, 2010 - ieeexplore.ieee.org
Given a set of n points in the plane, the problem of computing the circular ordering of the
points about a viewpoint v and efficiently maintaining this ordering information as v moves is …
Save Cite Cited by 1 Related articles All 2 versions
SK Nath, RA Chowdhury, M Kaykobad - arXiv preprint cs/0007043, 2000 - arxiv.org
In this paper we present a new data structure for double ended priority queue, called min-max
fine heap, which combines the techniques used in fine heap and traditional min-max heap…
Save Cite Cited by 1 Related articles All 5 versions
M Kaykobad, FJM Salzborn - … , Yangon, Myanmar, February 28–March 2 …, 2021 - Springer
We show that in any digraph on an underlying connected graph with non-negative weights
on its edges, there is a Majority Spanning Tree for which sum of weights of edges of a …
Save Cite Related articles All 2 versions
SMN Arifin, L Mehedy, M Kaykobad - … of International Conference on Computer and …, 2003
Save Cite Cited by 9 Related articles
S Ahmad, M Kaykobad, MN Uddin, AA Begum… - researchgate.net
Conflict is a very common phenomenon in our day-to-day life. It is sprawling around our
activities. There are various kinds of conflict, like personal, social, national, international, …
Save Cite Related articles All 3 versions
M Kaykobad, YW Lee, S Lee - 2009 - academia.edu
… ] followed Rahman–Kaykobad condition but did not … –Kaykobad condition based on
existing results. We find out what is the maximum diameter of a graph under Rahman–Kaykobad …
MS Rahman, M Kaykobad, JS Firoz - academia.edu
… improvements over the result of Rahman and Kaykobad [5]. To the best of our … -Kaykobad”
condition was reported in [9]. In particular, in [9], the authors show that “Rahman-Kaykobad” …
MMMBM Sarwar, MA Sattar, M Kaykobad - 1993 - Citeseer
The last 15 years saw revolutionary changes in the design of algorithms for solving Linear
Programming (LP) problem. The pathological examples of Klee and Minty 6] and Zadeh 7] …
Save Cite Related articles All 2 versions
…, AM Raihan, M Kaykobad - 2010 2nd International …, 2010 - ieeexplore.ieee.org
In any language the letters of that language must be detected unambiguously to form words
or sentences of that language. In this paper, a grammar is represented for the rules of …
Save Cite Related articles All 3 versions
A Rahman, NA Kalimullah, MA Rauf, M Kaykobad… - bup.edu.bd
The success of any country's socio-economic and political development depends not only
on central government but also on the effectiveness and efficiency of local government. The …
Save Cite Related articles All 3 versions
…, TM Islam, MT Parvez, M Kaykobad - Computers & Mathematics …, 2004 - Elsevier
Search trees, specially binary search trees, are very important data structures thatcontributed
immensely to improved performance of different search algorithms. In this paper, we …
Save Cite Related articles All 11 versions
[PDF] tandfonline.comFull View
…, M Shahjalal, M Kaykobad - International Journal of …, 2011 - Taylor & Francis
In this paper, we present an interesting modification to the heap structure which yields a better
comparison-based in-place heapsort algorithm. The number of comparisons is shown to …
Save Cite Related articles All 2 versions
M Kaykobad, R Petreschi - researchgate.net
This special issue of Journal of Graph Algorithms and Applications (JGAA) contains the full
journal versions of a small selection of papers carefully chosen within the research works …
Save Cite Related articles All 4 versions
T Kaykobad - 2017 - tanvirkaykobad.github.io
Parallel algorithms for accurately summing floating-point numbers are investigated and one
is implemented. Primarily Goodrich et al.'s superaccumulator mapreduce algorithm is …
MT Haque, M Kaykobad - Proc. 5th International Conference on Computer and …, 2002
Save Cite Cited by 7 Related articles
S Monzor, M Abedin, M Kaykobad - Proceedings of 5th International Conference on …, 2002
SM Humayun, SH Rahman, M Kaykobad - … of the 15th Annual Conference of BAAS …, 1990
Save Cite Cited by 6 Related articles
…, MA Rahman, SA Sharna, S Mahmud, DM Kaykobad - International Conference on …, 2005
Save Cite Cited by 5 Related articles
…, MS Rahman, MAH Newton, M Kaykobad - 2005 - Working paper, Department of CSE …
Save Cite Cited by 4 Related articles
S Iqbal, M Kaykobad, MS Rahman - 2015
Save Cite Cited by 3 Related articles
M Kaykobad - 1986 - Flinders University of S. Aust.
Save Cite Cited by 3 Related articles
M Kaykobad - to appear
Save Cite Cited by 2 Related articles
SMN ARIFIN, L MEHEDY, M KAYKOBAD - Accuracy, 6th ICCIT, 2003
SM Humayun, SH Rahman, M Kaykobad - … of the 15th Annual Conference of BAAS …, 1990
Save Cite Cited by 6 Related articles
…, MA Rahman, SA Sharna, S Mahmud, DM Kaykobad - International Conference on …, 2005
Save Cite Cited by 5 Related articles
…, MS Rahman, MAH Newton, M Kaykobad - 2005 - Working paper, Department of CSE …
Save Cite Cited by 4 Related articles
S Iqbal, M Kaykobad, MS Rahman - 2015
Save Cite Cited by 3 Related articles
M Kaykobad - 1986 - Flinders University of S. Aust.
Save Cite Cited by 3 Related articles
…, SM Rahman, M Kaykobad - National Conference on …, 1997 - research.monash.edu
… Nazmul Haque, Syed M Rahman, Mohammed Kaykobad …
Save Cite Cited by 2 Related articles
M Kaykobad - 2012 - FORUM
Save Cite Cited by 2 Related articles
SMN ARIFIN, L MEHEDY, M KAYKOBAD - Accuracy, 6th ICCIT, 2003
SM Humayun, SH Rahman, M Kaykobad - … of the 15th Annual Conference of BAAS …, 1990
Save Cite Cited by 6 Related articles
…, MA Rahman, SA Sharna, S Mahmud, DM Kaykobad - International Conference on …, 2005
Save Cite Cited by 5 Related articles
…, MS Rahman, MAH Newton, M Kaykobad - 2005 - Working paper, Department of CSE …
Save Cite Cited by 4 Related articles
S Iqbal, M Kaykobad, MS Rahman - 2015
Save Cite Cited by 3 Related articles
M Kaykobad - 1986 - Flinders University of S. Aust.
Save Cite Cited by 3 Related articles
…, SM Rahman, M Kaykobad - National Conference on …, 1997 - research.monash.edu
… Nazmul Haque, Syed M Rahman, Mohammed Kaykobad …
Save Cite Cited by 2 Related articles
SMN ARIFIN, L MEHEDY, M KAYKOBAD - Accuracy, 6th ICCIT, 2003
SM Humayun, SH Rahman, M Kaykobad - … of the 15th Annual Conference of BAAS …, 1990
Save Cite Cited by 6 Related articles
…, MA Rahman, SA Sharna, S Mahmud, DM Kaykobad - International Conference on …, 2005
Save Cite Cited by 5 Related articles
…, MS Rahman, MAH Newton, M Kaykobad - 2005 - Working paper, Department of CSE …
Save Cite Cited by 4 Related articles
S Iqbal, M Kaykobad, MS Rahman - 2015
Save Cite Cited by 3 Related articles
M Kaykobad - 1986 - Flinders University of S. Aust.
Save Cite Cited by 3 Related articles
…, SM Rahman, M Kaykobad - National Conference on …, 1997 - research.monash.edu
… Nazmul Haque, Syed M Rahman, Mohammed Kaykobad …
Save Cite Cited by 2 Related articles
M Kaykobad - 2012 - FORUM
Save Cite Cited by 2 Related articles
SMN ARIFIN, L MEHEDY, M KAYKOBAD - Accuracy, 6th ICCIT, 2003
MA Haq, MN Islam, LT Jeba, IA Prome, PR Roy - 2022 - dspace.bracu.ac.bd
… Mohammad Kaykobad and co-advisor M Tanvir Kaykobad for their kind support and advice
throughout this work. Without their direction and motivation completion of this thesis was …
Save Cite Related articles All 2 versions
University of Dhaka… - 2001 - Department of Computer Science …
L Sun - Applied Mathematics E-Notes, 2007 - emis.dsd.sztaki.hu
In [2], Rahman and Kaykobad present an algorithm to construct a spanning tree with degree
bounded by independence number. In this paper, we prove that every connected graph G …
Accepting
As: |
|
Level: |
Undergraduate & Postgraduate |
Type: |
|
Graph Theory, Systems of Linear Equations, Computational Geometry, General Algorithms, Ranking algorithms, Linear programming
