Contact Information

• Office: Avery 336
  Office Phone: 402-472-8176
  
• Email: s-dstolee1@math.unl.edu
  

Research

Many important problems in modern mathematics involve the understanding of graphs. Their structure encodes information useful for countless applications and presents interesting questions of pure theoretic interest. Much of complexity theory relies upon different classes of graphs to define the most important problems. Many tools and techniques have been developed to analyze graphs: their invariants, automorphisms, and their existence under certain conditions. My goal is to combine modern proof techniques with computational methods to solve these unanswered questions, including the existence of certain strongly-regular graphs, space-bounded algorithms for reachability, and variants of the Reconstruction Conjecture.

Curriculum Vitae

Courses Taken

Papers

• Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee, "Automorphism groups of a graph and a vertex-deleted subgraph," under submission, September 2009.
• 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.

Notes

• Discrete Math Seminar
• CS Theory Seminar

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

• Calculus and Analytic Geometry II [Exam 1 - Exam 2 - Exam 3]
• Algebra Qualification Exam [ PDF - TeX ]
• Analysis Qualification Exam [ PDF - TeX ]
• Combinatorics [ PDF - TeX ]
• Graph Theory [ PDF - TeX ]
• CS Theory Qualification Exam [ PDF - TeX ]
• Systems Qualification Exam [ PDF - TeX ]