2009 |
39 | EE | Mohammad Tanvir Parvez,
Md. Saidur Rahman,
Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs (Extended Abstract).
WALCOM 2009: 151-164 |
38 | EE | Md. Rezaul Karim,
Md. Jawaherul Alam,
Md. Saidur Rahman:
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract).
WALCOM 2009: 310-321 |
37 | EE | Md. Saidur Rahman,
Kazuyuki Miura,
Takao Nishizeki:
Octagonal drawings of plane graphs with prescribed face areas.
Comput. Geom. 42(3): 214-230 (2009) |
2008 |
36 | | Shin-Ichi Nakano,
Md. Saidur Rahman:
WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008.
Springer 2008 |
35 | EE | Abdullah Al Mueen,
Md. Shamsuzzoha Bayzid,
Md. Maksudul Alam,
Md. Saidur Rahman:
A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction.
BMEI (1) 2008: 792-796 |
34 | EE | Md. Abul Hassan Samee,
Md. Jawaherul Alam,
Muhammad Abdullah Adnan,
Md. Saidur Rahman:
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.
Graph Drawing 2008: 408-419 |
33 | EE | Md. Rezaul Karim,
Md. Saidur Rahman:
Four-Connected Spanning Subgraphs of Doughnut Graphs.
WALCOM 2008: 132-143 |
32 | EE | Muhammad Nur Yanhaona,
K. S. M. Tozammel Hossain,
Md. Saidur Rahman:
Pairwise Compatibility Graphs.
WALCOM 2008: 222-233 |
31 | EE | Md. Abul Hassan Samee,
Mohammad Tanvir Irfan,
Md. Saidur Rahman:
Computing beta -Drawings of 2-Outerplane Graphs in Linear Time.
WALCOM 2008: 81-87 |
30 | EE | Md. Jawaherul Alam,
Md. Abul Hassan Samee,
Md. Mashfiqui Rabbi,
Md. Saidur Rahman:
Upward Drawings of Trees on the Minimum Number of Layers.
WALCOM 2008: 88-99 |
2007 |
29 | | M. Kaykobad,
Md. Saidur Rahman:
Workshop on Algorithms and Computation 2007 - Proceedings of First WALCOM, 12 February 2007, Dhaka, Bangladesh
Bangladesh Academy of Sciences (BAS) 2007 |
28 | EE | Md. Rezaul Karim,
Md. Saidur Rahman:
Straight-line grid drawings of planar graphs with linear area.
APVIS 2007: 109-112 |
27 | | Muhammad Abdullah Adnan,
Md. Saidur Rahman:
Distribution of Distinguishable Objects to Bins: Generating All Distributions.
WALCOM 2007: 136-150 |
26 | | Md. Abul Hassan Samee,
Md. Saidur Rahman:
Upward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three.
WALCOM 2007: 28-45 |
25 | | Mohammad Tanvir Irfan,
Md. Saidur Rahman:
Computing beta-Drawings of 2-Outerplane Graphs.
WALCOM 2007: 46-61 |
24 | | Md. Mostofa Ali Patwary,
Md. Saidur Rahman:
Minimum Face-Spanning Subgraphs of Plane Graphs.
WALCOM 2007: 62-75 |
23 | EE | Muhammad Abdullah Adnan,
Md. Saidur Rahman:
Distribution of distinguishable objects to bins: generating all distributions.
Int. J. Comput. Math. 84(7): 953-965 (2007) |
2005 |
22 | EE | Md. Saidur Rahman,
Noritsugu Egi,
Takao Nishizeki:
No-bend Orthogonal Drawings of Series-Parallel Graphs.
Graph Drawing 2005: 409-420 |
21 | EE | Md. Saidur Rahman,
Noritsugu Egi,
Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.
IEICE Transactions 88-D(1): 23-30 (2005) |
2004 |
20 | EE | Md. Saidur Rahman,
Kazuyuki Miura,
Takao Nishizeki:
Octagonal Drawings of Plane Graphs with Prescribed Face Areas.
WG 2004: 320-331 |
19 | EE | Md. Saidur Rahman,
Takao Nishizeki,
Shubhashis Ghosh:
Rectangular drawings of planar graphs.
J. Algorithms 50(1): 62-78 (2004) |
18 | EE | Mohammad Mursalin Akon,
Shah Asaduzzaman,
Md. Saidur Rahman,
Mitsuji Matsumoto:
Proposal for st-Routing Protocol.
Telecommunication Systems 25(3-4): 287-298 (2004) |
2003 |
17 | EE | Md. Saidur Rahman,
Noritsugu Egi,
Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.
Graph Drawing 2003: 387-392 |
16 | EE | Md. Saidur Rahman,
Takao Nishizeki,
Mahmuda Naznin:
Orthogonal Drawings of Plane Graphs Without Bends.
J. Graph Algorithms Appl. 7(4): 335-362 (2003) |
15 | EE | Masud Hasan,
Md. Saidur Rahman,
Takao Nishizeki:
A linear algorithm for compact box-drawings of trees.
Networks 42(3): 160-164 (2003) |
2002 |
14 | EE | Masud Hasan,
Md. Saidur Rahman,
Takao Nishizeki:
A linear algorithm for compact box-drawings of trees.
CCCG 2002: 154-157 |
13 | EE | Md. Saidur Rahman,
Takao Nishizeki,
Shubhashis Ghosh:
Rectangular Drawings of Planar Graphs.
Graph Drawing 2002: 244-255 |
12 | EE | Md. Saidur Rahman,
Takao Nishizeki:
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs.
WG 2002: 367-378 |
11 | | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Rectangular drawings of plane graphs without designated corners.
Comput. Geom. 21(3): 121-138 (2002) |
2001 |
10 | EE | Md. Saidur Rahman,
Mahmuda Naznin,
Takao Nishizeki:
Orthogonal Drawings of Plane Graphs without Bends.
Graph Drawing 2001: 392-406 |
2000 |
9 | EE | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Rectangular Drawings of Plane Graphs Without Designated Corners.
COCOON 2000: 85-94 |
8 | | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs.
J. Algorithms 37(2): 363-398 (2000) |
1999 |
7 | EE | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs.
WG 1999: 250-261 |
6 | EE | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
J. Graph Algorithms Appl. 3(4): 31-62 (1999) |
1998 |
5 | | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Rectangular grid drawings of plane graphs.
Comput. Geom. 10(3): 203-220 (1998) |
1997 |
4 | | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
Graph Drawing 1997: 99-110 |
3 | EE | Shin-Ichi Nakano,
Md. Saidur Rahman,
Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.
Inf. Process. Lett. 62(6): 315-322 (1997) |
1996 |
2 | | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Rectangular Grid Drawings of Plane Graphs.
COCOON 1996: 92-105 |
1 | | Shin-Ichi Nakano,
Md. Saidur Rahman,
Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.
Graph Drawing 1996: 334-344 |