Joseph A. Simons

According to our database, Joseph A. Simons authored at least 9 papers between 2011 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Data-Oblivious Graph Algorithms in Outsourced External Memory.

Michael T. Goodrich, Joseph A. Simons

Proceedings of the Combinatorial Optimization and Applications, 2014

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

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Dynamic Planar Point Location with Sub-logarithmic Local Updates.

Maarten Löffler, Joseph A. Simons, Darren Strash

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees.

Michael J. Bannister, David Eppstein, Joseph A. Simons

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Set-Difference Range Queries.

David Eppstein, Michael T. Goodrich, Joseph A. Simons

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Inapproximability of Orthogonal Compaction.

Michael J. Bannister, David Eppstein, Joseph A. Simons

J. Graph Algorithms Appl., 2012

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

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Fully Retroactive Approximate Range and Nearest Neighbor Searching.

Michael T. Goodrich, Joseph A. Simons

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Confluent Hasse Diagrams.

David Eppstein, Joseph A. Simons

Proceedings of the Graph Drawing - 19th International Symposium, 2011