Saidur Rahman (professor)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Md. Saidur Rahman
Saidur Rahman (professor).jpg
Born (1966-12-31) December 31, 1966 (age 53)
Bangladesh
Alma materTohoku University, Bangladesh University of Engineering and Technology
Known forGraph Drawing, Graph Algorithms, Computational Geometry
Scientific career
Fields
InstitutionsBangladesh University of Engineering and Technology
Websitesaidurrahman.buet.ac.bd

Md. Saidur Rahman (Bengali: মোঃ সাইদুর রহমান) 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[edit]

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 Masters in Engineering from Bangladesh University of Engineering and Technology, Bangladesh, in 1992.

Career[edit]

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[edit]

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[edit]

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[edit]

Books
  • Rahman, Md. Saidur (2017), Basic Graph Theory, Undergraduate Topics in Computer Science, Springer, ISBN 978-3-319-49475-3.[12]
  • Nishizeki, Takao; Rahman, Md. Saidur (2004), Planar Graph Drawing, Lecture Notes Series on Computing, 12, World Scientific, doi:10.1142/5648, ISBN 978-981-256-033-9, MR 2112244.[13]
Research articles
  • Durocher, S.; Mondal, D.; Rahman, Md. S. (2015), "On graphs that are not PCGs", Theoretical Computer Science, 571: 78–87, doi:10.1016/j.tcs.2015.01.011.[14]
  • Rahman, Md. S.; Nishizeki, T.; Ghosh, S. (2004), "Rectangular drawings of planar graphs.", Journal of Algorithms, 50 (1): 62–78, doi:10.1016/S0196-6774(03)00126-3.[15]
  • Rahman, Md. S.; Nakano, S.-I.; Nishizeki, T. (1998), "Rectangular grid drawings of plane graphs", Computational Geometry, 10 (3): 203–220, doi:10.1016/S0925-7721(98)00003-0.[16]
  • Nakano, S.-I.; Rahman, Md. S.; Nishizeki, T. (1997), "A linear-time algorithm for four-partitioning four-connected planar graphs.", Information Processing Letters, 62 (6): 315–322, doi:10.1016/S0020-0190(97)00083-5.[17]
  • Md. Iqbal Hossain, Md. Saidur Rahman: "Good spanning trees in graph drawing". Theor. Comput. Sci. 607: 149-165 (2015)[3]
  • Shaheena Sultana, Md. Iqbal Hossain, Md. Saidur Rahman, Nazmun Nessa Moon, Tahsina Hashem: On triangle cover contact graphs. Comput. Geom. 69: 31-38 (2018)[18]
  • Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman: Point-set embeddings of plane 3-trees. Comput. Geom. 45(3): 88-98 (2012)[19]
  • Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides: Acyclic coloring with few division vertices. J. Discrete Algorithms 23: 42-53 (2013)[20]

References[edit]

  1. ^ "Faculty List | Department of CSE | BUET".
  2. ^ a b Nishizeki, Takao; Rahman, Md Saidur (2004). Planar Graph Drawing. Lecture Notes Series on Computing. 12. doi:10.1142/5648. ISBN 978-981-256-033-9.
  3. ^ a b Hossain, Md. Iqbal; Rahman, Md. Saidur (November 2015). "Good spanning trees in graph drawing". Theoretical Computer Science. 607: 149–165. doi:10.1016/j.tcs.2015.09.004. ISSN 0304-3975.
  4. ^ "Asso. Prof. @ Tohoku University".
  5. ^ [1],
  6. ^ "Workshop on Algorithms and Computation (WALCOM)".
  7. ^ "List of Fellows - Prof. Dr. Md. Saidur Rahman".
  8. ^ FUNAI
  9. ^ "褒賞事業 概要|公益財団法人船井情報科学振興財団(FFIT)".
  10. ^ "Academy Gold Medal Award".
  11. ^ "UGC to honour 20 scholars today | The Daily Star". December 26, 2007.
  12. ^ Rahman, Md. Saidur (2017). Basic Graph Theory. Undergraduate Topics in Computer Science. doi:10.1007/978-3-319-49475-3. ISBN 978-3-319-49474-6. ISSN 1863-7310.
  13. ^ 1947-, Nishizeki, T. (Takao) (2004). Planar graph drawing. Rahman, Md. Saidur, 1966-. Singapore: World Scientific. ISBN 978-9812562234. OCLC 58811676.
  14. ^ Durocher, Stephane; Mondal, Debajyoti; Rahman, Md Saidur (February 14, 2013). On Graphs That Are Not PCGs. WALCOM: Algorithms and Computation. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. pp. 310–321. doi:10.1007/978-3-642-36065-7_29. ISBN 9783642360640.
  15. ^ Rahman, Md.Saidur; Nishizeki, Takao; Ghosh, Shubhashis (January 2004). "Rectangular drawings of planar graphs". Journal of Algorithms. 50 (1): 62–78. doi:10.1016/s0196-6774(03)00126-3. ISSN 0196-6774.
  16. ^ Rahman, Saidur; Nakano, Shin-ichi; Nishizeki, Takao (June 17, 1996). Rectangular grid drawings of plane graphs. Computing and Combinatorics. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. pp. 92–105. doi:10.1007/3-540-61332-3_142. ISBN 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. doi:10.1016/s0020-0190(97)00083-5. ISSN 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. doi:10.1016/j.comgeo.2017.11.001. hdl:10150/627861. ISSN 0925-7721.
  19. ^ Nishat, Rahnuma Islam; Mondal, Debajyoti; Rahman, Md. Saidur (April 2012). "Point-set embeddings of plane 3-trees". Computational Geometry. 45 (3): 88–98. doi:10.1016/j.comgeo.2011.09.002. ISSN 0925-7721.
  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. doi:10.1016/j.jda.2013.08.002. ISSN 1570-8667.