Saidur Rahman (professor) explained

Saidur Rahman
Native Name:সাইদুর রহমান
Native Name Lang:bn
Birth Date:31 December 1966
Birth Place:Bangladesh
Alma Mater:Tohoku University, Bangladesh University of Engineering and Technology
Known For:Graph Drawing, Graph Algorithms, Computational Geometry
Workplaces:Bangladesh University of Engineering and Technology

Saidur Rahman is a computer scientist, graph theorist, and professor at Bangladesh University of Engineering and Technology.[1]

He is an author of the book Planar Graph Drawing.[2] He is known for his contribution in graph drawing, graph algorithms, computational geometry, and several other branches of theoretical computer science. Together with his student Md. Iqbal Hossain he defined an interesting structure of spanning trees in embedded planar graphs called good spanning trees.[3]

Education

Rahman completed his Ph.D. on graph drawing algorithms under the supervision of Dr. Takao Nishizeki of Tohoku University, Japan in 1999. He also worked as a JSPS postdoctoral fellow and as an associate professor in Tohoku University during the period 2001–2004.[4] He completed his master's degree in Engineering from Bangladesh University of Engineering and Technology, Bangladesh, in 1992.

Career

Rahman joined Bangladesh University of Engineering and Technology in 1991. After receiving his PhD, he returned to BUET in 2004, and formed a research group consisting of undergraduate and graduate students in its Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology], in 2005. Since then he is doing research on various areas of graph algorithms and applications. Together with Dr. Takao Nishizeki, Rahman wrote a graduate textbook Planar Graph Drawing,[2] which was published by World Scientific in 2004. He also wrote an undergraduate textbook Basic Graph Theory [5] published by Springer in 2017.

WALCOM

In 2007, with the support from Bangladesh Academy of Sciences (BAS), Rahman played the leading role in initiating and establishing the International Workshop on Algorithms and Computation (WALCOM).[6]

Awards and honors

He was recognized as a fellow of Bangladesh Academy of Sciences (BAS) in a comparatively young age.[7] He has received an Information Technology Award [8] 2004 for his contributions in Graph Drawing Algorithms.[9] Rahman has also received Bangladesh Academy of Sciences (BAS) Gold Medal 2003 in the junior group,[10] and University Grants Commission Award 2004.[11]

Selected publications

Books
Research articles

Notes and References

  1. Web site: Faculty List Department of CSE BUET.
  2. Book: 10.1142/5648. Planar Graph Drawing. 12. Lecture Notes Series on Computing. 2004. Nishizeki. Takao. Rahman. Saidur. 978-981-256-033-9.
  3. Hossain. Md. Iqbal. Rahman. Md. Saidur. November 2015. Good spanning trees in graph drawing. Theoretical Computer Science. 607. 149–165. 10.1016/j.tcs.2015.09.004. 0304-3975. free.
  4. Web site: Asso. Prof. @ Tohoku University.
  5. Book: Basic Graph Theory .
  6. Web site: Workshop on Algorithms and Computation (WALCOM).
  7. Web site: List of Fellows - Prof. Dr. Saidur Rahman.
  8. http://www.funaifoundation.jp/english/index.html FUNAI
  9. Web site: 褒賞事業 概要|公益財団法人船井情報科学振興財団(FFIT).
  10. Web site: Academy Gold Medal Award.
  11. Web site: UGC to honour 20 scholars today The Daily Star. 2007-12-26.
  12. Book: Rahman, Md. Saidur. Undergraduate Topics in Computer Science . 2017. Basic Graph Theory. 10.1007/978-3-319-49475-3. 1863-7310. 978-3-319-49474-6.
  13. Book: Nishizeki, T. . Planar graph drawing. 2004. World Scientific. Rahman, Md. Saidur. 978-9812562234. Singapore. 58811676.
  14. Book: Durocher. Stephane. Mondal. Debajyoti. Rahman. Md Saidur. WALCOM: Algorithms and Computation . On Graphs That Are Not PCGS . 2013-02-14. Lecture Notes in Computer Science. 7748 . Springer, Berlin, Heidelberg. 310–321. 10.1007/978-3-642-36065-7_29. 9783642360640.
  15. Rahman. Md.Saidur. Nishizeki. Takao. Ghosh. Shubhashis. January 2004. Rectangular drawings of planar graphs. Journal of Algorithms. 50. 1. 62–78. 10.1016/s0196-6774(03)00126-3. 0196-6774.
  16. Book: Rahman. Saidur. Nakano. Shin-ichi. Nishizeki. Takao. Computing and Combinatorics . Rectangular grid drawings of plane graphs . 1996-06-17. Lecture Notes in Computer Science. 1090 . Springer, Berlin, Heidelberg. 92–105. 10.1007/3-540-61332-3_142. 978-3540613329.
  17. Nakano. Shin-ichi. Rahman. Md.Saidur. Nishizeki. Takao. June 1997. A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters. 62. 6. 315–322. 10.1016/s0020-0190(97)00083-5. 981756 . 0020-0190.
  18. Sultana. Shaheena. Hossain. Md. Iqbal. Rahman. Md. Saidur. Moon. Nazmun Nessa. Hashem. Tahsina. June 2018. On triangle cover contact graphs. Computational Geometry. 69. 31–38. 10.1016/j.comgeo.2017.11.001. 0925-7721. 10150/627861. 43834692 . free.
  19. Nishat. Rahnuma Islam. Mondal. Debajyoti. Rahman. Md. Saidur. April 2012. Point-set embeddings of plane 3-trees. Computational Geometry. 45. 3. 88–98. 10.1016/j.comgeo.2011.09.002. 0925-7721. free.
  20. Mondal. Debajyoti. Nishat. Rahnuma Islam. Rahman. Md. Saidur. Whitesides. Sue. November 2013. Acyclic coloring with few division vertices. Journal of Discrete Algorithms. 23. 42–53. 10.1016/j.jda.2013.08.002. 1570-8667. free.