Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
The Price of Upwardness
Patrizio Angelini, Therese Biedl, Markus Chimani +8
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyon…
cs.CG2024
Eliminating Crossings in Ordered Graphs
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann +4
Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest…