45 citations · 69 across the 13 of their papers we have counts for
3 papers · 1 filter
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…