<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>Publications</title>
<link href="http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1955" rel="alternate"/>
<subtitle>Publications</subtitle>
<id>http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1955</id>
<updated>2026-04-06T22:25:14Z</updated>
<dc:date>2026-04-06T22:25:14Z</dc:date>
<entry>
<title>Straight-Line Monotone Grid Drawings of Series-Parallel Graphs</title>
<link href="http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1962" rel="alternate"/>
<author>
<name>Md. Iqbal, Hossain</name>
</author>
<author>
<name>Md. Saidur, Rahman</name>
</author>
<id>http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1962</id>
<updated>2016-02-02T02:57:24Z</updated>
<published>2014-03-20T00:00:00Z</published>
<summary type="text">Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
Md. Iqbal, Hossain; Md. Saidur, Rahman; Md. Iqbal, Hossain
A monotone drawing of a planar graph G is a planar straight-line drawing of G where&#13;
a monotone path exists between every pair of vertices of G in some direction. Recently&#13;
monotone drawings of graphs have been discovered as a new standard for visualizing&#13;
graphs. In this paper we study monotone drawings of series–parallel graphs in a variable&#13;
embedding setting. We show that a series–parallel graph of n vertices has a straight-line&#13;
planar monotone drawing on a grid of size O(n) × O(n2) and such a drawing can be&#13;
found in linear time.
</summary>
<dc:date>2014-03-20T00:00:00Z</dc:date>
</entry>
</feed>
