Dr. Md. Abul Kashem Mia (ডঃ মোঃ আবুল কাশেম মিয়া)

Professor

Research Area:

Research Interest:

Algorithms
Parallel Processing
Graph Theory
Graph Visualization
Computational Complexity

Academic Background:

Ph.D
Tohoku University, Japan

M.S. (System Information Science)
Tohoku University, Japan

M.Sc. in Computer Science and Engineering
Bangladesh University of Engineering and Technology

B.Sc. in Electrical and Electronic Engineering
Bangladesh University of Engineering and Technology

Selected Publications:

Book Chapter:

1.	M. A. Kashem Mia, X. Zhou, T. Nishizeki, Generalized vertex-rankings of partial k-trees, In book: Computing and Combinatorics, DOI: 10.1007/BFb0045088, Springer, November 2006.

Journal Publications:

10.	R. Karim, M. M. Al Aziz, S. Shatabda, M. S. Rahman, M. A. Kashem Mia, F. Zaman, S. Rakin, CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein Tertiary Structure Retrieval, Scientific Reports (www.nature.com/scientificreports) 5(13275 (2015)), DOI: 10.1038/srep13275, August 2015.
9.	T. Awal, M. Mahbubuzzaman, M.A. Kashem Mia, Algorithms for Finding Generalized Coloring of Trees, Infocomp Journal of Computer Science, Vol. 10(1), pp. 36-44, March 2011.
8.	M. A. Kashem, M. D. Hossain, Design and implementation of a system architecture for large and secured online institutional system, Journal of Multidisciplinary (IEB), accepted on 10 September 2010.
7.	M. R. Rahman, M. A. Kashem, M. E. Haque, An efficient on-line algorithm for edge-ranking of trees, Infocomp Journal of Computer Science, Vol. 7, pp. 21-25, 2008.
6.	R. Bernazzani, E. Murelli, G. Zanrei, T. Arvanitis, M. A. Kashem Mia, K. A. Bhuiyan, E-health & learning: health informatics training courses for practitioners in Bangladesh (e-HL-HIC), Technology and health care: official journal of the European Society for Engineering and Medicine, 13(5):363-364, December 2005.
5.	M. A. Kashem, M. Z. Rahman, An optimal parallel algorithm for c-vertex-ranking of trees, Information Processing Letters, Elsevier Science, DOI: 10.1016/j.ipl.2004.07.007, Vol. 92, No. 4, pp. 179-184, 30 November 2004.
4.	P. P. Mitra, M. A. Abedin, and M. A. Kashem, Efficient algorithms for solving the symmetry number problem on trees, Information Processing Letters, Elsevier Science, Vol. 91, No. 4, DOI: 10.1016/j.ipl.2004.04.011, pp. 163-169, 31 August 2004.
3.	M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized vertex-rankings of partial k-trees, Theoretical Computer Science, DOI: 10.1016/S0304-3975(99)00240-6, vol. 240, pp. 407-427, 2000.
2.	X. Zhou, M. A. Kashem, and T. Nishizeki, Generalized edge-rankings of trees, IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, vol. E81-A (2), pp. 310-320, 1998.
1.	M. A. Kashem, S. M. Rahman, Printed Bangla alphabetic character recognition by syntactic method, Journal of Bangladesh Computer Society, vol. 6 (1), pp. 03-09, 1993.

Conference Proceedings Publications:

