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…
Force-Directed Graph Drawing Using Social Gravity and Scaling
Michael J. Bannister, David Eppstein, Michael T. Goodrich +1
Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in…