Bounding Sequence Extremal Functions with Formations. - Jesse Geneson; Rohil Prasad; Jonathan Tidor (Electron. J. Comb., 2014)

Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs. - Jesse Geneson; Tanya Khovanova; Jonathan Tidor (Discret. Math., 2014)

Dense binary PG(t - 1, 2)-free matroids have critical number t - 1 or t. - Jonathan Tidor (J. Comb. Theory B, 2017)

Spectral methods for testing cluster structure of graphs. - Sandeep Silwal; Jonathan Tidor (CoRR, 2018)

Induced arithmetic removal: complexity 1 patterns over finite fields. - Jacob Fox; Jonathan Tidor; Yufei Zhao (CoRR, 2019)

Algorithms and Lower Bounds for the Worker-Task Assignment Problem. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (CoRR, 2020)

A counterexample to the Bollobás-Riordan conjectures on sparse graph limits. - Ashwin Sah; Mehtaab Sawhney; Jonathan Tidor; Yufei Zhao (Comb. Probab. Comput., 2021)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (ICALP, 2022)

Testing Linear-Invariant Properties. - Jonathan Tidor; Yufei Zhao (SIAM J. Comput., 2022)

Cubic Goldreich-Levin. - Dain Kim; Anqi Li; Jonathan Tidor (SODA, 2023)

Spherical Two-Distance Sets and Eigenvalues of Signed Graphs. - Zilin Jiang; Jonathan Tidor; Yuan Yao; Shengtong Zhang; Yufei Zhao (Comb., 2023)