42.	M. S. Islam, S. Saha, M. S. Rahman, M. A. Kashem Mia, Pattern Identification on Protein Sequences of Neurodegenerative Diseases Using Association Rule Mining, Proceedings of the Seventh International Conference on Advances in Computing, Electronics and Communication (ACEC 2018), ISBN: 978-1-63248-157-3, DOI: 10.15224/978-1-63248-157-3-12, Kuala Lumpur, Malaysia, 2018.
41.	M. S. Rahman, M.A. Kashem Mia, An Efficient Seeded Tree Alignment Algorithm for Finding the Similarity Score of Two RNA Secondary Structures, Proceedings of 13th International Conference on Computer and Information Technology (ICCIT 2010), DOI: 10.1109/ICCITECHN. 2010.5723822, pp. 15 – 20, December 2010.
40.	T. Awal, M. Mahbubuzzaman, M.A. Kashem Mia, Algorithm for l-vertex-coloring of trees, Proceedings of the 6th International Conference on Electrical and Computer Engineering (ICECE2010), DOI: 10.1109/ICELCE.2010.5700747, pp. 534-537, December 2010.
39.	S. I. Khan, M. A. Kashem, M. A. Hoque, Design and analysis of a mini solar grid in remote area of Bangladesh, Proceedings of North American Power Symposium (NAPS 2009), DOI: 10.1109/NAPS.2009.5484056, October 2009.
38.	A. S. Arefin, M. A. Kashem Mia, NP-Completeness of the minimum edge-ranking spanning tree problem on series-parallel graphs, Proceedings of 10th International Conference on Computer and Information Technology (ICCIT 2007), DOI: 10.1109/ICCITECHN.2007. 4579371, pp. 13-16, January 2008.
37.	M. R. Rahman, E. Haque, M. Islam, M. A. Kashem Mia, On-Line Algorithms for Vertex-Rankings of Graphs, Proceedings of International Conference on Information and Communication Technology (ICICT '07), DOI: 10.1109/ICICT.2007.375335, pp. 22 – 26, April 2007.
36.	M. A. Haque, M. R. Uddin, M. A. Kashem, An algorithm for finding minimum degree spanning tree of series-parallel graphs, Proceedings of the International Conference on Information and Communication Technology (ICICT2007), DOI: 10.1109/ICICT.2007. 375336, pp. 27 – 31, April 2007.
35.	M. L. Ali, S. M. L. Kabir, M. J. B. Alam, M. A. Kashem, Module-based Edukit for Teaching and Learning Micro-Controller Programming" Proceedings of Methods, Materials and Tools for Programming Education, Tampere, Finland, pp. 67-70, 2006.
34.	T. Hashem, U. K. Paul, M. A. Kashem Mia, An algorithm for c-vertex-ranking of starlike graphs, Proceedings of the 4th International Conference on Electrical and Computer Engineering (ICECE2006), DOI: 10.1109/ICECE.2006.355635, pp. 316 – 319, 2006.
33.	M. A. Kashem, C. S. Hasan, A. Bhattacharjee, An algorithm for solving the minimum vertex-ranking spanning tree problem on series-parallel graphs, Proceedings of the 4th International Conference on Electrical and Computer Engineering (ICECE2006), pp. 328 – 332, 2006.
32.	T. Hashem, M. A. Kashem Mia, A linear-time approximation algorithm for edge-ranking of series-parallel graphs, Proceedings of the 9th International Conference on Computer and Information Technology (ICCIT2006), pp. 39 – 44, 2006.
31.	M. R. Rahman, M. A. Kashem, M. E. Haque, An on-line algorithm for edge-ranking of trees, Proceedings of the 9th International Conference on Computer and Information Technology (ICCIT2006), pp. 51 – 54, 2006.
30.	M. Y. SarwarUddin, N. Talukder, M. A. Kashem, A heuristic approach to solving the distinct p-center problem, Proceedings of the 8th International Conference on Computer and Information Technology (ICCIT2005), pp. 7 – 12, 2005.
29.	U. K. Paul, T. Hashem, M. A. Kashem, An algorithm for c-edge-ranking of a starlike graph, Proceedings of the 8th International Conference on Computer and Information Technology (ICCIT2005), pp. 886 – 891, 2005.
28.	M. S. Rahman, M. A. Kashem Mia, Degree restricted spanning trees of graphs, Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, DOI: 10.1145/ 967900.967949, pp. 225-228, January 2004.
27.	M. S. Rahman, M. A. Kashem Mia, An Efficient Algorithm for Finding an Independency Tree, Proceedings of the 7th International Conference on Computer and Information Technology (ICCIT2004), 2004.
26.	M. T. Irfan, A. M. H. M. Bhuiyan, M. A. Kashem Mia, An Approximation Algorithm for Finding Minimum Elimination Tree Height of a Graph, Proceedings of the 7th International Conference on Computer and Information Technology (ICCIT2004), 2004.
25.	M. A. Kashem, M. Z. Rahman, An optimal parallel algorithm for c-vertex-ranking of trees, Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC'03), Japan, Lecture Notes in Computer Science, vol. 2906, pp. 464-473, December 2003.
24.	O. Chowdhury, D. Roy, S. Ashik, M. A. Kashem, Vertex Covering by Weighted Paths on Trees and its Subtree Variation, Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT2003), 2003.
23.	M. A. Kashem, An Efficient Algorithm for l-vertex-Colorings of Partial k-trees, Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT2003), 2003.
22.	M. A. Kashem, M. I. Khan, An efficient algorithm for l-vertex-colorings of partial k-trees, Proceedings of International Conference on Electrical and Computer Engineering (ICECE2002), pp. 21 – 26, 2002.
21.	M. A. K. Newton, M. A. Kashem, A parallel algorithm for optimal c-vertex-ranking of permutation graphs, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), pp. 55 – 60, 2002.
20.	M. S. Rahman, M. A. Kashem, Degree restricted spanning trees of graphs, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), pp. 50 – 52, 2002.
19.	M. A. Kashem, M. Y. Ali, A parallel algorithm for l-vertex-coloring of partial k-trees, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), pp. 61 – 66, 2002.
18.	P. P. Mitra, M. A. Abedin, and M. A. Kashem, Efficient algorithms for solving the symmetry number problem on trees, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), pp. 27 – 31, 2002.
17.	M. A. Kashem, I. Nargis, and M. A. Alam, Solving an open problem on the star chromatic number, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), pp. 21 – 26, 2002.
16.	M. A. Kashem, A. Yasmeen, Optimal l-vertex-colorings of series-parallel graphs, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), pp. 103 – 107, 2001.
15.	S. M. N. Alam, M. A. Kashem, Weighted vertex-ranking problem is NP-Complete even for paths, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), pp. 99 – 102, 2001.
14.	M. A. Kashem, M. E. Haque, Edge-ranking problem is NP-Complete even for series-parallel graphs, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), pp. 108 – 112, 2001.
13.	M. A. Kashem, A. Yasmeen, Optimal l-vertex-coloring of trees, Proceedings of Interna-tional Conference on Computer and Information Technology (ICCIT2000), pp. 151 – 153, 2001.
12.	M. A. Kashem, M. M. Hasan and S. M. N. Alam, Optimal c-vertex-ranking of weighted trees, Proceedings of International Conference on Computer and Information Technology (ICCIT2000), pp. 154 – 157, 2001.
11.	M. Z. Rahman, M. A. Kashem, An optimal parallel algorithm for c-vertex-ranking of trees, Proceedings of International Conference on Electrical and Computer Engineering (ICECE2001), pp. 277 – 280, 2001.
10.	M. A. Kashem, M. Z. Rahman, An efficient algorithm for optimal c-vertex-ranking of series-parallel graphs, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), pp. 309 – 314, 1999.
9.	A. Z. M. Shahriar, K. Mahbub, and M. A. Kashem, Optimal algorithms for star chromatic number of planar graphs, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), pp. 304 – 308, 1999.
8.	M. A. K. Newton, M. A. Kashem, An efficient algorithm for optimal vertex-ranking of permutation graphs, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), pp. 315 – 320, 1999.
7.	M. Hasan, M. A. Kashem, An efficient line drawing algorithm, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), pp. 204 – 207, 1999.
6.	M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized edge-rankings of partial k-trees with bounded maximum degree, Proceedings of International Conference on Computer and Information Technology (ICCIT’98), pp. 45 – 51, 1998.
5.	M. A. Kashem, X. Zhou, and T. Nishizeki, Generalized vertex-rankings of partial k-trees, Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON’97), Shanghai, Chaina, Lecture Notes in Computer Science, Springer-Verlag, vol. 1276, pp. 212 – 221, 1997.
4.	M. A. Kashem, X. Zhou, and T. Nishizeki, An NC parallel algorithm for generalized vertex-rankings of partial k-trees, Proceedings of International Symposium on Parallel Architec-tures, Algorithms and Networks, (ISPAN’97), Taiwan, DOI: 10.1109/ISPAN.1997.645078, pp. 105 – 111, 1997.
3.	X. Zhou, M. A. Kashem, and T. Nishizeki, Generalized edge-rankings of trees, Proceedings of the 22nd. International Workshop on Graph-Theoretic Concepts in Computer Science (WG’96), Italy, Lecture Notes in Computer Science, Springer-Verlag, DOI: 10.1007/3-540-62559-3_31, vol. 1197, pp. 390 - 404, 1997.
2.	S. M. Rahman, and M. A. Kashem, Analysing structure of printed Bangla characters for computer recognition, Proceedings of the 11th. International Conference of the International Society for Computers and Their Applications, San Francisco, California, pp. 223 - 226, 1996.
1.	S. M. Rahman, and M. A. Kashem, Computer recognition of printed Bangla characters using syntactic method, Proceedings of the 14th. Conference of the South East Asia Regional Computer Confederation, Colombo, Sri Lanka, pp. 129 - 138, 1995.

