summaryrefslogtreecommitdiff
path: root/content/presentations.bib
diff options
context:
space:
mode:
authorChris Cox <chris@mathematicaster.org>2022-10-05 13:25:51 -0500
committerChris Cox <chris@mathematicaster.org>2022-10-05 13:25:51 -0500
commit5da1c3de6966f256c744b7c45312b2519e3933e8 (patch)
tree1274e7d5562012564e25760d6005e0f6c15fe369 /content/presentations.bib
parenta55221513406c2763aa77099fbc2c27e02287a3b (diff)
downloadcv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar.gz
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar.bz2
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar.lz
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar.xz
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.tar.zst
cv-5da1c3de6966f256c744b7c45312b2519e3933e8.zip
Working on making it better
Diffstat (limited to 'content/presentations.bib')
-rw-r--r--content/presentations.bib332
1 files changed, 332 insertions, 0 deletions
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},
+}