I recently graduated with PhD in Computer Science from University of California, Irvine. I was advised by David Eppstein and Mike Goodrich in the Center for Algorithms and Theory of Computation.

My primary interest is in the design and analysis of algorithms and data structures, especially in the areas of computational geometry and graph theory.

Journal Papers

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
D. Eppstein, M.T. Goodrich, and D. Strash
SIAM J. Computing 39 (8), 2010, pp. 3814--3829.

Journal Submissions

Succinct Greedy Geometric Routing in the Euclidean Plane
M.T. Goodrich and D. Strash
submitted to Algorithmica.

Extended Dynamic Subgraph Statistics using h-index Parametrized Data Structures
D. Eppstein, M.T. Goodrich, D. Strash, and L. Trott,
Invited to Special Issue of Theoretical Computer Science, COCOA 2010.

Papers in Reviewed Conference Proceedings

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
D. Eppstein, M.T. Goodrich, and D. Strash
Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp 150-159.

Succinct Greedy Geometric Routing in the Euclidean Plane
M.T. Goodrich and D. Strash
Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS vol. 5878, pp. 781-791.

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
D. Eppstein, M. Löffler, and D. Strash
Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), LNCS vol. 6506, pp. 403-413.

Priority Range Trees
M.T. Goodrich and D. Strash
Proceedings of the 21st International Symposium on Algorithms and Computation" (ISAAC 2010), LNCS vol. 6506, pp. 97-108.

Extended Dynamic Subgraph Statistics using h-index Parametrized Data Structures
D. Eppstein, M.T. Goodrich, D. Strash, and L. Trott
Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA 2010), LNCS vol. 6508, pp. 128-141.

Listing All Maximal Cliques in Large Sparse Real-World Graphs
D. Eppstein and D. Strash
Proceedings of the 10th International Conference on Experimental Algorithms (SEA 2011), (accepted).

Conference Submissions

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon
D. Eppstein, M.T. Goodrich, M. Löffler, D. Strash, and L. Trott

Other

Garbage Collection for Trailer Arrays
L. Effinger-Dean, C. Erickson, M. O'Neill, and D. Strash
Proceedings of the 3rd Workshop on Semantics, Program Analysis and Computing Environments for Memory Management (SPACE 2006), pp 83-90.

Extending Garbage Collection to Complex Data Structures
L. Effinger-Dean, C. Erickson, M. O'Neill, and D. Strash
Proceedings of the 3rd Workshop on Semantics, Program Analysis and Computing Environments for Memory Management (SPACE 2006), pp 91-97.