Matthew Dickerson

47 papers A* 2A 2B 4Journal 26Unranked 13
YearRankTypeTitle / Venue / Authors
2015 J jnl
Agent-based modeling and NetLogo in the introductory computer science curriculum: tutorial presentation.
J. Comput. Sci. Coll.
Matthew Dickerson
2015 J jnl
Can computers reason (and enjoy sex)?
J. Comput. Sci. Coll.
Matthew Dickerson
2014 J jnl
Modeling, simulation, and netlogo in the introductory computer science curriculum.
J. Comput. Sci. Coll.
Kathie A. Yerion, Matthew Dickerson
2014 J jnl
Multi-agent simulation, netlogo, and the recruitment of computer science majors.
J. Comput. Sci. Coll.
Matthew Dickerson
2014 J jnl
NSF-sponsored innovative approaches to undergraduate computer science.
J. Comput. Sci. Coll.
Matthew Dickerson
2014 J jnl
NetLogo and multi-agent simulation (in introductory computer science).
J. Comput. Sci. Coll.
Matthew Dickerson
2014 J jnl
The impact of computing courses for non-majors.
J. Comput. Sci. Coll.
Robert Bryant, Judith Bayard Cushing, Jenny Orr, Matthew Dickerson, Richard Weiss
2013 J jnl
On 2-Site Voronoi Diagrams Under Geometric Distance Functions.
J. Comput. Sci. Technol.
Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina
2011 J jnl
Multi-agent simulation and netLogo in the introductory computer science curriculum.
J. Comput. Sci. Coll.
Matthew Dickerson
2010 — conf
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation.
ISVD
Matthew Dickerson, David Eppstein, Kevin A. Wortman
2009 — conf
Entropic Force in Drosophila Resilin: Molecular Dynamics Study.
BIOCOMP
Roman Petrenko, Matthew Dickerson, Rajesh Naik, Soumya Patnaik, Thomas Beck, Jaroslaw Meller
2008 J jnl
Dilation, smoothed distance, and minimization diagrams of convex functions
CoRR
Matthew Dickerson, David Eppstein, Kevin A. Wortman
2005 J jnl
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
J. Graph Algorithms Appl.
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005 J jnl
Using Memory Dumps in Digital Forensics.
login Usenix Mag.
Sam Stover, Matthew Dickerson
2003 A conf
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
GD
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2002 J jnl
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
CoRR
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2001 — conf
2-point site Voronoi diagrams.
SCG
Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
2001 — conf
Matching points to a convex polygonal boundary.
CCCG
Matthew Dickerson, Michael T. Goodrich
2001 J jnl
Voronoi Diagrams for Convex Polygon-Offset Distance Functions.
Discret. Comput. Geom.
Gill Barequet, Matthew Dickerson, Michael T. Goodrich
2000 A conf
K-D Trees Are Better when Cut on the Longest Side.
ESA
Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
2000 — conf
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon.
CCCG
Gill Barequet, Matthew Dickerson
2000 J jnl
Using simulation across the curriculum.
J. Comput. Sci. Coll.
Matthew Dickerson, Timothy Huang, Ingrid Russell
1999 B conf
2-Point Site Voronoi Diagrams.
WADS
Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
1999 B conf
Optimizing Constrained Offset and Scaled Polygonal Annuli.
WADS
Gill Barequet, Prosenjit Bose, Matthew Dickerson
1998 J jnl
Offset-polygon annulus placement problems.
Comput. Geom.
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
1998 J jnl
On triangulating three-dimensional polygons.
Comput. Geom.
Gill Barequet, Matthew Dickerson, David Eppstein
1998 J jnl
Optimal placement of convex polygons to maximize point containment.
Comput. Geom.
Matthew Dickerson, Daniel Scharstein
1997 J jnl
A Large Subgraph of the Minimum Weight Triangulation.
Discret. Comput. Geom.
Matthew Dickerson, J. Mark Keil, Mark H. Montague
1997 — conf
Animating the Polygon-Offset Distance Function.
SCG
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
1997 J jnl
Fast Greedy Triangulation Algorithms.
Comput. Geom.
Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
1997 B conf
Offset-Polygon Annulus Placement Problems.
WADS
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
1997 B conf
Voronoi Diagrams for Polygon-Offset Distance Functions.
WADS
Gill Barequet, Matthew Dickerson, Michael T. Goodrich
1996 — conf
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation.
SCG
Matthew Dickerson, Mark H. Montague
1996 — conf
On Triangulating Three-Dimensional Polygons.
SCG
Gill Barequet, Matthew Dickerson, David Eppstein
1996 A* conf
Optimal Placement of Convex Polygons to Maximize Point Containment.
SODA
Matthew Dickerson, Daniel Scharstein
1996 — conf
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon.
SCG
Matthew Dickerson, Daniel Scharstein
1995 J jnl
Algorithms for Proximity Problems in Higher Dimensions.
Comput. Geom.
Matthew Dickerson, David Eppstein
1995 — conf
New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract).
SCG
Matthew Dickerson, Scott A. McElfresh, Mark H. Montague
1995 — conf
Translating a convex polygon to contain maximum number of points.
CCCG
Gill Barequet, Matthew Dickerson, Petru Pau
1994 — conf
Fast Greedy Triangulation Algorithms.
SCG
Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
1993 J jnl
A Simple Algorithm for Enumerating Longest Distances in the Plane.
Inf. Process. Lett.
Matthew Dickerson, Jason Shugart
1993 J jnl
General Polynomial Decomposition and the s-1-Decomposition are NP-Hard.
Int. J. Found. Comput. Sci.
Matthew Dickerson
1992 J jnl
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors.
Int. J. Comput. Geom. Appl.
Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
1992 J jnl
The Inverse of an Automorphism in Polynomial Time.
J. Symb. Comput.
Matthew Dickerson
1991 — conf
Enumerating
SCG
Matthew Dickerson, Robert L. (Scot) Drysdale III
1990 J jnl
Fixed-Radius Near Neighbors Search Algorithms for Points and Segments.
Inf. Process. Lett.
Matthew Dickerson, Robert L. (Scot) Drysdale III
1989 A* conf
The Inverse of an Automorphism in Polynomial Time
FOCS
Matthew Dickerson