| Fixed parameter tractability of crossing minimization of almost-trees MJ Bannister, D Eppstein, JA Simons Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013 | 19 | 2013 |
| Confluent hasse diagrams D Eppstein, JA Simons Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012 | 19 | 2012 |
| Windows into geometric events: Data structures for time-windowed querying of temporal point sets MJ Bannister, WE Devanny, MT Goodrich, JA Simons, L Trott arXiv preprint arXiv:1409.5452, 2014 | 18 | 2014 |
| Data-oblivious graph algorithms in outsourced external memory MT Goodrich, JA Simons Combinatorial Optimization and Applications: 8th International Conference …, 2014 | 11 | 2014 |
| Dynamic Planar Point Location with Sub-Logarithmic Local Updates M Löffler, J Simons, D Strash Arxiv preprint arXiv:1204.4714, 2012 | 11 | 2012 |
| Inapproximability of orthogonal compaction MJ Bannister, D Eppstein, JA Simons arXiv preprint arXiv:1108.4705, 2011 | 9 | 2011 |
| Fully retroactive approximate range and nearest neighbor searching MT Goodrich, JA Simons Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011 | 6 | 2011 |
| Set-difference range queries D Eppstein, MT Goodrich, JA Simons arXiv preprint arXiv:1306.3482, 2013 | 2 | 2013 |
| New Dynamics in Geometric Data Structures JA Simons University of California, Irvine, 2014 | 1 | 2014 |
| More graph drawing in the cloud: data-oblivious st-numbering, visibility representations, and orthogonal drawing of biconnected planar graphs MT Goodrich, JA Simons Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 1 | 2013 |
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineVerified email at uci.edu
