8 citations · 10 across the 5 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013
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…
cs.DS2013★ 2 cited
Set-Difference Range Queries
David Eppstein, Michael T. Goodrich, Joseph A. Simons
We introduce the problem of performing set-difference range queries, where answers to queries are set-theoretic symmetric differences between sets of items in two geometric ranges.…