Youngho Yoo

I am a Visiting Assistant Professor in the Department of Mathematics at Texas A&M University. I am interested in combinatorics, structural graph theory, and their applications in algorithms and combinatorial optimization.

I obtained my PhD from the ACO program at Georgia Institute of Technology, working with Xingxing Yu and previously with Robin Thomas. I was partially supported by the NSERC Postgraduate Scholarship (PGS D). I completed my Bachelor's and Master's degrees at University of Waterloo in Pure Mathematics and Combinatorics & Optimization.

Papers:

• Sampling planar tanglegrams and pairs of disjoint triangulations,
  with Alexander E. Black, Kevin Liu, Alex McDonough, Garrett Nelson, Michael C. Wigal, and Mei Yin.
  Advances in Applied Mathematics, accepted.
• A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups,
  with J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, and Sang-il Oum.
  Submitted.
• Approximating TSP walks in subcubic graphs,
  with Michael Wigal and Xingxing Yu.
  Journal of Combinatorial Theory, Series B 158 (2023), 70-104.
• Packing A-paths of length zero modulo a prime,
  with Robin Thomas.
  Journal of Combinatorial Theory, Series B 160 (2023), 114-143.
• Packing cycles in undirected group-labelled graphs,
  with Robin Thomas.
  Journal of Combinatorial Theory, Series B 161 (2023), 228-267.
• The extremal functions for triangle-free graphs with excluded minors,
  with Robin Thomas.
  European Journal of Combinatorics 75 (2019), 1-10.
• A post-quantum digital signature scheme based on supersingular isogenies,
  with Reza Azarderakhsh, Amir Jalali, David Jao, and Vladimir Soukharev.
  Financial Cryptography and Data Security 2017.