The Functional Decomposition of Polynomials. - Matthew T. Dickerson (1989)

Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. - Matthew Dickerson; Robert L. (Scot) Drysdale III (Inf. Process. Lett., 1990)

Enumerating k Distances for n Points in the Plane. - Matthew Dickerson; Robert L. (Scot) Drysdale III (SCG, 1991)

Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. - Matthew Dickerson; Robert L. (Scot) Drysdale III; Jörg-Rüdiger Sack (Int. J. Comput. Geom. Appl., 1992)

The Inverse of an Automorphism in Polynomial Time. - Matthew Dickerson (J. Symb. Comput., 1992)

General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. - Matthew Dickerson (Int. J. Found. Comput. Sci., 1993)

A Simple Algorithm for Enumerating Longest Distances in the Plane. - Matthew Dickerson; Jason Shugart (Inf. Process. Lett., 1993)

New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). - Matthew Dickerson; Scott A. McElfresh; Mark H. Montague (SCG, 1995)

Algorithms for Proximity Problems in Higher Dimensions. - Matthew Dickerson; David Eppstein (Comput. Geom., 1995)

A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. - Matthew Dickerson; Mark H. Montague (SCG, 1996)

The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. - Matthew Dickerson; Daniel Scharstein (SCG, 1996)

Animating the Polygon-Offset Distance Function. - Gill Barequet; Amy J. Briggs; Matthew Dickerson; Cristian Dima; Michael T. Goodrich (SCG, 1997)

Voronoi Diagrams for Polygon-Offset Distance Functions. - Gill Barequet; Matthew Dickerson; Michael T. Goodrich (WADS, 1997)

Translating a Convex Polygon to Contain a Maximum Number of Points. - Gill Barequet; Matthew T. Dickerson; Petru Pau (Comput. Geom., 1997)

Fast Greedy Triangulation Algorithms. - Matthew Dickerson; Robert L. (Scot) Drysdale III; Scott A. McElfresh; Emo Welzl (Comput. Geom., 1997)

A Large Subgraph of the Minimum Weight Triangulation. - Matthew Dickerson; J. Mark Keil; Mark H. Montague (Discret. Comput. Geom., 1997)

Offset-polygon annulus placement problems. - Gill Barequet; Amy J. Briggs; Matthew Dickerson; Michael T. Goodrich (Comput. Geom., 1998)

On triangulating three-dimensional polygons. - Gill Barequet; Matthew Dickerson; David Eppstein (Comput. Geom., 1998)

Optimal placement of convex polygons to maximize point containment. - Matthew Dickerson; Daniel Scharstein (Comput. Geom., 1998)

Optimizing Constrained Offset and Scaled Polygonal Annuli. - Gill Barequet; Prosenjit Bose; Matthew Dickerson (WADS, 1999)

The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. - Gill Barequet; Matthew Dickerson (CCCG, 2000)

K-D Trees Are Better when Cut on the Longest Side. - Matthew Dickerson; Christian A. Duncan; Michael T. Goodrich (ESA, 2000)

Using simulation across the curriculum. - Matthew Dickerson; Timothy Huang; Ingrid Russell (J. Comput. Sci. Coll., 2000)

Matching points to a convex polygonal boundary. - Matthew Dickerson; Michael T. Goodrich (CCCG, 2001)

2-point site Voronoi diagrams. - Gill Barequet; Robert L. Scot Drysdale; Matthew Dickerson; David S. Guertin (SCG, 2001)

Voronoi Diagrams for Convex Polygon-Offset Distance Functions. - Gill Barequet; Matthew Dickerson; Michael T. Goodrich (Discret. Comput. Geom., 2001)

2-Point site Voronoi diagrams. - Gill Barequet; Matthew T. Dickerson; Robert L. (Scot) Drysdale III (Discret. Appl. Math., 2002)

Optimizing a constrained convex polygonal annulus. - Gill Barequet; Prosenjit Bose; Matthew T. Dickerson; Michael T. Goodrich (J. Discrete Algorithms, 2005)

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. - Matthew Dickerson; David Eppstein; Michael T. Goodrich; Jeremy Yu Meng (J. Graph Algorithms Appl., 2005)

Using Memory Dumps in Digital Forensics. - Sam Stover; Matthew Dickerson (login Usenix Mag., 2005)

Two-site Voronoi diagrams in geographic networks. - Matthew T. Dickerson; Michael T. Goodrich (GIS, 2008)

Covering points with a polygon. - Gill Barequet; Matthew T. Dickerson; Yuval Scharf (Comput. Geom., 2008)

Dilation, smoothed distance, and minimization diagrams of convex functions - Matthew Dickerson; David Eppstein; Kevin A. Wortman (CoRR, 2008)

Entropic Force in Drosophila Resilin: Molecular Dynamics Study. - Roman Petrenko; Matthew Dickerson; Rajesh Naik; Soumya Patnaik; Thomas Beck; Jaroslaw Meller (BIOCOMP, 2009)

Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). - Matthew T. Dickerson; David Eppstein (SCG, 2009)

Cloning Voronoi Diagrams via Retroactive Data Structures. - Matthew T. Dickerson; David Eppstein; Michael T. Goodrich (ESA (1), 2010)

Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. - Matthew Dickerson; David Eppstein; Kevin A. Wortman (ISVD, 2010)

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. - Matthew T. Dickerson; Michael T. Goodrich; Thomas D. Dickerson (ISVD, 2010)

Multi-agent simulation and netLogo in the introductory computer science curriculum. - Matthew Dickerson (J. Comput. Sci. Coll., 2011)

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. - Matthew T. Dickerson; Michael T. Goodrich; Thomas D. Dickerson; Ying Daisy Zhuo (Trans. Comput. Sci., 2011)

On 2-Site Voronoi Diagrams Under Geometric Distance Functions. - Gill Barequet; Matthew Dickerson; David Eppstein; David Hodorkovsky; Kira Vyatkina (J. Comput. Sci. Technol., 2013)

The impact of computing courses for non-majors. - Robert Bryant 001; Judith Bayard Cushing; Jenny Orr; Matthew Dickerson; Richard Weiss 001 (J. Comput. Sci. Coll., 2014)

Multi-agent simulation, netlogo, and the recruitment of computer science majors. - Matthew Dickerson (J. Comput. Sci. Coll., 2014)

NetLogo and multi-agent simulation (in introductory computer science). - Matthew Dickerson (J. Comput. Sci. Coll., 2014)

NSF-sponsored innovative approaches to undergraduate computer science. - Matthew Dickerson (J. Comput. Sci. Coll., 2014)

Modeling, simulation, and netlogo in the introductory computer science curriculum. - Kathie A. Yerion; Matthew Dickerson (J. Comput. Sci. Coll., 2014)

Can computers reason (and enjoy sex)? - Matthew Dickerson (J. Comput. Sci. Coll., 2015)

Agent-based modeling and NetLogo in the introductory computer science curriculum: tutorial presentation. - Matthew Dickerson (J. Comput. Sci. Coll., 2015)