The SCEAS System
| |||||||

## Search the dblp DataBase
Md. Saidur Rahman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
**Rectangular Drawings of Planar Graphs.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2002, pp:244-255 [Conf] - 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] - 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] - 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] - Md. Saidur Rahman, Takao Nishizeki
**Bend-Minimum Orthogonal Drawings of Plane 3-Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2002, pp:367-378 [Conf] - 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] - Mohammad Tanvir Irfan, Md. Saidur Rahman
**Computing beta-Drawings of 2-Outerplane Graphs.**[Citation Graph (0, 0)][DBLP] WALCOM, 2007, pp:46-61 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Mohammad Mursalin Akon, Shah Asaduzzaman, Md. Saidur Rahman, Mitsuji Matsumoto
**Proposal for**[Citation Graph (0, 0)][DBLP]*st*-Routing Protocol. Telecommunication Systems, 2004, v:25, n:3-4, pp:287-298 [Journal] **Straight-line grid drawings of planar graphs with linear area.**[Citation Graph (, )][DBLP]**Minimum-area drawings of plane 3-trees.**[Citation Graph (, )][DBLP]**Discovering Pairwise Compatibility Graphs.**[Citation Graph (, )][DBLP]**Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs.**[Citation Graph (, )][DBLP]**Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.**[Citation Graph (, )][DBLP]**Generating All Triangulations of Plane Graphs (Extended Abstract).**[Citation Graph (, )][DBLP]**Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract).**[Citation Graph (, )][DBLP]**Upward Drawings of Trees on the Minimum Number of Layers.**[Citation Graph (, )][DBLP]**Four-Connected Spanning Subgraphs of Doughnut Graphs.**[Citation Graph (, )][DBLP]**Computing**[Citation Graph (, )][DBLP]*beta*-Drawings of 2-Outerplane Graphs in Linear Time.**Pairwise Compatibility Graphs.**[Citation Graph (, )][DBLP]**A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction.**[Citation Graph (, )][DBLP]**Octagonal drawings of plane graphs with prescribed face areas.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |