diff options
Diffstat (limited to 'content')
| -rw-r--r-- | content/positions.tex | 2 | ||||
| -rw-r--r-- | content/presentations.tex | 1 | ||||
| -rw-r--r-- | content/publications.tex | 4 |
3 files changed, 4 insertions, 3 deletions
diff --git a/content/positions.tex b/content/positions.tex index e91e9c5..5d04f64 100644 --- a/content/positions.tex +++ b/content/positions.tex @@ -1,7 +1,7 @@ \textbf{RTG postdoctoral research associate}\dotfill 2020--Present\at{Iowa State University, Ames, IA} \begin{itemize} \item Supported by U.S.\ taxpayers through NSF Research Training Grant DMS-1839918 - \item Instructor: Calculus I (MATH 165), Edit Distance in Graphs (MATH 595: early graduate research course) + \item Instructor: Algebraic Methods in Combinatorics (MATH 595: graduate reading course), Graph Theory (MATH 314), Calculus I (MATH 165), Edit Distance in Graphs (MATH 595: early graduate research course) \item TA: Elementary Differential Equations (MATH 267) \end{itemize} diff --git a/content/presentations.tex b/content/presentations.tex index 4444f9b..a53f871 100644 --- a/content/presentations.tex +++ b/content/presentations.tex @@ -1,5 +1,6 @@ \subsection*{Invited} \begin{itemize}[leftmargin=*] + \item Periodic words, common subsequences and frogs. \textit{Auburn Combinatorics Seminar}. Online, Nov 2021. \item The maximum number of cycles in a planar graph. \textit{AMS Special Session on New Trends in Combinatorics}. Online, Oct 2021. \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. diff --git a/content/publications.tex b/content/publications.tex index 270a808..5c2f248 100644 --- a/content/publications.tex +++ b/content/publications.tex @@ -1,16 +1,16 @@ \subsection*{Submitted} \begin{itemize}[leftmargin=*] - \item\submitted{Accumulation points of the edit distance function}{R.R.\ Martin and D.\ McGinnis}{2107.06706} \item\submitted{The maximum number of $10$- and $12$-cycles in a planar graph}{R.R.\ Martin}{2106.02966} - \item\submitted{Counting paths, cycles and blow-ups in planar graphs}{R.R.\ Martin}{2101.05911} \item\submitted{Uniquely optimal codes of low complexity are symmetric}{E.J.\ King, D.G.\ Mixon and H.\ Parshall}{2008.12871} \end{itemize} \subsection*{Accepted} \begin{itemize}[leftmargin=*] + \item\accepted{Counting paths, cycles and blow-ups in planar graphs}{R.R.\ Martin}{Journal of Graph Theory}{2101.05911} \item\accepted{Periodic words, common subsequences and frogs}{B.\ Bukh}{Annals of Applied Probability}{1912.03510} \end{itemize} \subsection*{Published} \begin{itemize}[leftmargin=*] + \item\published{Accumulation points of the edit distance function}{R.R.\ Martin and D.\ McGinnis}{Discrete Mathematics}{345}{7}{112857}{Jul 2022}{10.1016/j.disc.2022.112857} \item\published{Restricted online Ramsey numbers of matchings and trees}{J.\ Briggs}{Electronic Journal of Combinatorics}{27}{3}{3.49}{Sep 2020}{10.37236/8649} \item\published{Nearly orthogonal vectors and small antipodal spherical codes}{B.\ Bukh}{Israel Journal of Mathematics}{238}{}{359--388}{Jul 2020}{10.1007/s11856-020-2027-7} \item\published{Inverting the Tur\'an problem}{J.\ Briggs}{Discrete Mathematics}{342}{7}{1865--1884}{Jul 2019}{10.1016/j.disc.2019.03.005} |