Journal Papers:

1.	Rezaul Karim, Mohd. Momin Al Aziz, Swakkhar Shatabda, M. Sohel Rahman, Md. Abul Kashem Mia, Farhana Zaman and Salman Rakin, CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein Tertiary Structure Retrieval, Scientific reports, 5, 13275, 2015. [paper link]
2.	M. A. Kashem, M. D. Hossain, Design and implementation of a system architecture for large and secured online institutional system, Journal of Multidisciplinary (IEB), 2010.
3.	M. R. Rahman, Md. A. Kashem, Md. Ehtesamul Haque, An Efficient On-Line Algorithm for Edge-Ranking of Trees, INFOCOMP Journal of Computer Science, 7, 21-25, 2008.
4.	R. Bernazzani, E. Murelli, G. Zanrei, T. Arvanitis, M. A. Kashem Mia, K. A. Bhuiyan, E-health & learning: health informatics training courses for practitioners in Bangladesh (e-HL-HIC), Technology and Health Care, 13, 363--364, 2005.
5.	P. P. Mitra, M. A. Abedin, and M. A. Kashem, Algorithms for solving the symmetry number problem on trees, Information Processing Letters, 91, 163-169, 2004. [paper link]
6.	M. A. Kashem, andM. Z. Rahman, An optimal parallel algorithm for c-vertex-ranking of trees, Information Processing Letters, Elsevier Science, 92, 179--184, 2004. [paper link]
7.	M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized vertex-rankings of partial k-trees, Theoretical Computer Science, 240, 407--427, 2000. [paper link]
8.	X. Zhou, M. A. Kashem, and T. Nishizeki, Generalized edge-rankings of trees, IEICE transactions on fundamentals of electronics, communications and computer sciences, 81, 310--320, 1998.
9.	M. A. Kashem, S. M. Rahman, Printed Bangla alphabetic character recognition by syntactic method, ournal of Bangladesh Computer Society, 6, 3-Sep, 1993.

