Остановите войну!
for scientists:
default search action
Md. Saidur Rahman 0001
Publications
- 2013
- [r1]Takao Nishizeki, Md. Saidur Rahman:
Rectangular Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 317-348 - 2009
- [j16]Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki:
Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. 42(3): 214-230 (2009) - 2005
- [j11]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. IEICE Trans. Inf. Syst. 88-D(1): 23-30 (2005) - [c12]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-bend Orthogonal Drawings of Series-Parallel Graphs. GD 2005: 409-420 - 2004
- [b1]Takao Nishizeki, Md. Saidur Rahman:
Planar Graph Drawing. Lecture Notes Series on Computing 12, World Scientific 2004, ISBN 981-256-033-5, pp. 1-312 - [j10]Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman:
Algorithms for Drawing Plane Graphs. IEICE Trans. Inf. Syst. 87-D(2): 281-289 (2004) - [j9]Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular drawings of planar graphs. J. Algorithms 50(1): 62-78 (2004) - [c11]Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki:
Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG 2004: 320-331 - 2003
- [j7]Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin:
Orthogonal Drawings of Plane Graphs Without Bends. J. Graph Algorithms Appl. 7(4): 335-362 (2003) - [j6]Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003) - [c10]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. GD 2003: 387-392 - 2002
- [j5]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002) - [c9]Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees. CCCG 2002: 154-157 - [c8]Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular Drawings of Planar Graphs. GD 2002: 244-255 - [c7]Md. Saidur Rahman, Takao Nishizeki:
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. WG 2002: 367-378 - 2001
- [c6]Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki:
Orthogonal Drawings of Plane Graphs without Bends. GD 2001: 392-406 - 2000
- [j4]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000) - [c5]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94 - 1999
- [j3]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) - [c4]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261 - 1998
- [j2]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998) - 1997
- [j1]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) - [c3]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. GD 1997: 99-110 - 1996
- [c2]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105 - [c1]Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD 1996: 334-344
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 18:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint