A New Algorithm for the Robust Semi-random Independent Set Problem. - Theo McKenzie; Hermish Mehta; Luca Trevisan 001 (SODA, 2020)

Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs. - Theo McKenzie; Peter M. R. Rasmussen; Nikhil Srivastava (CoRR, 2020)

High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion. - Theo McKenzie; Sidhanth Mohanty (ICALP, 2021)

Support of closed walks and second eigenvalue multiplicity of graphs. - Theo McKenzie; Peter Michael Reichstein Rasmussen; Nikhil Srivastava (STOC, 2021)

Many nodal domains in random regular graphs. - Shirshendu Ganguly; Theo McKenzie; Sidhanth Mohanty; Nikhil Srivastava (CoRR, 2021)

Explicit Two-Sided Unique-Neighbor Expanders. - Jun-Ting Hsieh; Theo McKenzie; Sidhanth Mohanty; Pedro Paredes 002 (STOC, 2024)

The Spectral Edge of Constant Degree Erdős-Rényi Graphs. - Ella Hiesmayr; Theo McKenzie (Random Struct. Algorithms, 2025)