Dr. Md. Abul Kashem Mia (ডঃ মোঃ আবুল কাশেম মিয়া) Professor [On Leave] Contact: Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka 1000, Bangladesh Telephone:Office: 880 2 55167100 Ext: 6430 Cell: 880 1819 259910 Residence: 880 2 55167100 Ext: 7687 Email: kashem AT cse DOT buet DOT ac DOT bd Homepage: 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 vertexrankings of partial ktrees, 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. 3644, 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 online algorithm for edgeranking of trees, Infocomp Journal of Computer Science, Vol. 7, pp. 2125, 2008.

6. 
R. Bernazzani, E. Murelli, G. Zanrei, T. Arvanitis, M. A. Kashem Mia, K. A. Bhuiyan, Ehealth & learning: health informatics training courses for practitioners in Bangladesh (eHLHIC), Technology and health care: official journal of the European Society for Engineering and Medicine, 13(5):363364, December 2005.

5. 
M. A. Kashem, M. Z. Rahman, An optimal parallel algorithm for cvertexranking of trees, Information Processing Letters, Elsevier Science, DOI: 10.1016/j.ipl.2004.07.007, Vol. 92, No. 4, pp. 179184, 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. 163169, 31 August 2004.

3. 
M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized vertexrankings of partial ktrees, Theoretical Computer Science, DOI: 10.1016/S03043975(99)002406, vol. 240, pp. 407427, 2000.

2. 
X. Zhou, M. A. Kashem, and T. Nishizeki, Generalized edgerankings of trees, IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, vol. E81A (2), pp. 310320, 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. 0309, 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: 9781632481573, DOI: 10.15224/978163248157312, 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 lvertexcoloring of trees, Proceedings of the 6th International Conference on Electrical and Computer Engineering (ICECE2010), DOI: 10.1109/ICELCE.2010.5700747, pp. 534537, 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, NPCompleteness of the minimum edgeranking spanning tree problem on seriesparallel graphs, Proceedings of 10th International Conference on Computer and Information Technology (ICCIT 2007), DOI: 10.1109/ICCITECHN.2007. 4579371, pp. 1316, January 2008.

37. 
M. R. Rahman, E. Haque, M. Islam, M. A. Kashem Mia, OnLine Algorithms for VertexRankings 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 seriesparallel 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, Modulebased Edukit for Teaching and Learning MicroController Programming" Proceedings of Methods, Materials and Tools for Programming Education, Tampere, Finland, pp. 6770, 2006.

34. 
T. Hashem, U. K. Paul, M. A. Kashem Mia, An algorithm for cvertexranking 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 vertexranking spanning tree problem on seriesparallel 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 lineartime approximation algorithm for edgeranking of seriesparallel 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 online algorithm for edgeranking 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 pcenter 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 cedgeranking 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. 225228, 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 cvertexranking of trees, Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC'03), Japan, Lecture Notes in Computer Science, vol. 2906, pp. 464473, 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 lvertexColorings of Partial ktrees, Proceedings of the 6th International Conference on Computer and Information Technology (ICCIT2003), 2003.

22. 
M. A. Kashem, M. I. Khan, An efficient algorithm for lvertexcolorings of partial ktrees, 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 cvertexranking 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 lvertexcoloring of partial ktrees, 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 lvertexcolorings of seriesparallel 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 vertexranking problem is NPComplete 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, Edgeranking problem is NPComplete even for seriesparallel graphs, Proceedings of the 4th International Conference on Computer and Information Technology (ICCIT2001), pp. 108 – 112, 2001.

13. 
M. A. Kashem, A. Yasmeen, Optimal lvertexcoloring of trees, Proceedings of International Conference on Computer and Information Technology (ICCIT2000), pp. 151 – 153, 2001.

12. 
M. A. Kashem, M. M. Hasan and S. M. N. Alam, Optimal cvertexranking 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 cvertexranking 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 cvertexranking of seriesparallel 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 vertexranking 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 edgerankings of partial ktrees 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 vertexrankings of partial ktrees, Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON’97), Shanghai, Chaina, Lecture Notes in Computer Science, SpringerVerlag, vol. 1276, pp. 212 – 221, 1997.

4. 
M. A. Kashem, X. Zhou, and T. Nishizeki, An NC parallel algorithm for generalized vertexrankings of partial ktrees, Proceedings of International Symposium on Parallel Architectures, 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 edgerankings of trees, Proceedings of the 22nd. International Workshop on GraphTheoretic Concepts in Computer Science (WG’96), Italy, Lecture Notes in Computer Science, SpringerVerlag, DOI: 10.1007/3540625593_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:
Conference Papers:
