The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Md. Saidur Rahman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
    A linear algorithm for compact box-drawings of trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:154-157 [Conf]
  2. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Drawings of Plane Graphs Without Designated Corners. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:85-94 [Conf]
  3. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:92-105 [Conf]
  4. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:334-344 [Conf]
  5. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:387-392 [Conf]
  6. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-bend Orthogonal Drawings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:409-420 [Conf]
  7. Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
    Rectangular Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:244-255 [Conf]
  8. Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
    Orthogonal Drawings of Plane Graphs without Bends. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:392-406 [Conf]
  9. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:99-110 [Conf]
  10. Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki
    Octagonal Drawings of Plane Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:320-331 [Conf]
  11. Md. Saidur Rahman, Takao Nishizeki
    Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:367-378 [Conf]
  12. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:250-261 [Conf]
  13. Mohammad Tanvir Irfan, Md. Saidur Rahman
    Computing beta-Drawings of 2-Outerplane Graphs. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:46-61 [Conf]
  14. Md. Mostofa Ali Patwary, Md. Saidur Rahman
    Minimum Face-Spanning Subgraphs of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:62-75 [Conf]
  15. Md. Abul Hassan Samee, Md. Saidur Rahman
    Upward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:28-45 [Conf]
  16. Muhammad Abdullah Adnan, Md. Saidur Rahman
    Distribution of Distinguishable Objects to Bins: Generating All Distributions. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:136-150 [Conf]
  17. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular drawings of plane graphs without designated corners. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:121-138 [Journal]
  18. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular grid drawings of plane graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:203-220 [Journal]
  19. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:23-30 [Journal]
  20. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:315-322 [Journal]
  21. Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
    Rectangular drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:62-78 [Journal]
  22. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:363-398 [Journal]
  23. Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin
    Orthogonal Drawings of Plane Graphs Without Bends. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:335-362 [Journal]
  24. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:31-62 [Journal]
  25. Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
    A linear algorithm for compact box-drawings of trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:3, pp:160-164 [Journal]
  26. Mohammad Mursalin Akon, Shah Asaduzzaman, Md. Saidur Rahman, Mitsuji Matsumoto
    Proposal for st-Routing Protocol. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2004, v:25, n:3-4, pp:287-298 [Journal]

  27. Straight-line grid drawings of planar graphs with linear area. [Citation Graph (, )][DBLP]


  28. Minimum-area drawings of plane 3-trees. [Citation Graph (, )][DBLP]


  29. Discovering Pairwise Compatibility Graphs. [Citation Graph (, )][DBLP]


  30. Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs. [Citation Graph (, )][DBLP]


  31. Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. [Citation Graph (, )][DBLP]


  32. Generating All Triangulations of Plane Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


  33. Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). [Citation Graph (, )][DBLP]


  34. Upward Drawings of Trees on the Minimum Number of Layers. [Citation Graph (, )][DBLP]


  35. Four-Connected Spanning Subgraphs of Doughnut Graphs. [Citation Graph (, )][DBLP]


  36. Computing beta -Drawings of 2-Outerplane Graphs in Linear Time. [Citation Graph (, )][DBLP]


  37. Pairwise Compatibility Graphs. [Citation Graph (, )][DBLP]


  38. A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction. [Citation Graph (, )][DBLP]


  39. Octagonal drawings of plane graphs with prescribed face areas. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002