2 citations · 2 across the 1 of their papers we have counts for
7 papers
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs
Giordano Da Lozzo, William E. Devanny, David Eppstein +1
A square-contact representation of a planar graph maps vertices in to interior-disjoint axis-aligned squares in the plane and edges in to adjacencies between the…
Analogies between the crossing number and the tangle crossing number
Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz +8
Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of…
Planar L-Drawings of Directed Graphs
Steven Chaplick, Markus Chimani, Sabine Cornelsen +5
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence o…
On the Complexity of Realizing Facial Cycles
Giordano Da Lozzo, Ignaz Rutter
We study the following combinatorial problem. Given a planar graph and a set of simple cycles in , find a planar embedding of such that t…
Strengthening Hardness Results to 3-Connected Planar Graphs
Giordano Da Lozzo, Ignaz Rutter
In this paper we extend some classical NP-hardness results from the class of 2-connected planar graphs to subclasses of 3-connected planar graphs. The reduction are partly based on…
How to morph planar graph drawings
Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz +10
Given an -vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous tra…