2016
- Oct 14–15: MAA Sectional Meeting, University of Minnesota, Minneapolis, MN
``Tiling with puzzle pieces is hard''
- Aug 11–14: Seattle, WA
- May 20–23: Combinatorics and Algebraic Geometry Seminar, University of Pennsylvania, Philadelphia, PA
``Complexity of tiling using triangles''
- Apr 15–16: MAA Sectional Meeting, Macalester College, St. Paul, MN
``Undecidable problems in tilings''
- Apr 14: Computer Science Colloquium, Carleton College, Northfield, MN
``Tiling with simple tiles is hard''
2015
- Dec 24–Jan 11: Taiwan via Los Angeles, CA
- Nov 25: Combinatorics Seminar, Caltech, Pasadena, CA
``Hard tiling problems on lattices''
- Nov 16: Discrete Math Seminar, Rutgers University, New Brunswick, NJ
``Tiling with triangles is hard''
- Oct 23–24: MAA Sectional Meeting, Bemidji State University, Bemidji, MN
``Tiling with simple tiles can be hard''
- Sep 11: Algebra-Geometry-Combinatorics Seminar, San Francisco State University, San Francisco, CA
``Hard tiling problems''
- Aug 14–18: San Francisco, CA
- Jul 18–27: Seattle, WA
- Jul 01–10: Washington, DC and Richmond, VA
- Jun 24–28: San Francisco, CA
2014
- Dec 20–Jan 18: Taiwan via Seattle, WA
- Nov 22–28: Combinatorics Seminar, UCLA, Los Angeles, CA
``Hard tiling problems with triangles and rhombi''
- Nov 10–14: Geometric and Enumerative Combinatorics Workshop, Institute for Mathematics and its Applications, Minneapolis, MN
``Hard tiling problems with triangles and rhombi''
- Sep 20–21: Special Session on Algebraic Combinatorics, AMS Sectional Meeting, University of Wisconsin, Eau Claire, WI
``Tiling by triangles and rhombi is hard''
- Aug 20–27: New York, NY; Princeton, NJ; and Philadelphia, PA
- Jul 19–27: San Francisco, CA
- Jun 22–28: Stanley@70, MIT, Cambridge, MA
- May 01–04: Seattle, WA
- Mar 13–20: UCLA, Los Angeles, CA
2013
- Dec 14–Jan 09: Taiwan via San Francisco, CA
- Nov 26–30: Los Angeles, CA
- Nov 19: Student Combinatorics Seminar, University of Minnesota, Minneapolis, MN
``Klarner systems and easy tiling problems''
- Nov 07–10: Algecom9, Loyola University Chicago, Chicago, IL
- Oct 03–07: Los Angeles, CA
- Sep 27: Combinatorics Seminar, University of Minnesota, Minneapolis, MN
``Computational complexity and decidability of tiling problems''
- Aug 21–23: Washington, DC
- Aug 18–21: ICERM, Providence, RI
- Aug 15–18: New York
- Jul 23–28: Biola
- Jun 06: Combinatorics Seminar, UCLA, Los Angeles, CA
``Computational complexity and decidability of tileability''
- May 30: Graduate Seminar, UCLA, Los Angeles, CA
``Counting domino tilings of Aztec diamonds''
- Apr 18–23: Graduate Student Combinatorics Conference, Minneapolis, MN
``Undecidability of tileability''
- Jan 09–12: Joint Math Meetings, San Diego, CA
2012
- Nov 01–14: East Coast tour
- Nov 13: Discrete Math Seminar, Rutgers University, New Brunswick, NJ
``Tiling simply connected regions using rectangles''
- Nov 09: Combinatorics Seminar, MIT, Cambridge, MA
``Hard tiling problems with rectangles''
- Nov 06: Combinatorics and Probability Seminar, University of Pennsylvania, Philadelphia, PA
``Complexity of tiling using rectangles''
- Nov 05: Temple University, Philadelphia, PA
- Nov 02: Combinatorics Seminar, Georgia Institute of Technology, Atlanta, GA
``Tiling simply connected regions by rectangles''
- Oct 11–14: Algebra and Combinatorics Seminar, Texas A&M University, College Station, TX
``Hard tiling problems with rectangular tiles''
- Oct 03–06: Combinatorics Seminar, University of Michigan, Ann Arbor, MI
``Tiling simply connected regions with rectangles''
- Jun 10–16: MRC Discrete and Computational Geometry, Snowbird, UT
- May 20: Los Angeles Math Circle, UCLA, Los Angeles, CA
``Enumerative Combinatorics''
- Mar 25–29: WilsonFest, Caltech, Pasadena, CA
- Mar 01: Graduate Seminar, UCLA, Los Angeles, CA
``Brick walls and easy tiling problems''
- Feb 07: Combinatorics Seminar, Caltech, Pasadena, CA
``Hard tiling problems in simply connected regions''
- Jan 24: ATC talk, UCLA, Los Angeles, CA
``Hard tiling problems''
2011
- Jun 19–Jul 01: RMMC Polyhedral Geometry & Algebraic Combinatorics, Laramie, WY
- Apr 28: Combinatorics Seminar, UCLA, Los Angeles, CA
``On hard tiling problems''
- Apr 14, 19: Combinatorics Reading Group, UCLA, Los Angeles, CA
``Hypergraph Turan Problems: Link Graphs and Multigraphs''
- Apr 14: Graduate Seminar, UCLA, Los Angeles, CA
``Magic carpets and hard tiling problems''
2009
- May 11: Combinatorics Reading Group, UCLA, Los Angeles, CA
``Kruskal–Katona theorem''
2008