45 citations · 69 across the 13 of their papers we have counts for
14 papers
On Dispersable Book Embeddings
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
In a dispersable book embedding, the vertices of a given graph must be ordered along a line l, called spine, and the edges of G must be drawn at different half-planes bounded b…
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…
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…
Pixel and Voxel Representations of Graphs
Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter +2
We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose…
Phase locking a clock oscillator to a coherent atomic ensemble
R. Kohlhaas, A. Bertoldi, E. Cantin +3
The sensitivity of an atomic interferometer increases when the phase evolution of its quantum superposition state is measured over a longer interrogation interval. In practice, a l…
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…
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…
Happy Edges: Threshold-Coloring of Regular Lattices
Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev +1
We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t…
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs…