1 citations · 1 across the 16 of their papers we have counts for
6 papers · 1 filter
An Experimental Study of a 1-planarity Testing and Embedding Algorithm
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
The definition of -planar graphs naturally extends graph planarity, namely a graph is -planar if it can be drawn in the plane with at most one crossing per edge. Unfortunatel…
Crossing Numbers of Beyond-Planar Graphs
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani +1
We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are -vertex 1-planar (quas…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page c…
ChordLink: A New Hybrid Visualization Model
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani +2
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature m…
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Given a planar graph and an integer , OrthogonalPlanarity is the problem of deciding whether admits an orthogonal drawing with at most bends in total. We show that O…