2 citations · 2 across the 7 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CG2016
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…
cs.CC2016★ 2 cited
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…
cs.CG2016
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…