Mathematics Presentations

Conferences

  • Combinatorial approaches to Stanley depth: Where do we stand?. SIAM Conference on Discrete Mathematics, Atlanta, Georgia. (June 2016)
  • Posets with cover graph of pathwidth two have bounded dimension. 2014 International Congress of Mathematicians, Seoul, Republic of Korea. (August 2014)
  • Posets with cover graph of pathwidth two have bounded dimension. (Invited talk in special session on partially ordered sets.) Fall Southeastern Sectional Meeting of the AMS, Louisville, Kentucky. (October 2013)
  • Reversal Ratio and Linear Extension Diameter. Invited talk at Shrevefest in Fargo, North Dakota. (May 2013)
  • Reversal Ratio and Linear Extension Diameter. (Invited talk in special session on extremal combinatorics.) Spring Central Sectional Meeting of the AMS, Ames, Iowa. (April 2013)
  • Reversal ratio and linear extension diameter. 53rd Midwestern Graph Theory Conference (MIGHTY LIII), Ames, Iowa. (September 2012)
  • Reversal ratio and linear extension diameter. (Invited talk in posets minisymposium.) SIAM Conference on Discrete Mathematics, Halifax, Nova Scotia. (June 2012)
  • Reversal ratio and linear extension diameter. 35th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Melbourne, Australia. (December 2011)
  • Reversal ratio and linear extension diameter. 23rd British Combinatorial Conference, Exeter, United Kingdom. (July 2011)
  • Reversal ratio and linear extension diameter. Canadian Conference on Discrete and Algorithmic Mathematics (CanaDAM) 2011, Victoria, British Columbia. (June 2011)
  • Online linear discrepancy. SIAM Conference on Discrete Mathematics, Austin, Texas. (June 2010)
  • A characterization of partially ordered sets with linear discrepancy equal to 2. (Poster presentation.) New Directions in Algorithms, Combinatorics, and Optimization, Atlanta, Georgia. (May 2008)
  • A characterization of partially ordered sets with linear discrepancy equal to 2. 2008 Georgia Tech Graduate Student Symposium. (March 2008)
  • Six degrees of separation, Or, why Bacon is a good, but not the best, choice. North Dakota State University Mathematics Consortium. (April 2005)
  • Signed graph Laplacians. AMS-MAA-SIAM Special Session on Research in Mathematics by Undergraduates, Joint AMS/MAA Meeting, Baltimore, Maryland. (January 2003)

Others

  • Online Algorithms: Dealing with an Evolving Situation. Wellesley College mathematics colloquium. (October 2017)
  • Interval orders, semiorders, and ascent sequences. Pacific Northwest National Laboratory Mathematics Seminar. (October 2017)
  • Stanley depth and interval partitions. Pacific Northwest National Laboratory Mathematics Seminar. (August 2017)
  • How fair is that ranking?: Linear discrepancy of partially ordered sets. Talk to summer research students at the Wake Forest-Davidson REU. (July 2017)
  • How fair is that ranking?: A mathematician looks at the AP college basketball poll. James Madison University Mathematics Colloquium. (February 2017)
  • Open access discussion panel (with K. Friend, C. Galaver, and T. Lubin). Washington & Lee University Library. (October 2017)
  • How fair is that ranking?: A mathematician looks at the AP college football poll. Hampden- Sydney College Mathematics and Computer Science Colloquium. (October 2016)
  • Counting in fancy ways. Lenfest Colloquium, Washington & Lee University. (October 2016)
  • Online algorithms: When you don’t know everything at the start. Pacific Northwest National Laboratory Mathematics Seminar. (July 2016)
  • Monochromatic solutions of linear equations. Pi Mu Epsilon initiation, Washington & Lee University. (March 2016)
  • Herzog’s partition problem, Virginia Commonwealth University Discrete Mathematics Seminar. (September 2014)
  • Online linear discrepancy, University of Louisville Combinatorics Seminar. (March 2013)
  • Interval partitions and Stanley depth, North Dakota State University Department of Mathematics Colloquium (January 2013)
  • Online linear discrepancy, University of Nebraska-Lincoln Discrete Mathematics Seminar. (September 2012)
  • Asymptotic Enumeration of Labelled Interval Orders, University of California, San Diego Combinatorics Seminar. (May 2012)
  • Interval partitions and Stanley depth, Mississippi State University Mathematics Colloquium. (February 2012)
  • Online linear discrepancy, Technion Combinatorics Seminar. (May 2011)
  • Online linear discrepancy, London School of Economics Lunchtime Seminar. (February 2011)
  • Interval partitions and Stanley depth, London School of Economics Discrete Mathematics and Game Theory Seminar. (October 2010)
  • Interval partitions and Stanley depth, University of Louisville Mathematics Colloquium. (December 2009)
  • Online algorithms for graphs and partially ordered sets, Georgia Tech SIAM Student Seminar. (November 2009)
  • The Probabilistic Method, Or, Using Probability to Show that Something Definitely Exists, North Dakota State University Mathematics Club. (December 2008)
  • Linear discrepancy in partially ordered sets. North Dakota State University Mathematics Colloquium. (July 2007)
  • Six degrees of separation, Or, why Kevin Bacon is a good, but not the best, choice. North Dakota State University Mathematics Club. (May 2004)
  • Some combinatorial proofs of some noncombinatorial results. North Dakota State University Mathematics Colloquium. (April 2004)
  • One, two, skip a few, ninety-nine, one hundred, Or, How I learned there are smarter ways to count. North Dakota State University Mathematics Club. (September 2003)
  • Algebra and graphs and knots—oh my! North Dakota State University Mathematics Club. (September 2002)