Also see Google Scholar.

Preprints

• Almost all graphs are vertex-minor universal
  With Ruben Ascoli, Bryce Frederickson, Sarah Frederickson, and Logan Post. arXiv link

• Totally ∆-modular tree decompositions of graphic matrices for integer programming.
  arXiv link

• Odd-cycle-packing-treewidth: On the maximum independent set problem in odd-minor-free graph classes.
  With Mujin Choi, Maximilian Gorsky, Gunwoo Kim, and Sebastian Wiederrecht. arXiv link

• Coloring graphs with no totally odd clique immersion.
  arXiv link

• The independence ratio of 4-cycle-free planar graphs.
  With Tom Kelly, Sid Kolichala, and Jatong Su. arXiv link