Md. Saidur Rahman

Dr. Md. Saidur Rahman, a professor of Bangladesh University of Engineering and Technology (BUET) and a fellow of Bangladesh Academy of Sciences, is a renowned researcher in the field of graph algorithms and is regarded as an authority on graph drawing algorithms. He has more than 130 publications on algorithms and graph theory in internationally reputed journals and conferences. He has developed many efficient algorithms for finding drawings for planar graphs which have enormous applications in VLSI layout automation, software engineering, DNA recognition, etc. His graduate textbook “Planar Graph Drawing,” written with renowned computer scientist Professor Takao Nishizeki, is considered as the most valuable pioneering work in planar graph drawings. He has co-edited five volumes of LNCS series of Springer and served as guest editors for several reputed journals including Algorithmica and Theoretical Computer science. Currently he is in the editorial board of several international Journals including the Journal of Graph Algorithms and Applications and International Journal of Foundation of Computer Science. His undergraduate textbook “Basic Graph Theory” which has been published by Springer has received around 62,000 downloads within six years. Professor Rahman is leading an enthusiastic research group in Graph Drawing and Information Visualization Laboratory of CSE Department, BUET. He has supervised four Ph. D. theses and 27 M. Sc. Engg. theses. He is a recipient of “BAS Gold Medal 2003” in the junior group, “UGC Award 2004” and the prestigious “Funai Information Technology Award for Young Researchers 2004.” Prof. Rahman is a founder of the International Conference and Workshops on Algorithms and Computation (WALCOM) which has appeared as a very prestigious international venue of theoretical computer science over the years. Professor Rahman worked as a member of expert panels of various national and international bodies. Currently he is a member of Board of Accreditation for Engineering and Technical Education (BAETE), Bangladesh which is a full signatory of Washingtom Accord, and also a member of BAETE Evaluation Team (ET). In BUET administration, he showed excellent administrative capabilities as the Registrar, the Director of Institutional Quality Assurance Cell (IQAC) and Head of CSE Department of BUET.

Professor Rahman served as the Chair of BUET ACM Chapter for two consecutive terms during 2016-2018.  He   served the IEEE Computer Society Bangladesh Chapter as the Educational Activity Coordinator in 2020 and as Vice-Chair (Technical) in 2021.   He played the role of a founder of International Conference and Workshops on Algorithms and Computation (WALCOM) in 2007 which has appeared as a prestigious venue for theoretical computer science over the years. 

• Design of Enumeration Algorithms: A Tool to Assist 4IR
  You are going to buy a new apartment where you are allowed to choose a floorplan of the apartment. The development company has an AI expert system which shows you a floorplan. If you do not...
• Drawing Planar Graphs
  A graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar...
• Generating Scale-Free Networks with Graph Theoretic Properties
  Generating synthetic networks with special properties is an important topic of research in network science. Generating algorithms enable researchers to replicate complex network structures,...
• Graph Drawing Algorithms in VLSI Design Automation
  A graph consists of a set of vertices and a set of edges, each joining two vertices.  A drawing of a graph can be thought of as a diagram consisting of a collection of objects corresponding...
• On Connectivity and Realizability of Triangle Cover Contact Graphs
  Let S = {p1, p2, . . . , pn} be a set of pairwise disjoint geometric objects of some type in a 2D plane and let C = {c1, c2, . . . , cn} be a set of closed objects of some type in the same plane...
• Relating Planar Graph Drawings to Planar Satisfiability Problems
  A graph G=(V, E) consists of a set of vertices V and a set of edges E, where every edge e ∈ E makes a relationship between two vertices. Graph theory has numerous applications in computer...
• Research on Pairwise Compatibility Graphs: Current State and Open Problems
  Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where dmin ≤ dmax. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such that each vertex...