38 citations · 77 across the 28 of their papers we have counts for
13 papers · 1 filter
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…
Grid Drawings of Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +3
We study the algorithmic problem of computing drawings of graphs in which each vertex is a disk with fixed radius , each edge is a straight-line segment connecting…
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
Michael A. Bekos, Carla Binucci, Michael Kaufmann +3
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component…
Simple Compact Monotone Tree Drawings
Anargyros Oikonomou, Antonios Symvonis
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a…
Low Ply Drawings of Trees
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer +5
We consider the recently introduced model of \emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribu…
Upward Point Set Embeddability for Convex Point Sets is in
Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
In this paper, we present a polynomial dynamic programming algorithm that tests whether a -vertex directed tree has an upward planar embedding into a convex point-set of…