Working on making it better

7 files changed, 680 insertions, 133 deletions

diff --git a/content/interests.tex b/content/interests.tex
index 448eb91..792e7ea 100644
--- a/content/interests.tex
+++ b/content/interests.tex
@@ -1 +1 @@
-Extremal combinatorics, probabilistic methods, algebraic methods, discrete geometry.
+Extremal combinatorics and graph theory, probabilistic methods, algebraic methods, discrete geometry, coding theory.
diff --git a/content/papers.bib b/content/papers.bib
index b182933..6fbb945 100644
--- a/content/papers.bib
+++ b/content/papers.bib
@@ -1,132 +1,263 @@
-@article {jBC19,
-    AUTHOR = {Briggs, Joseph and Cox, Christopher},
-     TITLE = {Inverting the {T}ur\'{a}n problem},
-   JOURNAL = {Discrete Math.},
-  FJOURNAL = {Discrete Mathematics},
-    VOLUME = {342},
-      YEAR = {2019},
-    NUMBER = {7},
-     PAGES = {1865--1884},
-      ISSN = {0012-365X},
-   MRCLASS = {05C35},
-  MRNUMBER = {3937748},
-       DOI = {10.1016/j.disc.2019.03.005},
-       URL = {https://doi.org/10.1016/j.disc.2019.03.005},
+@article{cox_planarcycles,
+    author = {Cox, Christopher and Martin, Ryan R.},
+    title = {The maximum number of 10- and 12-cycles in a planar graph},
+    year = {2022},
+    eprint = {2106.02966},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    journal = {Discrete Mathematics},
+    keywords = {accepted},
 }
 
-@article {bBC19, 
-	AUTHOR = {Bukh, Boris and Cox, Christopher}, 
-	 TITLE = {On a fractional version of {H}aemers’ bound}, 
-   JOURNAL = {IEEE Transactions on Information Theory}, 
-    VOLUME = {65},
-    NUMBER = {6},
-     PAGES = {3340--3348},
+@misc{unicorns,
+    author = {Cox, Christopher and King, Emily J. and Mixon, Dustin G. and Parshall, Hans},
+    title = {Uniquely optimal codes of low complexity are symmetric},
+    year = {2020},
+    month = {aug},
+    eprint = {2008.12871},
+    eprintclass = {math.CO},
+    eprinttype = {arxiv},
+    keywords = {submitted},
+    abstract = {We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.}
 }
 
-@article {CS18,
-    AUTHOR = {Cox, Christopher and Stolee, Derrick},
-     TITLE = {Ramsey numbers for partially-ordered sets},
-   JOURNAL = {Order},
-  FJOURNAL = {Order. A Journal on the Theory of Ordered Sets and its
-              Applications},
-    VOLUME = {35},
-      YEAR = {2018},
-    NUMBER = {3},
-     PAGES = {557--579},
-      ISSN = {0167-8094},
-   MRCLASS = {05C55 (05C65 06A07)},
-  MRNUMBER = {3861400},
-MRREVIEWER = {Zilin Jiang},
-       DOI = {10.1007/s11083-017-9449-9},
-       URL = {https://doi.org/10.1007/s11083-017-9449-9},
+@article{cox_planarpaths,
+    author = {Cox, Christopher and Martin, Ryan R.},
+    title = {Counting paths, cycles and blow-ups in planar graphs},
+    journal = {Journal of Graph Theory},
+    volume = {101},
+    number = {3},
+    pages = {521-558},
+    year = {2022},
+    month = {apr},
+    doi = {10.1002/jgt.22838},
+    eprint = {2101.05911},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
 }
 
-@article {BCDHKLMMNPS17,
-    AUTHOR = {Berikkyzy, Zhanar and Cox, Christopher and Dairyko, Michael
-              and Hogenson, Kirsten and Kumbhat, Mohit and Lidick\'{y}, Bernard
-              and Messerschmidt, Kacy and Moss, Kevin and Nowak, Kathleen
-              and Palmowski, Kevin F. and Stolee, Derrick},
-     TITLE = {{$(4,2)$}-choosability of planar graphs with forbidden
-              structures},
-   JOURNAL = {Graphs Combin.},
-  FJOURNAL = {Graphs and Combinatorics},
-    VOLUME = {33},
-      YEAR = {2017},
-    NUMBER = {4},
-     PAGES = {751--787},
-      ISSN = {0911-0119},
-   MRCLASS = {05C15 (05C10)},
-  MRNUMBER = {3665686},
-       DOI = {10.1007/s00373-017-1812-5},
-       URL = {https://doi.org/10.1007/s00373-017-1812-5},
+@article{lcsfrogs,
+    author = {Cox, Christopher and Bukh, Boris},
+    title = {Periodic words, common subsequences and frogs},
+    year = {2022},
+    month = {apr},
+    journal = {Annals of Applied Probability},
+    volume = {32},
+    number = {2},
+    pages = {1295--1332},
+    doi = {10.1214/21-AAP1709},
+    eprint = {1912.03510},
+    eprintclass = {math.PR},
+    eprinttype = {arxiv},
+    extra = {Code},
+    keywords = {published},
 }
 
-@article {BBCDLP17,
-    AUTHOR = {Banaian, Esther and Butler, Steve and Cox, Christopher and
-              Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
-     TITLE = {A generalization of {E}ulerian numbers via rook placements},
-   JOURNAL = {Involve},
-  FJOURNAL = {Involve. A Journal of Mathematics},
-    VOLUME = {10},
-      YEAR = {2017},
-    NUMBER = {4},
-     PAGES = {691--705},
-      ISSN = {1944-4176},
-   MRCLASS = {05A15 (05A05)},
-  MRNUMBER = {3630311},
-MRREVIEWER = {Volker Strehl},
-       DOI = {10.2140/involve.2017.10.691},
-       URL = {https://doi.org/10.2140/involve.2017.10.691},
+@article{cox_editdistance,
+    author = {Cox, Christopher and Martin, Ryan R. and McGinnis, Daniel},
+    title = {Accumulation points of the edit distance function},
+    year = {2022},
+    month = {jul},
+    journal = {Discrete Mathematics},
+    volume = {345},
+    number = {7},
+    pages = {112857},
+    eprint = {2107.06706},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    doi = {10.1016/j.disc.2022.112857},
+    keywords = {published},
+    author+an = {3=earlygrad},
 }
 
-@article {BBCDLP16,
-    AUTHOR = {Banaian, Esther and Butler, Steve and Cox, Christopher and
-              Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
-     TITLE = {Counting prime juggling patterns},
-   JOURNAL = {Graphs Combin.},
-  FJOURNAL = {Graphs and Combinatorics},
-    VOLUME = {32},
-      YEAR = {2016},
-    NUMBER = {5},
-     PAGES = {1675--1688},
-      ISSN = {0911-0119},
-   MRCLASS = {05A05 (05A15 05A30)},
-  MRNUMBER = {3543189},
-MRREVIEWER = {Zhicong Lin},
-       DOI = {10.1007/s00373-016-1711-1},
-       URL = {https://doi.org/10.1007/s00373-016-1711-1},
+
+@article{onlineramsey,
+    author = {Cox, Christopher and Briggs, Joseph},
+    title = {Restricted online Ramsey numbers of matchings and trees},
+    journal = {Electronic Journal of Combinatorics},
+    year = {2020},
+    month = {sep},
+    eprint = {1904.00246},
+    eprintclass = {math.CO},
+    eprinttype = {arxiv},
+    doi = {10.37236/8649},
+    keywords = {published},
+    abstract = {Consider a two-player game between players Builder and Painter. Painter begins the game by picking a coloring of the edges of $K_n$, which is hidden from Builder.
+	In each round, Builder points to an edge and Painter reveals its color.
+	Builder's goal is to locate a particular monochromatic structure in Painter's coloring by revealing the color of as few edges as possible.
+    The fewest number of turns required for Builder to win this game is known as the restricted online Ramsey number.
+	In this paper, we consider the situation where this ``particular monochromatic structure'' is a large matching or a large tree.
+	We show that in any $t$-coloring of $E(K_n)$, Builder can locate a monochromatic matching on at least ${n-t+1\over t+1}$ edges by revealing at most $O(n\log t)$ edges.
+	We show also that in any $3$-coloring of $E(K_n)$, Builder can locate a monochromatic tree on at least $n/2$ vertices by revealing at most $5n$ edges.
+                }
+}
+
+@article{nearorth,
+        author = {Cox, Christopher and Bukh, Boris},
+         title = {Nearly orthogonal vectors and small antipodal spherical codes},
+       journal = {Israel Journal of Mathematics},
+        volume = {238},
+          year = {2020},
+         MONTH = {jul},
+        number = {1},
+         pages = {359--388},
+           doi = {10.1007/s11856-020-2027-7},
+        eprint = {1803.02949},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+      keywords = {published},
+}
+
+@article{invturan,
+    author = {Cox, Christopher and Briggs, Joseph},
+    title = {Inverting the Tur{\'a}n problem},
+    journal = {Discrete Mathematics},
+    publisher = {Elsevier BV},
+    year = {2019},
+    month = {jul},
+    number = {7},
+    volume = {342},
+    pages = {1865--1884},
+    doi = {10.1016/j.disc.2019.03.005},
+    eprint = {1711.02082},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+}
+
+@article{frachaemers,
+    author = {Cox, Christopher and Bukh, Boris},
+    title = {On a fractional version of Haemers' bound},
+    journal = {IEEE Transactions on Information Theory},
+    publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
+    year = {2019},
+    month = {jun},
+    number = {6},
+    volume = {65},
+    pages = {3340--3348},
+    doi = {10.1109/tit.2018.2889108},
+    eprint = {1802.00476},
+    eprinttype = {arxiv},
+    eprintclass = {cs.IT},
+    keywords = {published},
+}
+
+
+@article{poramsey,
+    author = {Cox, Christopher and Stolee, Derrick},
+    title = {Ramsey numbers for partially-ordered sets},
+    journal = {Order},
+    publisher = {Springer Nature},
+    year = {2018},
+    month = {jan},
+    number = {3},
+    volume = {35},
+    pages = {557--579},
+    doi = {10.1007/s11083-017-9449-9},
+    eprint = {1512.05261},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+}
+
+
+@article{42choose,
+    author = {Berikkyzy, Zhanar and Dairyko, Michael and Hogenson, Kirsten and Kumbhat, Mohit and Lidicky, Bernard and Messerschmidt, Kacy and Moss, Kevin and Nowak, Kathleen and Palmowski, Kevin and Stolee, Derrick},
+    title = {(4,2)-choosability of planar graphs with forbidden structures},
+    journal = {Graphs and Combinatorics},
+    publisher = {Springer Nature},
+    year = {2017},
+    month = {jun},
+    number = {4},
+    volume = {33},
+    pages = {751--787},
+    doi = {10.1007/s00373-017-1812-5},
+    eprint = {1512.03787},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+    abstract = {All planar graphs are $4$-colorable and $5$-choosable, while some planar graphs are not $4$-choosable.
+                Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention.
+                In terms of constraining the structure of the graph, for any $\ell\in\{3,4,5,6,7\}$, a planar graph is $4$-choosable if it is $\ell$-cycle-free.
+                In terms of constraining the list assignment, one refinement of $k$-choosability is choosability with separation.
+                A graph is $(k, s)$-choosable if the graph is colorable from lists of size $k$ where adjacent vertices have at most $s$ common colors in their lists.
+                Every planar graph is $(4, 1)$-choosable, but there exist planar graphs that are not $(4, 3)$-choosable.
+                It is an open question whether planar graphs are always $(4, 2)$-choosable.
+                A chorded $\ell$-cycle is an $\ell$-cycle with one additional edge.
+                We demonstrate for each $\ell\in\{5,6,7\}$ that a planar graph is $(4, 2)$-choosable if it does not contain chorded $\ell$-cycles.
+                }
+}
+
+
+@article{eulerrooks,
+    author = {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
+    title = {A generalization of Eulerian numbers via rook placements},
+    journal = {Involve, a Journal of Mathematics},
+    publisher = {Mathematical Sciences Publishers},
+    year = {2017},
+    month = {mar},
+    number = {4},
+    volume = {10},
+    pages = {691--705},
+    doi = {10.2140/involve.2017.10.691},
+    eprint = {1508.03673},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+    author+an = {1=undergrad; 4=undergrad; 5=undergrad; 6=undergrad},
+}
+
+@article{primejuggle,
+    author = {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte},
+    title = {Counting prime juggling patterns},
+    journal = {Graphs and Combinatorics},
+    publisher = {Springer Science and Business Media LLC},
+    year = {2016},
+    month = {may},
+    number = {5},
+    volume = {32},
+    pages = {1675--1688},
+    doi = {10.1007/s00373-016-1711-1},
+    eprint = {1508.05296},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+    author+an = {1=undergrad; 4=undergrad; 5=undergrad; 6=undergrad},
 }
 
-@article {CD16,
-    AUTHOR = {Cox, Christopher and Stolee, Derrick},
-     TITLE = {Ordered {R}amsey numbers of loose paths and matchings},
-   JOURNAL = {Discrete Math.},
-  FJOURNAL = {Discrete Mathematics},
-    VOLUME = {339},
-      YEAR = {2016},
-    NUMBER = {2},
-     PAGES = {499--505},
-      ISSN = {0012-365X},
-   MRCLASS = {05C55 (05C65)},
-  MRNUMBER = {3431360},
-       DOI = {10.1016/j.disc.2015.09.026},
-       URL = {https://doi.org/10.1016/j.disc.2015.09.026},
+@article{loosepath,
+    author = {Cox, Christopher and Stolee, Derrick},
+    title = {Ordered Ramsey numbers of loose paths and matchings},
+    journal = {Discrete Mathematics},
+    publisher = {Elsevier BV},
+    year = {2016},
+    month = {feb},
+    number = {2},
+    volume = {339},
+    pages = {499--505},
+    doi = {10.1016/j.disc.2015.09.026},
+    eprint = {1411.4058},
+    eprinttype = {arxiv},
+    eprintclass = {math.CO},
+    keywords = {published},
+    abstract = {For a $k$-uniform hypergraph $G$ with vertex set $\{1,\dots,n\}$, the ordered Ramsey number $\operatorname{OR}_t(G)$ is the least integer $N$ such that every $t$-coloring of the edges of the complete $k$-uniform graph on vertex set $\{1,\dots,N\}$ contains a monochromatic copy of $G$ whose vertices follow the prescribed order.
+                Due to this added order restriction, the ordered Ramsey numbers can be much larger than the usual graph Ramsey numbers.
+                We determine that the ordered Ramsey numbers of loose paths under a monotone order grows as a tower of height two less than the maximum degree in terms of the number of edges.
+                We also extend theorems of Conlon et al. (2015) on the ordered Ramsey numbers of $2$-uniform matchings to provide upper bounds on the ordered Ramsey number of $k$-uniform matchings under certain orderings.
+                }
 }
 
-@article {CDDKRT15,
-    AUTHOR = {Cox, Christopher and De Silva, Jessica and DeOrsey, Philip and
-              Kenter, Franklin H. J. and Retter, Troy and Tobin, Josh},
-     TITLE = {How to make the perfect fireworks display: two strategies for
-              {\it {H}anabi}},
-   JOURNAL = {Math. Mag.},
-  FJOURNAL = {Mathematics Magazine},
-    VOLUME = {88},
-      YEAR = {2015},
-    NUMBER = {5},
-     PAGES = {323--336},
-      ISSN = {0025-570X},
-   MRCLASS = {91A46 (91A12)},
-  MRNUMBER = {3470682},
-       DOI = {10.4169/math.mag.88.5.323},
-       URL = {https://doi.org/10.4169/math.mag.88.5.323},
+@article{hanabi,
+    author = {Cox, Christopher and De Silva, Jessica and DeOrsey, Philip and Kenter, Franklin and Retter, Troy and Tobin, Josh},
+    title = {How to make the perfect fireworks display: Two strategies for \emph{Hanabi}},
+    journal = {Mathematics Magazine},
+    publisher = {Informa UK Limited},
+    year = {2015},
+    month = {dec},
+    number = {5},
+    volume = {88},
+    pages = {323--336},
+    doi = {10.4169/math.mag.88.5.323},
+    keywords = {published},
 }
diff --git a/content/positions.tex b/content/positions.tex
index 5d04f64..f16565d 100644
--- a/content/positions.tex
+++ b/content/positions.tex
@@ -1,23 +1,23 @@
 \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: 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)
+%     \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}
 
 \textbf{Teaching assistant}\dotfill 2015--2020\at{Carnegie Mellon University, Pittsburgh, PA}
-\begin{itemize}
-	\item Instructor: Matrices and Linear Transformations (21-241), Concepts of Mathematics (21-127)
-	\item TA: Mathematical Studies Algebra I (21-237), Matrix Theory (21-242), Multidimensional Calculus (21-268), Calculus I (21-115), Discrete Mathematics (21-228), Concepts of Mathematics (21-127)
-\end{itemize}
+% \begin{itemize}
+% 	\item Instructor: Matrices and Linear Transformations (21-241), Concepts of Mathematics (21-127)
+% 	\item TA: Mathematical Studies Algebra I (21-237), Matrix Theory (21-242), Multidimensional Calculus (21-268), Calculus I (21-115), Discrete Mathematics (21-228), Concepts of Mathematics (21-127)
+% \end{itemize}
 
 \textbf{REU graduate research mentor}\dotfill 2015\at{Iowa State University, Ames, IA}
 \begin{itemize}
-	\item Worked with four undergraduate students on problems in enumerative combinatorics.
+	% \item Worked with four undergraduate students on problems in enumerative combinatorics.
 	\item The papers ``A generalization of Eulerian numbers via rook placements'' and ``Counting prime juggling patterns'' are a result of this research workshop.
 \end{itemize}
 
 \textbf{Teaching assistant}\dotfill 2014--2015\at{Iowa State University, Ames, IA}
-\begin{itemize}
-	\item TA: Elementary Differential Equations (MATH 267), Calculus I (MATH 165).
-\end{itemize}
+% \begin{itemize}
+% 	\item TA: Elementary Differential Equations (MATH 267), Calculus I (MATH 165).
+% \end{itemize}
diff --git a/content/presentations.bib b/content/presentations.bib
new file mode 100644
index 0000000..a23d419
--- /dev/null
+++ b/content/presentations.bib
@@ -0,0 +1,332 @@
+@misc{ams_22,
+    title = {Maximum likelihood estimators and subgraph counts in planar graphs},
+    year = {2022},
+    month = {oct},
+    howpublished = {AMS Special Session on Topics in Graphs, Hypergraphs and Set Systems},
+    location = {Salt Lake City, UT},
+    keywords = {invited, conference},
+}
+
+@misc{auburn_21,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2021},
+    month = {nov},
+    howpublished = {Auburn Combinatorics Seminar},
+    location = {Online},
+    keywords = {invited, seminar},
+}
+
+@misc{ams_21,
+    title = {The maximum number of cycles in a planar graph},
+    year = {2021},
+    month = {oct},
+    howpublished = {AMS Special Session on New Trends in Combinatorics},
+    location = {Online},
+    keywords = {invited, conference},
+}
+
+@misc{home_21_1,
+    title = {A toadally ribbeting and unfrogettable tale of longest common subsequences},
+    year = {2021},
+    month = {sep},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Ames, IA},
+    keywords = {internal, home, seminar},
+}
+
+@misc{kit_21,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2021},
+    month = {may},
+    howpublished = {KIT Combinatorics Seminar},
+    location = {Online},
+    keywords = {invited, seminar},
+}
+
+@misc{home_21,
+    title = {The maximum number of paths and cycles in planar graphs},
+    year = {2021},
+    month = {feb},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Online},
+    keywords = {internal, seminar, home},
+}
+
+@misc{sc_21,
+    title = {The maximum number of paths and cycles in planar graphs},
+    year = {2021},
+    month = {feb},
+    howpublished = {U South Carolina Discrete Math Seminar},
+    location = {Online},
+    keywords = {invited, seminar},
+}
+
+@misc{ams_20,
+    title = {Restricted online Ramsey numbers of matchings},
+    year = {2020},
+    month = {oct},
+    howpublished = {AMS Special Session on Advances in Graph Theory},
+    location = {Online},
+    keywords = {invited, conference},
+}
+
+@misc{home_20,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2020},
+    month = {sep},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Online},
+    keywords = {internal, home, seminar},
+}
+
+@misc{codex_20,
+    title = {Nearly orthogonal vectors},
+    year = {2020},
+    month = {may},
+    howpublished = {CodEx Seminar},
+    location = {Online},
+    keywords = {invited, seminar},
+}
+
+@misc{isu_20,
+    title = {Nearly orthogonal vectors},
+    year = {2020},
+    month = {may},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Online},
+    keywords = {invited, seminar},
+}
+
+@misc{virginia_20,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2020},
+    month = {feb},
+    howpublished = {U Virginia Probability Seminar},
+    location = {Charlottesville, VA},
+    keywords = {invited, seminar},
+}
+
+@misc{ucsd_20,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2020},
+    month = {feb},
+    howpublished = {UCSD Combinatorics Seminar},
+    location = {La Jolla, CA},
+    keywords = {invited, seminar},
+}
+
+@misc{home_19,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2019},
+    month = {nov},
+    howpublished = {CMU ACO Seminar},
+    location = {Pittsburgh, PA},
+    keywords = {internal, seminar, home},
+}
+
+@misc{mit_19,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2019},
+    month = {oct},
+    howpublished = {MIT Combinatorics Seminar},
+    location = {Cambridge, MA},
+    keywords = {invited, seminar},
+}
+
+@misc{warwick_19,
+    title = {Periodic words, common subsequences and frogs},
+    year = {2019},
+    month = {Sep},
+    howpublished = {Warwick Combinatorics Seminar},
+    location = {Coventry, UK},
+    keywords = {invited, seminar},
+}
+
+@misc{european_19,
+    title = {Nearly orthogonal vectors and small antipodal spherical codes},
+    year = {2019},
+    month = {aug},
+    howpublished = {Euopean Combinatorics Conference},
+    location = {Bratislava, Slovakia},
+    keywords = {contributed, conference},
+}
+
+@misc{finite_19,
+    title = {Nearly orthogonal vectors},
+    year = {2019},
+    month = {aug},
+    howpublished = {Finite Geometry and Extremal Combinatorics},
+    location = {Newark, DE},
+    keywords = {contributed, conference},
+}
+
+@misc{isu_19,
+    title = {Algorithmic re-proofs of some Ramsey numbers},
+    year = {2019},
+    month = {mar},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Ames, IA},
+    keywords = {invited, seminar},
+}
+
+@misc{home_18,
+    title = {Small antipodal spherical codes},
+    year = {2019},
+    month = {oct},
+    howpublished = {CMU CS Theory Seminar},
+    location = {Pittsburgh, PA},
+    keywords = {seminar, internal, home},
+}
+
+@misc{ams_18,
+    title = {A fractional version of Haemers' bound},
+    year = {2018},
+    month = {sep},
+    howpublished = {AMS Special Session on Graph Theory},
+    location = {Newark, DE},
+    keywords = {invited, conference},
+}
+
+@misc{isu_181,
+    title = {Inverting the Tur{\'a}n problem},
+    year = {2018},
+    month = {jul},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Ames, IA},
+    keywords = {invited, seminar},
+}
+
+@misc{icgt_18,
+    title = {Inverting the Tur{\'a}n problem},
+    year = {2018},
+    month = {jul},
+    howpublished = {ICGT},
+    location = {Lyon, France},
+    keywords = {contributed, conference},
+}
+
+@misc{bridges_18,
+    title = {Nearly orthogonal vectors (poster)},
+    year = {2018},
+    month = {jul},
+    howpublished = {Building Bridges II},
+    location = {Budapest, Hungary},
+    keywords = {contributed, conference, poster},
+}
+
+@misc{technion_18,
+    title = {Nearly orthogonal vectors},
+    year = {2018},
+    month = {jun},
+    howpublished = {Technion Combinatorics Seminarl},
+    location = {Haifa, Israel},
+    keywords = {seminar, invited},
+}
+
+@misc{huji_18,
+    title = {Nearly orthogonal vectors},
+    year = {2018},
+    month = {jun},
+    howpublished = {Hebrew University of Jerusalem Combinatorics Seminarl},
+    location = {Jerusalem, Israel},
+    keywords = {seminar, invited},
+}
+
+@misc{bg_18,
+    title = {A fractional version of Haemers' bound},
+    year = {2018},
+    month = {jun},
+    howpublished = {Ben-Gurion Combinatorics Seminar},
+    location = {Be'er Sheva, Israel},
+    keywords = {seminar, invited},
+}
+
+@misc{mighty_18,
+    title = {Inverting the Tur{\'a}n problem},
+    year = {2018},
+    month = {apr},
+    howpublished = {MIGHTY LIX},
+    location = {Morgantown, WV},
+    keywords = {contributed, conference},
+}
+
+@misc{isu_18,
+    title = {Nearly orthogonal vectors},
+    year = {2018},
+    month = {mar},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Ames, IA},
+    keywords = {seminar, invited},
+}
+
+@misc{ams_16,
+    title = {Ramsey numbers on the Boolean lattice},
+    year = {2016},
+    month = {nov},
+    howpublished = {AMS Special Session on Structural and Computational Graph Theory},
+    location = {Raleigh, NC},
+    keywords = {invited, conference},
+}
+
+@misc{home_16,
+    title = {Ramsey numbers for partially-ordered sets},
+    year = {2016},
+    month = {feb},
+    howpublished = {CMU ACO Seminar},
+    location = {Pittsburgh, PA},
+    keywords = {seminar, internal, home},
+}
+
+@misc{conn_15,
+    title = {A degree-sequence variant of Ramsey's theorem},
+    year = {2015},
+    month = {jun},
+    howpublished = {Connections in Discrete Mathematics},
+    location = {Vancouver, CA},
+    keywords = {contributed, conference},
+}
+
+@misc{ams_15,
+    title = {Ramsey numbers of ordered hypergraphs},
+    year = {2015},
+    month = {apr},
+    howpublished = {AMS Special Session on Extremal and Structural Graph Theory},
+    location = {Las Vegas, NV},
+    keywords = {invited, conference},
+}
+
+@misc{cu_15,
+    title = {Ramsey numbers of ordered hypergraphs},
+    year = {2015},
+    month = {mar},
+    howpublished = {U Colorado Denver Discrete Math Seminar},
+    location = {Denver, CO},
+    keywords = {invited, seminar},
+}
+
+@misc{home_14,
+    title = {Ordered Ramsey number of loose paths and $k$-uniform matchings},
+    year = {2014},
+    month = {oct},
+    howpublished = {ISU Discrete Math Seminar},
+    location = {Ames, IA},
+    keywords = {internal, seminar, home},
+}
+
+@misc{sacnas_13,
+    title = {Normally regular digraphs resulting from Cayley graphs (poster)},
+    year = {2013},
+    month = {oct},
+    howpublished = {SACNAS},
+    location = {San Antonio, TX},
+    keywords = {contributed, conference, poster},
+}
+
+@misc{maa_13,
+    title = {Isospectral drums and cospectral graphs},
+    year = {2013},
+    month = {aug},
+    howpublished = {MAA Mathfest},
+    location = {Hartford, CT},
+    keywords = {contributed, conference},
+}
diff --git a/content/publications.tex b/content/publications.tex
index 34c2ec8..657bcb7 100644
--- a/content/publications.tex
+++ b/content/publications.tex
@@ -1,14 +1,14 @@
 \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{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=*]
-% \end{itemize}
+\subsection*{Accepted}
+\begin{itemize}[leftmargin=*]
+    \item\accepted{The maximum number of $10$- and $12$-cycles in a planar graph}{R.R.\ Martin}{Discrete Mathematics}{2106.02966}
+\end{itemize}
 \subsection*{Published}
 \begin{itemize}[leftmargin=*]
-    \item\published{Counting paths, cycles and blow-ups in planar graphs}{R.R.\ Martin}{Journal of Graph Theory}{}{}{1--38}{Apr 2022}{10.1002/jgt.22838}
+    \item\published{Counting paths, cycles and blow-ups in planar graphs}{R.R.\ Martin}{Journal of Graph Theory}{101}{3}{521--558}{Apr 2022}{10.1002/jgt.22838}
     \item\published{Periodic words, common subsequences and frogs}{B.\ Bukh}{Annals of Applied Probability}{32}{2}{1295--1332}{Apr 2022}{10.1214/21-AAP1709}
     \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}
diff --git a/content/service.tex b/content/service.tex
new file mode 100644
index 0000000..dde2e84
--- /dev/null
+++ b/content/service.tex
@@ -0,0 +1,4 @@
+\begin{itemize}[leftmargin=*]
+    \item Co-organizer of the \href{https://seminar.mathematicaster.org/}{Iowa State University discrete math seminar}.\dotfill 2020--Cur
+    \item Co-organizer of the \href{https://sites.google.com/view/mmmm22}{5th Mostly annual Mostly Manitoba, Michigan and Minnesota Combinatorics Graduate Student Workshop}.\dotfill 2022
+\end{itemize}
diff --git a/content/teaching.tex b/content/teaching.tex
new file mode 100644
index 0000000..26cc37d
--- /dev/null
+++ b/content/teaching.tex
@@ -0,0 +1,80 @@
+\subsection*{Iowa State University \normalfont{\normalsize\dotfill 2014--2015, 2020--Cur}}
+\subsubsection*{Instructor}
+\begin{itemize}
+    \item MATH 595: Longest Common Subsequences
+        \begin{itemize}
+            \item Early graduate research seminar
+            \item Fall 2022
+        \end{itemize}
+    \item MATH 595: Algebraic Methods in Combinatorics
+        \begin{itemize}
+            \item Graduate reading course
+            \item Spring 2022
+        \end{itemize}
+    \item MATH 595: Edit Distance in Graphs
+        \begin{itemize}
+            \item Early graduate research seminar
+            \item Fall 2020
+        \end{itemize}
+    \item MATH 314: Graph Theory
+        \begin{itemize}
+            \item Spring 2022
+        \end{itemize}
+    \item MATH 165: Calculus I
+        \begin{itemize}
+            \item Large lecture: Fall 2022
+            \item Small lecture: Spring 2021
+        \end{itemize}
+\end{itemize}
+\vspace{-15pt}
+
+\subsubsection*{Teaching assistant}
+\begin{itemize}
+    \item MATH 267: Elementary Differential Equations and Laplace Transforms
+        \begin{itemize}
+            \item Fall 2020, Fall 2021, Spring 2015
+        \end{itemize}
+    \item MATH 165: Calculus I
+        \begin{itemize}
+            \item Fall 2014
+        \end{itemize}
+\end{itemize}
+
+
+\subsection*{Carnegie Mellon University \normalfont{\normalsize\dotfill 2015--2020}}
+\subsubsection*{Instructor}
+\begin{itemize}
+    \item 21-241: Matrices and Linear Transformations
+        \begin{itemize}
+            \item SummerII 2019
+        \end{itemize}
+    \item 21-127: Concepts of Mathematics
+        \begin{itemize}
+            \item SummerII 2017
+        \end{itemize}
+\end{itemize}
+\vspace{-15pt}
+
+\subsubsection*{Teaching assistant}
+\begin{itemize}
+    \item 21-242: Matrix Theory
+        \begin{itemize}
+            \item Fall 2017
+        \end{itemize}
+    \item 21-237: Mathematical Studies Algebra I
+        \begin{itemize}
+            \item Fall 2018
+        \end{itemize}
+    \item 21-228: Discrete Mathematics
+        \begin{itemize}
+            \item Spring 2020, Spring 2016
+        \end{itemize}
+    \item 21-127: Concepts of Mathematics
+        \begin{itemize}
+            \item Fall 2015
+        \end{itemize}
+    \item 21-115: Calculus I
+        \begin{itemize}
+            \item SummerI 2016
+        \end{itemize}
+\end{itemize}