New paper!

3 files changed, 32 insertions, 21 deletions

diff --git a/content/presentations.tex b/content/presentations.tex
index 445067a..c9fd4a0 100644
--- a/content/presentations.tex
+++ b/content/presentations.tex
@@ -1,18 +1,15 @@
 \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 The maximum number of paths and cycles in planar graphs. \textit{ISU 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 Periodic words, common subsequences and frogs. \textit{ISU Discrete Math Seminar}. Online, Sep 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{CMU ACO Seminar}. Pittsburgh, PA, Nov 2019.
 	\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 Small antipodal spherical codes. \textit{CMU CS Theory Seminar}. Pittsburgh, PA, Oct 2018.
 	\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.
@@ -20,10 +17,8 @@
 	\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 for partially-ordered sets. \textit{CMU ACO Seminar}. Pittsburgh, PA, Feb 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.
-	\item Ordered Ramsey numbers of loose paths and $k$-uniform matchings. \textit{ISU Discrete Math Seminar}. Ames, IA, Oct 2014.
 \end{itemize}
 \subsection*{Contributed}
 \begin{itemize}[leftmargin=*]
@@ -38,3 +33,12 @@
 	\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 \normalfont{(at my home institution)}}
+\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}
diff --git a/content/publications.tex b/content/publications.tex
index 8a15b55..0605ebd 100644
--- a/content/publications.tex
+++ b/content/publications.tex
@@ -1,5 +1,6 @@
 \subsection*{Submitted}
 \begin{itemize}[leftmargin=*]
+    \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}
@@ -9,14 +10,14 @@
 \end{itemize}
 \subsection*{Published}
 \begin{itemize}[leftmargin=*]
