5 citations · 8 across the 22 of their papers we have counts for
7 papers · 1 filter
Beyond-Planarity: Density Results for Bipartite Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with…
Planar Drawings of Fixed-Mobile Bigraphs
Michael Bekos, Felice De Luca, Walter Didimo +4
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, tog…
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
Michael A. Bekos, Henry Förster, Michael Kaufmann
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting…
3D Visibility Representations of 1-planar Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parall…
Hierarchical Partial Planarity
Patrizio Angelini, Michael A. Bekos
In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they ap…
On Optimal 2- and 3-Planar Graphs
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. While for , optimal -planar graphs, i.e., those with vertices an…