6 citations · 13 across the 6 of their papers we have counts for
6 papers
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…
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode
Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson
We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, wh…
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments
Md. Jawaherul Alam, Michael Dillencourt, Michael T. Goodrich
Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices…
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…
Weak Unit Disk and Interval Representation of Planar Graphs
Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev +1
We study a variant of intersection representations with unit balls, that is, unit disks in the plane and unit intervals on the line. Given a planar graph and a bipartition of the e…
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…