Dr. Md. Abul Kashem Mia
Dr. Md. Abul Kashem Mia
ডঃ মোঃ আবুল কাশেম মিয়া
Professor
  • kashem AT cse DOT buet DOT ac DOT bd
  • 880 2 55167100 Ext: 6430
  • 880 1819 259910
  • Department of Computer Science and Engineering
    Bangladesh University of Engineering and Technology
    Dhaka 1000, Bangladesh
Biography
x
Education
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
Research Interest
Algorithms
Parallel Processing
Graph Theory
Graph Visualization
Computational Complexity
Publications
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. Conference
2. 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. Journal DOI
3. 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. Conference DOI
4. 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. Journal
5. 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. Conference
6. 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. Conference DOI
7. 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. Journal
8. 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. Conference DOI
9. 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. Conference DOI
10. 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. Conference
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. Conference
12. 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. Conference DOI
13. 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. Conference
14. 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. Conference DOI
15. 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. Journal
16. 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. Conference
17. 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. Conference
18. 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. Conference DOI
19. 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. Conference
20. 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. Journal DOI
21. 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. Journal DOI
22. 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. Conference
23. 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. Conference
24. 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. Conference
25. 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. Conference
26. 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. Conference
27. 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. Conference
28. 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. Conference
29. 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. Conference
30. 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. Conference
31. 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. Conference
32. 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. Conference
33. M. A. Kashem, X. Zhou, and T. Nishizeki, Algorithms for generalized vertex-rankings of partial k-trees, Theoretical Computer Science, 240, 407--427, 2000. Journal DOI
34. 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. Conference
35. M. Hasan, M. A. Kashem, An efficient line drawing algorithm, Proceedings of International Conference on Computer and Information Technology (ICCIT’99), 204 – 207, 1999. Conference
36. 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. Conference
37. 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. Conference
38. 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. Journal
39. 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. Conference
40. 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. Conference
41. 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. Conference
42. M. A. Kashem, S. M. Rahman, Printed Bangla alphabetic character recognition by syntactic method, ournal of Bangladesh Computer Society, 6, 3-Sep, 1993. Journal

Copyright © Department of Computer Science and Engineering, BUET, Dhaka-1000.