\subsection*{Invited}
\begin{itemize}[leftmargin=*]
    \item Periodic words, common subsequences and frogs. \textit{KIT Combinatorics Seminar}. Online, May 2021.
    \item The maximum number of paths and cycles in planar graphs. \textit{U South Carolina Discrete Math Seminar}. Online, Feb 2021.
    \item Restricted online Ramsey numbers of matchings. \textit{AMS Special Session on Advances in Graph Theory}. Online, Oct 2020.
    \item Nearly orthogonal vectors. \textit{CodEx Seminar}. Online, May 2020.
    \item Nearly orthogonal vectors. \textit{ISU Discrete Math Seminar}. Online, May 2020.
	\item Periodic words, common subsequences and frogs. \textit{University of Virginia Probability Seminar}. Charlottesville, VA, Feb 2020.
	\item Periodic words, common subsequences and frogs. \textit{UCSD Combinatorics Seminar}. La Jolla, CA, Feb 2020.
	\item Periodic words, common subsequences and frogs. \textit{MIT Combinatorics Seminar}. Cambridge, MA, Oct 2019.
	\item Periodic words, common subsequences and frogs. \textit{Warwick Combinatorics Seminar}. Coventry, UK, Sep 2019.
	\item Algorithmic re-proofs of some Ramsey numbers. \textit{ISU Discrete Math Seminar}. Ames, IA, Mar 2019.
	\item A fractional version of Haemers' bound. \textit{AMS Special Session on Graph Theory}. Newark, DE, Sep 2018.
	\item Inverting the Tur\'an problem. \textit{ISU Discrete Math Seminar}. Ames, IA, Jul 2018.
	\item Nearly orthogonal vectors. \textit{Technion Combinatorics Seminar}. Haifa, Israel, Jun 2018.
	\item Nearly orthogonal vectors. \textit{Hebrew University of Jerusalem Combinatorics Seminar.} Jerusalem, Israel, Jun 2018.
	\item A fractional version of Haemers' bound. \textit{Ben-Gurion Combinatorics Seminar}. Be'er Sheva, Israel, Jun 2018.
	\item Nearly orthogonal vectors. \textit{ISU Discrete Math Seminar}. Ames, IA, Mar 2018.
	\item Ramsey numbers on the Boolean lattice. \textit{AMS Special Session on Structural and Computational Graph Theory}. Raleigh, NC, Nov 2016.
	\item Ramsey numbers of ordered hypergraphs. \textit{AMS Special Session on Extremal and Stuctural Graph Theory}. Las Vegas, NV, Apr 2015.
	\item Ramsey numbers of ordered hypergraphs. \textit{CU Denver Discrete Math Seminar}. Denver, CO, Mar 2015.
\end{itemize}
\subsection*{Contributed}
\begin{itemize}[leftmargin=*]
	\item Nearly orthogonal vectors and small antipodal spherical codes. \textit{European Combinatorics Conference}. Bratislava, Slovakia, Aug 2019.
	\item Nearly orthogonal vectors. \textit{Finite Geometry and Extremal Combinatorics}. Newark, DE, Aug 2019.
	\item Inverting the Tur\'an problem. \textit{ICGT}. Lyon, France, Jul 2018.
	\item Nearly orthogonal vectors (poster). \textit{Building Bridges II}. Budapest, Hungary, Jul 2018.
	\item Inverting the Tur\'an problem. \textit{MIGHTY LIX}. Morgantown, WV, Apr 2018.
	\item A degree sequence variant of Ramsey's theorem. \textit{Connections in Discrete Mathematics}. Vancouver, Canada, Jun 2015.
	%\item Coupled choosability with separation. \textit{Rocky Mountain--Great Plains Graduate Research Workshop in Combinatorics}. Ames, IA, Jun 2015.
	%\item Potential Ramsey numbers. \textit{Rocky Mountain--Great Plains Graduate Research Workshop in Combinatorics}. Denver, CO, Jul 2014.
	\item Normally regular digraphs resulting from Cayley graphs (poster). \textit{SACNAS National Conference}. San Antonio, TX, Oct 2013.
	\item Isospectral drums and cospectral graphs. \textit{MAA Mathfest}. Hartford, CT, Aug 2013.
\end{itemize}
\subsection*{Internal}
\begin{itemize}[leftmargin=*]
    \item The maximum number of paths and cycles in planar graphs. \textit{ISU Discrete Math Seminar}. Online, Feb 2021.
    \item Periodic words, common subsequences and frogs. \textit{ISU Discrete Math Seminar}. Online, Sep 2020.
	\item Periodic words, common subsequences and frogs. \textit{CMU ACO Seminar}. Pittsburgh, PA, Nov 2019.
	\item Small antipodal spherical codes. \textit{CMU CS Theory Seminar}. Pittsburgh, PA, Oct 2018.
	\item Ramsey numbers for partially-ordered sets. \textit{CMU ACO Seminar}. Pittsburgh, PA, Feb 2016.
	\item Ordered Ramsey numbers of loose paths and $k$-uniform matchings. \textit{ISU Discrete Math Seminar}. Ames, IA, Oct 2014.
\end{itemize}