This list is in chronological order. Alternatively one can view it organized by subject.
*Authors in pure math papers are listed in alphabetical order by convention. See the Culture Statement from the American Mathematical Society.
Independent sets and colorings of K_{t,t,t}-free graphs, with Oliver Janzer and Abhishek Methuku. [arxiv]
Sharp online hardness for large balanced independent sets, with Eren C. Kızıldağ and Neeladri Maitra. [arxiv]
Toward Vu's conjecture, with Peter Bradshaw, Abhishek Methuku, and Michael C. Wigal. [arxiv]
Balanced colorings of Erdős-Rényi hypergraphs, with Yuzhou Wang. [arxiv]
Palette sparsification for graphs with sparse neighborhoods. [arxiv]
A simple algorithm for near-Vizing edge-coloring in near-linear time. [arxiv]
A linear-time algorithm for (1+ε)∆-edge-coloring, with Anton Bernshteyn. [arxiv]
Coloring locally sparse graphs, with James Anderson and Aiya Kuchukova. Electronic Journal of Combinatorics (to appear). [arxiv]
The low-degree hardness of finding large independent sets in sparse random hypergraphs, with Yuzhou Wang. SIAM Journal on Discrete Mathematics (to appear). [arxiv]
Bounds for the independence and chromatic numbers of locally sparse graphs. Annals of Combinatorics (2025). [arxiv | journal]
Fast algorithms for Vizing's theorem on bounded degree graphs, with Anton Bernshteyn. Journal of Combinatorial Theory, Series B (2025). [arxiv | journal]
Coloring graphs with forbidden almost bipartite subgraphs, with James Anderson and Anton Bernshteyn. Random Structures and Algorithms (2025). [arxiv | journal]
List colorings of k-partite k-graphs. Electronic Journal of Combinatorics (2025). [arxiv | journal]
Fast and simple (1+ε)∆-edge-coloring of dense graphs. Theoretical Computer Science (2025). [arxiv | journal]
Multigraph edge-coloring with local list sizes. Discrete Mathematics (2025). [arxiv | journal]
Detection of dense subhypergraphs by low-degree polynomials, with Cheng Mao and Alexander S. Wein; Random Structures and Algorithms (2025). [arxiv | journal]
Balanced independent sets and colorings of hypergraphs; Journal of Graph Theory (2025). [arxiv | journal]
Borel Vizing's theorem for graphs of subexponential growth, with Anton Bernshteyn; Proceedings of the AMS (2025). [arxiv | journal]
Edge-coloring algorithms for bounded degree multigraphs; SODA (2024). [arxiv | journal]
Sharp analysis of EM for learning mixtures of pairwise differences, with Cheng Mao and Ashwin Pananjady; COLT (2023). [arxiv | journal]
Coloring graphs with forbidden bipartite subgraphs, with James Anderson and Anton Bernshteyn; Combinatorics, Probability and Computing (2023). [arxiv | journal]