-    \item\published{Restricted online Ramsey numbers of matchings and trees}{J.\ Briggs}{Electronic Journal of Combinatorics}{27}{3}{3.49}{Sep 2020}
-    \item\published{Nearly orthogonal vectors and small antipodal spherical codes}{B.\ Bukh}{Israel Journal of Mathematics}{238}{}{359--388}{Jul 2020}
-    \item\published{Inverting the Tur\'an problem}{J.\ Briggs}{Discrete Mathematics}{342}{7}{1865--1884}{Jul 2019}
-    \item\published{On a fractional version of Haemers' bound}{B.\ Bukh}{IEEE Transactions on Information Theory}{65}{6}{3340--3348}{Jun 2019}
-    \item\published{Ramsey numbers for partially-ordered sets}{D.\ Stolee}{Order}{35}{3}{557--579}{Nov 2018}
-    \item\published{$(4,2)$-choosability of planar graphs with forbidden substructures}{Z.\ Berikkyzy, M.\ Dairyko, K.\ Hogenson, M.\ Kumbhat, B.\ Lidick\'y, K.\ Messerschmidt, K.\ Moss, K.\ Nowak, K.\ Palmowski and D.\ Stolee}{Graphs and Combinatorics}{33}{4}{751--787}{Jul 2017}
-    \item\published{A generalization of Eulerian numbers via rook placements}{E.\ Banaian, S.\ Butler, J.\ Davis, J.\ Landgraf and S.\ Ponce}{Involve}{10}{4}{691--705}{Mar 2017}
-    \item\published{Counting prime juggling patterns}{E.\ Banaian, S.\ Butler, J.\ Davis, J.\ Landgraf and S.\ Ponce}{Graphs and Combinatorics}{32}{5}{1675--1688}{Sep 2016}
-    \item\published{Ordered Ramsey numbers of loose paths and matchings}{D.\ Stolee}{Discrete Mathematics}{339}{2}{499--505}{Feb 2016}
-    \item\published{How to make the perfect fireworks display: Two strategies for Hanabi}{J.\ De Silva, P.\ DeOrsey, F.\ Kenter, T.\ Retter and R.J.\ Tobin}{Mathematics Magazine}{88}{5}{323--336}{Dec 2015}
+    \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}
+    \item\published{On a fractional version of Haemers' bound}{B.\ Bukh}{IEEE Transactions on Information Theory}{65}{6}{3340--3348}{Jun 2019}{10.1109/TIT.2018.2889108}
+    \item\published{Ramsey numbers for partially-ordered sets}{D.\ Stolee}{Order}{35}{3}{557--579}{Nov 2018}{10.1007/s11083-017-9449-9}
+    \item\published{$(4,2)$-choosability of planar graphs with forbidden substructures}{Z.\ Berikkyzy, M.\ Dairyko, K.\ Hogenson, M.\ Kumbhat, B.\ Lidick\'y, K.\ Messerschmidt, K.\ Moss, K.\ Nowak, K.\ Palmowski and D.\ Stolee}{Graphs and Combinatorics}{33}{4}{751--787}{Jul 2017}{10.1007/s00373-017-1812-5}
+    \item\published{A generalization of Eulerian numbers via rook placements}{E.\ Banaian, S.\ Butler, J.\ Davis, J.\ Landgraf and S.\ Ponce}{Involve}{10}{4}{691--705}{Mar 2017}{10.2140/involve.2017.10.691}
+    \item\published{Counting prime juggling patterns}{E.\ Banaian, S.\ Butler, J.\ Davis, J.\ Landgraf and S.\ Ponce}{Graphs and Combinatorics}{32}{5}{1675--1688}{Sep 2016}{10.1007/s00373-016-1711-1}
+    \item\published{Ordered Ramsey numbers of loose paths and matchings}{D.\ Stolee}{Discrete Mathematics}{339}{2}{499--505}{Feb 2016}{10.1016/j.disc.2015.09.026}
+    \item\published{How to make the perfect fireworks display: Two strategies for Hanabi}{J.\ De Silva, P.\ DeOrsey, F.\ Kenter, T.\ Retter and R.J.\ Tobin}{Mathematics Magazine}{88}{5}{323--336}{Dec 2015}{10.4169/math.mag.88.5.323}
 \end{itemize}
diff --git a/cv.tex b/cv.tex
index 4f223b6..90d8556 100644
--- a/cv.tex
+++ b/cv.tex
@@ -2,7 +2,7 @@
 \usepackage[margin=1in]{geometry}
 \usepackage{amsfonts, amsmath, amssymb, amsthm}
 
-\PassOptionsToPackage{obeyspaces}{url}
+\PassOptionsToPackage{obeyspaces,hyphens}{url}
 \usepackage{url}
 \usepackage[colorlinks=true,citecolor=blue,urlcolor=blue,linkcolor=blue,bookmarksopen=true]{hyperref}
 \usepackage{tikz}
@@ -23,11 +23,17 @@
 \newcommand*{\at}[1]{\vspace{-5pt}\begin{itemize}[leftmargin=0.75cm]\item[@]#1\end{itemize}}
 \newcommand*{\with}[1]{\begin{itemize}[leftmargin=1.25cm]\item[with]#1\end{itemize}}
 
-\newcommand*{\arXiv}[1]{\href{http://arxiv.org/abs/#1}{arXiv:#1}}
-% \published{title}{coauthors}{journal}{vol}{no}{pp}{date}
-\newcommand*{\published}[7]{{\nopagebreak #1. \textit{#3}, \ifthere{vol}{#4}\ifthere{no}{#5}\ifthere{pp}{#6}#7.\with{#2.}}}
+\newcommand*{\arXiv}[1]{\href{https://arxiv.org/abs/#1}{arXiv:#1}}
+\newcommand*{\doi}[1]{\href{https://doi.org/#1}{DOI:#1}}
+% \published{title}{coauthors}{journal}{vol}{no}{pp}{date}{url}
+\newcommand*{\published}[8]{%
+    {\nopagebreak
+        #1. \textit{#3}, \ifthere{vol}{#4}\ifthere{no}{#5}\ifthere{pp}{#6}#7.
+        \with{#2.}
+    }
+}
 % \accepted{title}{coauthors}{journal}{arXiv}
-\newcommand*{\accepted}[4]{#1. \textit{#3}, \arXiv{#4}.\with{#2.}}
+\newcommand*{\accepted}[4]{#1. \textit{#3}. \arXiv{#4}.\with{#2.}}
 % \submitted{title}{coauthors}{arXiv}
 \newcommand*{\submitted}[3]{#1. \arXiv{#3}.\with{#2.}}