Contact Information
- Office: Avery 336
-
Office Phone: 402-472-8176
-
Email: s-dstolee1@math.unl.edu
NEW: See my dissertation, Combinatorics Using Computational Methods.
Starting in Fall 2012, I will be a J. L. Doob Research Assistant Professor in the Mathematics Department of the University of Illinois at Urbana-Champaign.
Current Teaching
CSCE 424/824: Computational Complexity Theory
Research
Papers
| Stephen G. Hartke, Derrick Stolee, Uniquely Kr-Saturated Graphs, submitted. March, 2012. | ArXiv | |
| Derrick Stolee, Automorphism Groups and Adversarial Vertex Deletions, submitted. January, 2012. | ArXiv | |
| Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger, List Distinguishing Parameters of Trees, submitted. November, 2011. | ArXiv | |
| Derrick Stolee, Generating p-extremal graphs, submitted. May, 2011. | ArXiv | |
| Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew Yancey, Extremal graphs with a given number of perfect matchings, submitted. April, 2011. | ||
| Derrick Stolee, Isomorph-free generation of 2-connected graphs with applications, UNL-CSE Technical Report #120, August, 2011. | ArXiv | |
| Brady Garvin, Derrick Stolee, Raghunath Tewari, N.V. Vinodchandran, ReachFewL = ReachUL, Computing and Combinatorics: COCOON 2011, Lecture Notes in Computer Science 6842, pp. 252-258, August 2011. | ECCC | |
| Derrick Stolee, N.V. Vinodchandran, Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs, to appear in the IEEE Conference on Computational Complexity, June 2012. Also available at the Electronic Colloquium of Computational Complexity, TR10-154. | ECCC | |
| Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee, Automorphism groups of a graph and a vertex-deleted subgraph, Electronic Journal of Combinatorics, 17(1), R-134, October 2010. | EJC | |
| Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee, On the hardness of recognizing triangular line graphs, Discrete Mathematics, to appear. | ArXiv | |
Derrick Stolee, Chris Bourke, N.V. Vinodchandran,
"A log-space algorithm for reachability in planar acyclic digraphs with few sources"
,
25th Annual IEEE Conference on Computational Complexity, June 2010.
|
Video |
Recent Presentations
Software
- SearchLib, a collection of research software projects that execute computational combinatorics experiments.
- 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 2010
- CSCE 424/824 - Complexity Theory, Co-instructor, with Vinod Variyam
- Spring 2009
- CSCE 150A - Problem Solving with Computers Laboratory, Lab GTA, 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 computational graph theorist in the Joint Mathematics and Computer Science Ph.D. program at the University of Nebraska-Lincoln.
He is interested in extremal and structural problems in graph theory as well as problems in complexity theory, especially reachability problems.