Conference Papers:

1.	M. S. Islam, S. Saha, M. S. Rahman, and M. A. Kashem Mia, Pattern identification on protein sequences of neurodegenerative diseases using association rule mining, Proceedings of the seventh international conference on advances in computing, electronics and communication (ACEC 2018), Kuala Lumpur, Malaysia, 10, 2018.
2.	M. S. Rahman, M.A. Kashem Mia, An efficient seeded tree alignment algorithm for finding the similarity score of two RNA secondary structures, 2010 13th International Conference on Computer and Information Technology (ICCIT), 15--20, 2010. [paper link]
3.	Tanveer Awal, M. Mahbubuzzaman, M. A. Kashem, Algorithm for l-Vertex-coloring of Trees, In Proceedings of the 6th International Conference on Electrical and Computer Engineering, 534-537, 2010.
4.	S. I. Khan, M. A. Kashem, M. A. Hoque, Design and analysis of a mini solar grid in remote area of Bangladesh, 41st North American Power Symposium, 1--5, 2009. [paper link]
5.	A. S. Arefin, and M. A. Kashem Mia, NP-Completeness of the minimum edge-ranking spanning tree problem on series-parallel graphs, 2007 10th international conference on computer and information technology, 1--4, 2008. [paper link]
6.	M. A. Haque, M. R. Uddin, M. A. Kashem, An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs, 2007 International Conference on Information and Communication Technology, 27--31, 2007. [paper link]
7.	M. R. Rahman, Md. Ehtesamul Haque, M. Islam, Md. A. Kashem, On-Line Algorithms for Vertex-Rankings of Graphs, Proc. of the International Conference on Information and Communication Technology (ICICT 2007), 22-26, 2007.
8.	T. Hashem, and M. A. Kashem Mia, Approximation algorithm for edge-ranking of series-parallel graphs, Approximation algorithm for edge-ranking of series-parallel graphs, 2006.
9.	M. A. Kashem, C. S. Hasan, A. Bhattacharjee, An algorithm for solving the minimum vertex-ranking spanning tree problem on series-parallel graphs, 2006 International Conference on Electrical and Computer Engineering, 28--332, 2006. [paper link]
10.	T. Hashem, U. K. Paul, M. A. Kashem Mia, An algorithm for c-vertex-ranking of starlike graphs, 2006 International Conference on Electrical and Computer Engineering, 316-319, 2006. [paper link]
11.	M. L. Ali, S. M. L. Kabir, M. J. B. Alam, M. A. Kashem, Module-based Edukit for Teaching and Learning Micro-Controller Programming, Proceedings of Methods, Materials and Tools for Programming Education, 67-70, 2006.
12.	U. K. Paul, T. Hashem, M. A. Kashem, An algorithm for c-edge-ranking of a starlike graph, Proceedings of the 8th International Conference on Computer and Information Technology (ICCIT2005), 886 – 891, 2005.
13.	M. S. Rahman, M. A. Kashem Mia, An Efficient Algorithm for Finding an Independency Tree, roceedings of the 7th International Conference on Computer and Information Technology (ICCIT2004), 2004.
14.	M. S. Rahman, M. A. Kashem Mia, Degree restricted spanning trees of graphs, Proceedings of the 2004 ACM Symposium on applied computing, 225--228, 2004. [paper link]
15.	Mohammad Tanvir Irfan, A. M. H. M. Bhuiyan, M. A. Kashem, An Approximation Algorithm for Finding Minimum Elimination Tree Height of a Graph, Proceedings of International Conference on Computer and Information Technology (ICCIT), 2004.
16.	M. A. Kashem, M. I. Khan, An Efficient Algorithm for l-vertex-Colorings of Partial k-trees, Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT2003), 2003.
17.	O. Chowdhury, D. Roy, S. Ashik, M. A. Kashem, Vertex Covering by Weighted Paths on Trees and its Subtree Variation, Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT2003), 2003.
18.	M. A. Kashem, I. Nargis, and M. A. Alam, olving an open problem on the star chromatic number, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), 21 – –26, 2002.
19.	P. P. Mitra, M. A. Abedin, and M. A. Kashem, fficient algorithms for solving the symmetry number problem on trees, roceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), 27 – –31, 2002.
20.	M. A. Kashem, M. Y. Ali, A parallel algorithm for l-vertex-coloring of partial k-trees, roceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), 61 – –66, 2002.
21.	M. A. K. Newton, M. A. Kashem, A parallel algorithm for optimal c-vertex-ranking of permutation graphs, Proceedings of the 5th International Conference on Computer and Information Technology (ICCIT2002), 55 – –60, 2002.
22.	M. A. Kashem, M. M. Hasan and S. M. N. Alam, Optimal c-vertex-ranking of weighted trees, Proceedings of International Conference on Computer and Information Technology (ICCIT2000), 2001.
23.	M. A. Kashem, A. Yasmeen, Optimal l-vertex-coloring of trees, Proceedings of Interna-tional Conference on Computer and Information Technology (ICCIT2000), 151 – –153, 2001.
24.	M. A. Kashem, M. E. Haque, Edge-ranking problem is NP-Complete even for series-parallel graphs, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), 108 – –112, 2001.
25.	S. M. N. Alam, M. A. Kashem, eighted vertex-ranking problem is NP-Complete even for paths, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), 99 – –102, 2001.
26.	M. A. Kashem, A. Yasmeen, Optimal l-vertex-colorings of series-parallel graphs, roceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), 103 – – 107, 2001.
27.	M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized edge-rankings of partial k-trees with bounded maximum degree, Proceedings of International Conference on Computer and Information Technology (ICCIT’98), 45 – 51, 1999.
28.	M. Hasan, M. A. Kashem, An efficient line drawing algorithm, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), 204 – 207, 1999.
29.	M. A. K. Newton, M. A. Kashem, n efficient algorithm for optimal vertex-ranking of permutation graphs, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), 315 – 320, 1999.
30.	A. Z. M. Shahriar, K. Mahbub, and M. A. Kashem, ptimal algorithms for star chromatic number of planar graphs, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), 304 – 308, 1999.
31.	M. A. Kashem, X. Zhou, and T. Nishizeki, An NC parallel algorithm for generalized vertex-rankings of partial k-trees, Proceedings of International Symposium on Parallel Architec-tures, Algorithms and Networks, (ISPAN’97), 105 – 111, 1997.
32.	M. A. Kashem, X. Zhou, and T. Nishizeki, Generalized vertex-rankings of partial k-trees, Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON’97), 212 – 221, 1997.
33.	S. M. Rahman, and M. A. Kashem, Analysing structure of printed Bangla characters for computer recognition, Proceedings of the 11th. International Conference of the International Society for Computers and Their Applications, 223 - 226, 1996.