summaryrefslogtreecommitdiff
path: root/content/publications.tex
diff options
context:
space:
mode:
authorChris Cox <chris@mathematicaster.org>2021-07-14 20:31:33 -0500
committerChris Cox <chris@mathematicaster.org>2021-07-14 20:31:33 -0500
commite32dfcf1a705999343274946c4647dddc08542d9 (patch)
tree4f3ab555f45abdb82bdca9efa0887bcc766da77c /content/publications.tex
parent07360c31a1ab78d9128d6825f8ff3800cfbef607 (diff)
parent99ea52eb2e31353d856807d0d54236d2678336bb (diff)
downloadcv-e32dfcf1a705999343274946c4647dddc08542d9.tar
cv-e32dfcf1a705999343274946c4647dddc08542d9.tar.gz
cv-e32dfcf1a705999343274946c4647dddc08542d9.tar.bz2
cv-e32dfcf1a705999343274946c4647dddc08542d9.tar.lz
cv-e32dfcf1a705999343274946c4647dddc08542d9.tar.xz
cv-e32dfcf1a705999343274946c4647dddc08542d9.tar.zst
cv-e32dfcf1a705999343274946c4647dddc08542d9.zip
Merge branch 'master' of mathematicaster.org:cv
Diffstat (limited to 'content/publications.tex')
-rw-r--r--content/publications.tex21
1 files changed, 11 insertions, 10 deletions
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}