45 citations · 69 across the 13 of their papers we have counts for
6 papers · 1 filter
The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number…
On the Book Thickness of 1-Planar Graphs
Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called…
On Contact Graphs with Cubes and Proportional Boxes
Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
We study two variants of the problem of contact representation of planar graphs with axis-aligned boxes. In a cube-contact representation we realize each vertex with a cube, while…
Contact Representations of Sparse Planar Graphs
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann +4
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is…
Balanced Circle Packings for Planar Graphs
Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich +2
We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle's diameter is polyno…
Smooth Orthogonal Drawings of Planar Graphs
Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann +3
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this pa…