5 citations · 7 across the 12 of their papers we have counts for
30 papers
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1
We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motiva…
Graph Product Structure for h-Framed Graphs
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding struc…
The Mixed Page Number of Graphs
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, call…
On the Queue Number of Planar Graphs
Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou
A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimizati…
On Morphing 1-Planar Drawings
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani +1
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of p…
On Mixed Linear Layouts of Series-Parallel Graphs
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann +1
A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same…