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.
Papers
- Derrick Stolee, Chris Bourke, N.V. Vinodchandran, "A log-space algorithm for reachability in planar acyclic digraphs with few sources" , under submission, December 2009. [ PDF | ECCC ]
- Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee, "Automorphism groups of a graph and a vertex-deleted subgraph," under submission, September 2009. [ PDF | ]ArXiv | Slides ]
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
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 Stolee
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.
