Fully Retroactive Approximate Range and Nearest Neighbor Searching. - Michael T. Goodrich; Joseph A. Simons (ISAAC, 2011)

More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. - Michael T. Goodrich; Joseph A. Simons (GD, 2012)

Inapproximability of Orthogonal Compaction. - Michael J. Bannister; David Eppstein; Joseph A. Simons (J. Graph Algorithms Appl., 2012)

Set-Difference Range Queries. - David Eppstein; Michael T. Goodrich; Joseph A. Simons (CCCG, 2013)

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. - Michael J. Bannister; David Eppstein; Joseph A. Simons (GD, 2013)

Dynamic Planar Point Location with Sub-logarithmic Local Updates. - Maarten Löffler; Joseph A. Simons; Darren Strash (WADS, 2013)

Confluent Hasse Diagrams. - David Eppstein; Joseph A. Simons (J. Graph Algorithms Appl., 2013)

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. - Michael J. Bannister; William E. Devanny; Michael T. Goodrich; Joseph A. Simons; Lowell Trott (CCCG, 2014)

Data-Oblivious Graph Algorithms in Outsourced External Memory. - Michael T. Goodrich; Joseph A. Simons (COCOA, 2014)