84 citations · 146 across the 36 of their papers we have counts for
4 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…
Many-to-One Boundary Labeling with Backbones
Michael A. Bekos, Sabine Cornelsen, Martin Fink +5
In this paper we study \emph{many-to-one boundary labeling with backbone leaders}. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-e…
On Maximum Differential Coloring of Planar Graphs
M. Bekos, A. Das, M. Geyer +3
We study the \emph{maximum differential coloring problem}, where the vertices of an -vertex graph must be labeled with distinct numbers ranging from to , so that the mini…
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…