Md. Iqbal Hossain

Monotone Grid Drawings of Planar Graphs

A monotone drawing of a planar graph

Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs

G

SQL query based data synchronization in heterogeneous database environment

is a planar straight-line drawing of

A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

G

Straight-Line Monotone Grid Drawings of Series-Parallel Graphs

where a monotone path exists between every pair of vertices of

Good spanning trees in graph drawing

G

Universal line-sets for drawing planar 3-trees

in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this paper we study monotone grid drawings of planar graphs in a variable embedding setting. We show that every connected planar graph of

1-page and 2-page drawings with bounded number of crossings per edge☆

n

On triangle cover contact graphs

vertices has a monotone grid drawing on a grid of size

On Triangle Cover Contact Graphs

O(n)\times O(n^2)