Derrick Stolee - Iowa State University - Presentations

2015
$(4,2)$-choosability of planar graphs with forbidden sturctures: A working seminar report. Discrete Mathematics Seminar (09/08), Iowa State University.
Slides Project
Automated Discharging Arguments for Density Problems in Grids. Connections in Discrete Mathematics: A celebration of the work of Ron Graham (06/19), Simon Fraser University.
Slides Paper Project
2014
Computational Combinatorics. Math 101 (11/03 & 11/05), Iowa State University.
Slides
Automated Discharging Arguments for Density Problems in Grids. Mathematics Department Colloquium (09/02), Iowa State University.
Slides Paper Project
Rainbow Arithmetic Progressions. Combinatorics and Graph Theory Seminar (05/19), University of Colorado Denver.
Slides Paper Project

On the independence ratio of distance graphs, AMS Special Session on Trends in Graph Theory, AMS-MAA Joint Math Meetings, Baltimore, MD, January 18, 2014.
Slides Project

2013
A linear programming approach to the Manickam-Miklós-Singhi Conjecture. Colloquium Rochester Institute of Technology, November 7, 2013.
Slides Paper Project
A linear programming approach to the Manickam-Miklós-Singhi Conjecture. AMS Special Session on Partially Ordered Sets, Louiville, KY, October 5, 2013.
Slides Paper Project
Computational Combinatorics and the search for Uniquely Kr-Saturated Graphs. Department of Computer Science Colloquium, Iowa State University, September 12, 2013.
Slides Project
A linear programming approach to the Manickam-Miklós-Singhi Conjecture. AMS Special Session on Extremal Graph Theory, Oxford, MS, March3, 2013.
Slides Paper Project
2012
Ordered Ramsey Theory and Track Representations of Graphs, presented at AMS Northeast Section Meeting, Rochester, NY September 22, 2012.
Slides Project
Distinguishing Extension Number, presented at AMS Central Section Meeting, Akron, OH, October 20, 2012.
Slides Project
Ordered Ramsey Theory and Track Representations of Graphs, presented at AMS Northeast Section Meeting, Rochester, NY September 22, 2012.
Slides Project
Space-efficient algorithms for reachability in surface-embedded graphs, presented at CCC 2012, Porto, Portugal.
Slides Project
Combinatorics Using Computational Methods, Thesis Defense, Lincoln, NE.
Slides
Uniquely $K_r$-Saturated Graphs, presented at AMS/MAA Joint Meetings, Boston, MA.
Slides Project
2011
Searching for uniquely saturated graphs with coupled augmentations, presented at Discrete Math Seminar, Ames, IA.
Slides
Searching for uniquely saturated graphs with coupled augmentations, presented at AMS Southeastern Section Meeting, Winston-Salem, NC.
Slides
ReachUL = ReachFewL, presented at International Computing and Combinatorics Conference, Dallas, TX.
Slides Project
The canonical augmentation method, presented at Cumberland Conference on Combinatorics, Graph Theory & Computing, Louisville, KY.
Slides
Isomorph-free generation of 2-connected graphs with applications, presented at AMS Central Section Meeting, Iowa City, IA.
Slides
2010
A log-space algorithm for reachability in planar acyclic digraphs with few sources, presented at CCC 2010, Cambridge, MA.
Slides Project
A Cathedral Theorem of Lovász, presented at Discrete Math Seminar, Lincoln, NE.
Notes Project
Topics in Graph Automorphisms, presented at Discrete Math Seminar, Lincoln, NE.
Notes Project
Problem Solving in Software Development, presented at Raikes School Design Studio, Lincoln, NE.
Slides
2009
A Toast to Three Russians, presented in Graduate Student Seminar, Lincoln, NE.
Slides
2008
Minimum Rectilinear Partitioning, presented at the Graduate Student Combinatorics Conference, Davis, CA.
Slides
Other Links

Derrick Stolee - Iowa State University - Presentations