>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members

  Username:

  Password:

 Dr. Md. Saidur Rahman (ডঃ মোঃ সাইদুর রহমান)


Professor

  •  Contact:


    • Department of Computer Science and Engineering
    Bangladesh University of Engineering and Technology
    Dhaka 1000, Bangladesh

  •  Telephone:

    • Office: 880 2 9665650/6414, 6198
    Cell:
    Residence: 880 2 9665650/7136

  •  Email: saidurrahman AT cse DOT buet DOT ac DOT bd

  •  Homepage: http://teacher.buet.ac.bd/saidurrahman

  •  Research Area:

    • Algorithms and Theory
    Bioinformatics
    Systems and Networking
    VLSI

  •  Research Interest:

    • Graph Drawing
    Graph Partitioning
    VLSI Layout Algorithms
    Network Routing Protocols
    Bioinformatics
    Distributed Systems
    Grid Computing
    Graph Data Mining

  •  Academic Background:

    • Ph.D., Information Sciences, 1999
    Tohoku University, Japan

    M.Sc., Information Sciences, 1996
    Tohoku University, Japan

    M.Sc. in Computer Science and Engineering, 1992
    Bangladesh University of Engineering and Technology

    B.Sc. in Electrical and Electronic Engineering, 1989
    Bangladesh University of Engineering and Technology

  •  Selected Publications:

    • Text Book

    Takao Nishizeki and Md. Saidur Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004 (a textbook for advanced undergraduate and graduate level).

    Edited Books

    3. Md. Saidur Rahman and Satoshi Fujita (eds), WALCOM: Algorithms and Computation, Proc. of WALCOM 2010, Lecture Notes in Computer Science, 5942, Springer 2010.

    2. Shin-ichi Nakano, Md. Saidur Rahman (eds), WALCOM: Algorithms and Computation, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer 2008.

    1. M. Kaykobad and Md. Saidur Rahman (eds), WALCOM 2007, Proceedings of Workshop on Algorithms and Computation, Bangladesh Academy of Sciences, 2007.

    Guest Editor

    1. Journal of Graph Algorithms and Applications (JGAA)

    2. Journal of Combinatorial Optimization (JOCO)

    Journal Publications

    23. Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid and Md. Saidur Rahman, Discovering Pairwise Compatibility Graphs, Discrete Mathematics, Algorithms and Applications (DMAA) (to appear)

    22. Md. Mostofa Ali Patwary and Md. Saidur Rahman, Minimum Face-Spanning Subgraphs of Plane Graphs, AKCE International Journal of Graphs and Combinatorics (to appear).

    21. Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman, Minimum-layer upward drawings of trees, Journal of Graph Algorithms and Applications, 14(2), pp. 245-267, 2010.

    20. Md. Rezaul Karim and Md. Saidur Rahman, On a class of planar graphs with straight-line grid drawings on linear area, Journal of Graph Algorithms and Applications, 13(2), pp. 153-177, 2009.

    19. Md. Nur Yanhaona, K. S. M. Tozammel Hossain and Md. Saidur Rahman, Pairwise compatibility graphs, Journal of Applied Mathematics and Computing, 30, pp. 479-503, 2009.

    18. Md. Saidur Rahman, Kazuyuki Miura and Takao Nishizeki, Octagonal drawings of plane graphs with prescribed face areas, Computational Geometry: Theory and Applications, 42, pp. 214-230, 2009.

    17. Md. Rezaul Karim, Kaiser Md. Nahiduzzaman and Md. Saidur Rahman, A Linear-Time Algorithm for k-Partitioning Doughnut Graphs, INFOCOMP Journal of Computer Science, 8(1), pp. 8-13, 2009.

    16. Muhammad Abdullah Adnan and Md. Saidur Rahman, Generating all distributions of objects to bins, International Journal of Computer Mathematics, 86(3), pp. 383 - 392, 2009.

    15. Muhammad Abdullah Adnan and Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions, International Journal of Computer Mathematics, 84(7), pp. 953-965, 2007.

    14. Muhammad Abdullah Adnan and Md. Saidur Rahma, Efficient generation of evolutionary trees, INFOCOMP Journal of Computer Science, 6(1), pp. 30-36, 2007.

    13. Md. Saidur Rahman, Noritsugu Egi and Takao Nishizeki, No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs, IEICE Transactions on Information and Systems, E88-D(1), pp. 23-30, 2005.

    12. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, Rectangular drawings of planar graphs, Journal of Algorithms, 50, pp. 62-78, 2004.

    11. Mohammad Mursalin Akon, Shah Asaduzzaman, Md. Saidur Rahman and Mitsuji Matsumoto, Proposal for st-routing protocol, Telecommunication Systems, 25(3, 4), pp. 287- 298, 2004.

    10. Takao Nishizeki, Kazuyuki Miura and Md. Saidur Rahman, Algorithms for drawing plane graphs, IEICE Transactions on Information and Systems, E87-D(2), pp. 281-289, 2004.

    9. Md. Saidur Rahman, Takao Nishizeki and Mahmuda Naznin, Orthogonal drawings of plane graphs without bends, Journal of Graph Algorithms and Applications, 7(4), pp. 335-362, 2003.

    8. Masud Hasan, Md. Saidur Rahman and Takao Nishizeki, A linear algorithm for compact boxdrawing of trees, Networks, 42(3), pp. 160-164, 2003.

    7. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular drawings of plane graphs without designated corners, Computational Geometry: Theory and Applications, 21(3), pp. 121-138, 2002.

    6. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs, Journal of Algorithms, 37, pp. 363-398, 2000.

    5. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, A linear algorithm for bendoptimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Algorithms and Applications, 3(4), pp. 31-62, 1999.

    4. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular grid drawings of plane graphs, Computational Geometry: Theory and Applications, 10(3), pp. 203-220, 1998.

    3. Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki, A linear-time algorithm for four-partitioning four-connected planar graphs, Information Processing Letters, 62, pp. 315- 322, 1997.

    2. Md. Saidur Rahman and Md. Shamsul Alam, Token access protocols in multiple bus local computer networks, Journal of Bangladesh Computer Society, 6(1), pp. 36-44, 1993.

    1. Md. Saidur Rahman and Md. Shamsul Alam, Study of explicit and implicit token passing protocols in multiple bus LAN, Journal of the Institution of Engineers, Bangladesh, 21(4), pp. 87-95, 1993.

    Conferences: Proceedings

    48. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Muhammad Jawaherul Alam, Minimum-Area Drawings of Plane 3-Trees, Proc. of 22nd Canadian Conference on Computational Geometry (CCCG 2010) (to appear).

    47. Sudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat and Md. Saidur Rahman, Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs, Proc. of 16th Annual International Computing and Combinatorics Conference (COCOON 2010) (to appear).

    46. Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid and Md. Saidur Rahman, Discovering Pairwise Compatibility Graphs, Proc. of 16th Annual International Computing and Combinatorics Conference (COCOON 2010) (to appear).

    45. Rahnuma Islam Nishat, Debajyoti Mondal, and Md. Saidur Rahman, Visibility Drawings of Plane 3-Trees, Proc. of 13th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2010) (to appear).

    44. Rahnuma Islam Nishat, Debajyoti Mondal and Md. Saidur Rahman, Point-Set Embeddings of Plane 3-Trees, Proc. of 3rd Annual Meeting of the Asian Association for Algorithms and Computation, 2010.

    43. Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid and Md. Saidur Rahman, Not all graphs are pairwise compatibility graphs,Proc. of 3rd Annual Meeting of the Asian Association for Algorithms and Computation, 2010.

    42. Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano, Generating all triangulations of plane graphs, Proc. of WALCOM 2009, Lecture Notes in Computer Science, 5431, Springer, pp. 151-164, 2009.

    41. Md. Rezaul Karim, Md. Jawaherul Alam and Md. Saidur Rahman, Straight-line grid drawings of label-constrained outerplanar graphs with O(nlogn) area,. Proc. of WALCOM 2009, Lecture Notes in Computer Science, 5431, Springer, pp. 310-321, 2009.

    40. Md. Wasi-ur Rahman, Nusrat Sharmin Islam, and Md. Saidur Rahman, A Linear Algorithm for Floorplan Compaction, Proc. of the 5th International Conference on Electrical and Computer Engineering (ICECE 2008), pp. 964-969, 2008.

    39. Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Andullah Adnan and Md. Saidur Rahman, Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three, Proc. of Graph Drawing 2008, Lecture Notes in Computer Science, 5417, Springer, pp. 408-419, 2009.

    38. Abdullah Al Mueen, Md. Shamsuzzoha Bayzid, Md. Maksudul Alam and Md. Saidur Rahman, "A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction", Proc. of International Conference on BioMedical Engineering and Informatics 2008 (BMEI 2008), IEEE Computer Society, pp. 792-796, 2008.

    37. Md. Jawaherul Alam, Md. Abul Hassan Samee, Md. Mashfiqui Rabbi and Md. Saidur Rahman, Upward Drawings of Trees on the Minimum Number of Layers, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer, pp. 88-99, 2008.

    36. Md. Abul Hassan Samee, Mohammad Tanvir Irfan and Md. Saidur Rahman: Computing beta -Drawings of 2-Outerplane Graphs in Linear Time, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer, pp. 81-87, 2008.

    35. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain and Md. Saidur Rahman, Pairwise Compatibility Graphs, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, pp. 222-233, Springer, 2008.

    34. Md. Rezaul Karim and Md. Saidur Rahman, Four-Connected Spanning Subgraphs of Doughnut Graphs, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer, pp. 132-143, 2008.

    33. Md. Rezaul Karim and Md. Saidur Rahman, Straight-line grid drawings of planar graphs with linear area, Proc. of Asia-Pacific Symposium on vusualisation (APVIS 2007), pp. 109- 112, IEEE, 2007.

    32. Md. Saidur Rahman, Current research on planar graphs, Proc. of International Conference on Information and Communication Technology (ICICT 2007), pp. 148-149, 2007.

    31. Muhammad Abdullah Adnan and Md. Saidur Rahman, Efficient generation of evolutionary trees, Proc. of International Conference on Information and Communication Technology (ICICT 2007), pp. 32-35, 2007.

    30. Md. Abul Hasan Samee and Md. Saidur Rahman, Visualization of complete graphs, trees and series-parallel graphs for practical applications, Proc. of International Conference on Information and Communication Technology (ICICT 2007), pp. 22-26, 2007.

    29. Md. Abul Hassan Samee and Md. Saidur Rahman, Upward Ppanar drawings of seriesparallel digraphs with maximum degree three, Proc. Workshop on Algorithms and Computation (WALCOM 2007), pp. 28-45, 2007.

    28. Muhammad Abdullah Adnan and Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions, Proc. of Workshop on Algorithms and Computation (WALCOM 2007), pp. 136-150, 2007.

    27. Mohammad Tanvir Irfan and Md. Saidur Rahman, Computing $beta$-drawings of 2- outerplane graphs, Proc. Workshop on Algorithms and Computation (WALCOM 2007), pp. 46-61, 2007.

    26. Md. Mostofa Ali Patwary and Md. Saidur Rahman, Minimum face-spanning subgraphs of plane graphs, Proc. Workshop on Algorithms and Computation (WALCOM 2007), pp. 62- 75, 2007.

    25. Zalia Shams, Shahina Ferdous, Kazi Zakia Sultana and Md. Saidur Rahman, On resource bipartitioning problem, Proc. of 4th International Conference on Electrical and Computer Engineering (ICECE 2006), pp. 308-311, 2006.

    24. Md. Saidur Rahman, Noritsugu Egi and Takao Nishizeki, No-bend orthogonal drawings of series-parallel graphs, Proc. of Graph Drawing 2005, Lecture Notes in Computer Science, 3843, Springer, pp. 409-420, 2005.

    23. Md. Saidur Rahman, Kazuyuki Miura and Takao Nishizeki, Octagonal drawings of plane graphs with prescribed face areas, Proc. of 30th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), Lecture Notes in Computer Science, 3353, Springer, pp. 320- 331, 2004.

    22. Md. Saidur Rahman, Noritsugu Egi and Takao Nishizeki, No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs, Proc. of Graph Drawing 2003, Lecture Notes in Computer Science, 2912, Springer, pp. 387-392, 2004.

    21. Md. Saidur Rahman, Noritsugu Egi and Takao Nishizeki, Algorithm for no-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs, Proc. of 7th Japan-Korea workshop on Algorithms and Computation, pp.252-266, 2003.

    20. Md. Saidur Rahman, Kazuyuki Miura and Takao Nishizeki, A linear algorithm for prescribed-area octagonal drawings of plane graphs, Proc. of FIT 2003, Information Technology Letters, 2, pp. 15-16, 2003.

    19. Ragib Hasan, Meetesh Barua, Pradipta Prometheus Mitra, Jalaluddin Mahmud and Md. Saidur Rahman, Design of a graph drawing and visualization system, Proc. of 5th International Conference on Computer and Information Technology (ICCIT 2002), pp. 41- 46, 2002.

    18. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, Rectangular drawings of planar graphs, Proc. of Graph Drawing 2002 (GD 2002), Lecture Notes in Computer Science, 2528, Springer, pp. 244-255, 2002.

    17. Md. Saidur Rahman and Takao Nishizeki, Bend-minimum orthogonal drawings of plane 3- graphs, Proc. of 28th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Lecture Notes in Computer Science, 2573, Springer, pp. 367-378, 2002.

    16. Masud Hasan, Md. Saidur Rahman and Takao Nishizeki, A linear algorithm for compact boxdrawings of trees, Proc. of 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 154-157, 2002.

    15. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, A linear algorithm for rectangular drawings of planar graphs, Proc. of FIT 2002, Information Technology Letters, 1, pp. 19-20, 2002.

    14. Takao Nishizeki, Kazuyuki Miura and Md. Saidur Rahman, Algorithms for drawing plane graphs, Proc. of 3rd Int. Conf. Parallel and Distributed Computing, Applications and Technologies (PDCAT 2002), pp. 143-150, 2002

    13. Md. Saidur Rahman, Mahmuda Naznin and Takao Nishizeki, Orthogonal drawings of plane graphs without bends, Proc. of Graph Drawing 2001 (GD 2001), Lecture Notes in Computer Science, 2265, Springer, pp. 392-406, 2002.

    12. Suman Saha, A. K. M. Azad and Md. Saidur Rahman, A linear algorithm for automated VLSI floorplanning and routing, Proc. of 4th International Conference on Computer and Information Technology (ICCIT 2001), pp.165-170, 2001.

    11. Md. Saidur Rahman, Rectangular drawings of plane 4-graphs, Proc. of International Conference on Electrical and Computer Engineering (ICECE 2001), pp. 284-286, 2001.

    10. Masud Hasan and Md. Saidur Rahman, A linear algorithm for finding visibility graph of trees, Proc. of International Conference on Electrical and Computer Engineering (ICECE 2001), pp. 287-289, 2001.

    9. Md. Saidur Rahman, Subhashis Ghosh and Takao Nishizeki, Rectangular drawings of subdivisions of 3-connected planar graphs, Proc. of 3rd International Conference on Computer and Information Technology (ICCIT 2000), pp.158-162, 2001.

    8. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular drawings of plane graphs without designated corners, Proc. of 6th Annual International Conference on Computing and Combinatorics (COCOON 2000), Lecture Notes in Computer Science, 1858, Springer, pp. 85-94, 2000.

    7. Md. Saidur Rahman, Mahmuda Naznin, Shin-ichi Nakano and Takao Nishizeki, Orthogonal drawings of biconnected plane graphs without bends, Proc. of 2nd International Conference on Computer and Information Technology (ICCIT 1999), pp.199-203, 1999.

    6. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs, Proc. of 25th Workshop on Graph-Theoretic Concepts in Computer Science (WG 1999), Lecture Notes in Computer Science, 1665, Springer, pp. 250-261, 1999.

    5. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs with designated four corners, Proc. of 1st International Conference on Computer and Information Technology (ICCIT 1998), pp.37-41, 1998.

    4. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs, Proc. of Graph Drawing 1997 (GD 1997), Lecture Notes in Computer Science, 1353, pp. 99-110, 1998.

    3. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, A linear-time algorithm for orthogonal drawings of triconnected cubic plane graphs with the minimum number of bends, Proc. of Japan-Korea joint workshop on Algorithms and Computation, pp.24-31, 1997.

    2. Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki, A linear-time algorithm for four-partitioning four-connected planar graphs, Proc. of Graph Drawing 1996 (GD 1996), Lecture Notes in Computer Science, 1190, pp. 334-344, 1997.

    1. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular grid drawings of plane graphs, Proc. of 2nd Annual International Conference on Computing and Combinatorics (COCOON 1996), Lecture Notes in Computer Science, 1090, pp. 92-105, 1996.

    Conferences: Presentations

    21. Md. Saidur Rahman, Doughnut graphs ant their spanning subgraphs (invited talk), The International Workshop on Algorithms and Graphs (IWAAG 2007), Sendai, Japan, December 2007.

    20. Md. Saidur Rahman, Current research on planar graphs (invited talk), ICICT 2007, Dhaka, Bangladesh, March 2007.

    19. Md. Saidur Rahman, Kazuyuki Miura and Takao Nishizeki, Octagonal drawings of plane graphs with prescribed face areas, WG 2004, Bad Honnef, Germany, June 2004.

    18. Md. Saidur Rahman, Noritsugu Egi and Takao Nishizeki, No-bend Orthogonal drawings of subdivisions of planar triconnected cubic graphs, GD 2003, Perugia, Italy, September 2003.

    17. Md. Saidur Rahman, Kazuyuki Miura and Takao Nishizeki, A linear algorithm for prescribedarea octagonal drawings of plane graphs, FIT 2003, Sapporo, Japan, September 2003.

    16. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, A linear algorithm for rectangular drawings of planar graphs, FIT 2002, Tokyo Institute of Technology, Japan, September 2002.

    15. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, Rectangular drawings of planar graphs, Workshop on Computation, Institute of Electrical and Information Engineers, Tokyo Institute of Technology, Japan, August 2002.

    14. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, Rectangular drawings of planar graphs, Graph Drawing 2002, Irvine, California, August 2002.

    13. Md. Saidur Rahman and Takao Nishizeki, Bend-minimum orthogonal drawings of plane 3- graphs, 27th Workshop on Graph-Theoretic Concepts in Computer Science (WG’02), Cesky Krumlov, Czech Republic, June 2002.

    12. Md. Saidur Rahman and Takao Nishizeki, Bend-optimal orthogonal drawings of plane 3- graphs, Workshop on Computation, Institute of Electrical and Information Engineers, Nihon University, Tokyo, Japan, March 2002.

    11. Md. Saidur Rahman, Mahmuda Naznin and Takao Nishizeki, Orthogonal drawings of plane graphs without bends, Graph Drawing 2001, Vienna, September 2001.

    10. Md. Saidur Rahman, Rectangular drawings of plane 4-graphs, International Conference on Electrical and Computer Engineering (ICECE’2001), Dhaka, Bangladesh, January 2001.

    9. Md. Saidur Rahman, Rectangular drawings of plane graphs (talk), Dept. of Computer Science, Gunma University, Japan, December 2000.

    8. Md. Saidur Rahman, Rectangular Drawings of plane graphs (talk), Graduate School of Information Sciences, Tohoku University, Japan, November 2000.

    7. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular drawings of plane graphs without designated corners, 6th Annual International Conference on Computing and Combinatorics (COCOON 2000), Sydney, Australia, July 2000.

    6. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs, 25th Workshop on Graph-Theoretic Concepts in Computer Science (WG’99), Ascona, Switzerland, June 1999.

    5. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs with designated four corners, 1st International Conference on Computer and Information Technology (ICCIT 1998), Dhaka, Bangladesh, December, 1998.

    4. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Box-rectangular drawings of plane graphs, Workshop on Computations (COMP 98-38), Institute of Electrical and Information Engineers, Sendai, Japan, October 1998.

    3. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular grid drawings of plane graphs, COCOON’96, Hong Kong, June 1996.

    2. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular grid drawings of plane graphs, Annual Conference of Institute of Electrical and Information Engineers, Japan, Tokyo, March 1996.

    1. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, Rectangular grid drawings of plane graphs, 48th Workshop on Algorithms, Information Processing Society of Japan, Kobe, Japan, November 1995.

    Contributions in published books

    Takao Nishizeki and Md. Saidur Rahman, Rectangular drawing algorithms, (Ed.) Roberto Tamassia, Handbook of Graph Drawing and Visualization, CRC Press, 2006 (to appear).

    Theses

    1. Md. Saidur Rahman, Efficient Algorithms for Drawing Planar Graphs, Ph. D. Thesis, Tohoku University, 1999.

    2. Md. Saidur Rahman, A Study on Rectangular Drawing Algorithms for Planar Graphs, M.Sc. Thesis, Tohoku University, 1996.

    3. Md. Saidur Rahman, Study of Token Passing Protocols for Multiple Bus Local Area Networks by Simulation, M. Sc. Engg. Thesis, BUET, 1992.

    4. Md. Saidur Rahman, Computer Aided Evaluation of Voltage Transients in Power System Analysis, B. Sc. Engg. Thesis, BUET, 1989.

    Department of Computer Science and Engineering, EME building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact csewebmaster@gmail.com with questions or comments on this page.  [Development Credits]