Derrick Stolee, Ph.D Student
Contact Information
-
Office: Avery 336
Office Phone: 402-472-8176
Office Hours for 150A: T 3:00-5:00 in Student Resource Center
Office Hours for 361: R 3:00-5:00 in Avery 336
-
Email: s-dstolee1@math.unl.edu
Research
Under the umbrella of Graph Theory and Complexity Theory,
research includes
Papers
- Derrick Stolee, Chris Bourke, N.V. Vinodchandran, "A log-space algorithm for planar DAGs with few sources," Electronic Colloquium of Computational Complexity, June 2009.
Presentations
- "A log-space algorithm for planar DAGs with few sources,"
Discrete Math Seminar, January 27, 2009.
(with Chris Bourke, and N.V. Vinodchandran) -
"Using Wireless Sensor Networks for Low-Cost Fast-Installation Three-dimensional Environment Modelling,"
Wireless Sensor Networks, December , 2008.
(with Dan Cromer, Kurt Larson, and Zach Miller) - "(3,1)-Subspace Intersection Representations of Graphs,"
GSS, October 22, 2008.
(with James Carraher, Travis Johnston, and Stephen Hartke) - "Minimum Rectilinear Partitioning,"
GSCC 2008, University of California-Davis. April 12, 2008. - "A Multi-Dimensional Spatial Cache for Distributed Decision Support Systems,"
Undergraduate Thesis Defense, April 16, 2007.
Software
- PDFtoBook (Download) - Rearrange pages of a PDF to make foldable booklets.
- Pacman (Download) - A multi-agent environment of the classic arcade game. Built for class competitions!
- VisualSATSolver (Download) - A graphical interpretation of the search tree of a SAT problem.
Teaching
- Spring 2009
- CSCE 150A - Problem Solving with Computers Laboratory with Chris Bourke.
- CSCE 361 - Software Engineering, Project Support with Sebastian Elbaum.
- Math 107 Calculus and Analytic Geometry II
- Fall 2008 with Steve Cohn, Irakli Loladze.
- Spring 2008 with Roger Wiegand, Mohammed Rammaha.
- Fall 2007 with Steve Cohn, Mikil Foss.
- Exam 1 Study Guide
- Exam 2 Study Guide
- Exam 3 Study Guide
Study Guides

Derrick
is a graduate student in the Joint Mathematics and Computer Science
Ph.D. program at the University of Nebraska-Lincoln. Research areas
include Graph Theory, Graph Algorithms, and Computational Complexity.
