73 citations · 634 across the 97 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019★ 4 cited
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich +1
For a clustered graph, i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it is possible to find a planar embeddin…
cs.DS2019
Computing k-Modal Embeddings of Planar Digraphs
Juan Jose Besa, Giordano Da Lozzo, Michael T. Goodrich
Given a planar digraph and a positive even integer , an embedding of in the plane is k-modal, if every vertex of is incident to at most pairs of consecutive edge…