Also see Google Scholar.

Preprints

• An Erdős-Pósa theorem for cycles and faces of distinct lengths
  With J. Pascal Gollin, Maximilian Gorksy, Meike Hatzel, Kevin Hendrey, Tony Huynh, Marek Sokołowski, Sebastian Wiederrecht, and Paul Wollan. arXiv link

• The structure of group-labeled graphs forbidding an immersion
  With Rose McCarty and Paul Wollan. arXiv link

• Graphs whose Eulerian trails have unique labels
  With Donggyu Kim and Rose McCarty. arXiv link

• Coloring graphs with no totally odd clique immersion
  arXiv link

Published

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

In Proceedings

• Odd faces as a parameter for maximum independent set in embedded graphs
  to appear in SODA 2027. With Samuel Fiorini and Stefan Kober.

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

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

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