52 citations · 107 across the 10 of their papers we have counts for
3 papers · 1 filter
Small Superpatterns for Dominance Drawing
Michael J. Bannister, William E. Devanny, David Eppstein
We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets…
Fixed parameter tractability of crossing minimization of almost-trees
Michael J. Bannister, David Eppstein, Joseph A. Simons
We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In pa…
Parameterized Complexity of 1-Planarity
Michael J. Bannister, Sergio Cabello, David Eppstein
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this…