Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani +1
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the…
cs.DM2017
New Results on Edge Partitions of 1-plane Graphs
Emilio Di Giacomo, Walter Didimo, William S. Evans +4
A -plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a -plane graph such that any two pairs of crossing edges sha…