Research
Manuscripts
Covering triangular grids with multiplicity (with Alexander Clifton and Paul Horn). Submitted.
Published and Accepted
Generalized Tuza's conjecture for random hypergraphs (with David Galvin). SIAM Journal on Discrete Mathematics.
Eight-Partitioning Points in 3D, and Efficiently Too (with Boris Aronov, Indu Ramesh, Gianluca Tasinato, and Uli Wagner).
Proc. of the 40th Symposium on Computational Geometry (SoCG ’24).Partitioning axis-parallel lines in 3D (with Boris Aronov, Mark de Berg and Joachim Gudmundsson).
Computing in Geometry and Topology, 2.1(2023), 9:1-9:20.Improved bounds on a generalization of Tuza's conjecture (with Daniel McGinnis, Henry Simmons, Matt Sinnwell and Shira Zerbib).
Electronic Journal of Combinatorics, 29 (2022), article P4.14.Zarankiewicz's problem for semilinear hypergraphs (with Artem Chernikov, Sergei Starchenko, Terence Tao and Chieu-Minh Tran).
Forum of Mathematics, Sigma, Volume 9, 2021, e59.On the independent set sequence of a tree (with David Galvin).
Electronic Journal of Combinatorics, 28 (2021), article P3.23.An improved sum-product bound for quaternions (with Ben Lund).
SIAM Journal on Discrete Mathematics, 33.2 (2019), 1044–1060.On the number of ordinary lines determined by sets in complex space (with Zeev Dvir, Shubhangi Saraf and Charles Wolf).
Discrete & Computational Geometry (Special Issue) 61.4 (2019) 778–808.
Also in Proc. of the 33rd Symposium on Computational Geometry (SoCG ’17), 2017.Incidences with k-non-degenerate sets and their applications. (with Adam Sheffer).
Journal of Computational Geometry 5.1 (2014): 284-302.Hitting Simplices with Points in R3. (with Nabil H. Mustafa, Saurabh Ray and Sarfraz Raza).
Discrete and Computational Geometry, 44.3 (2010): 637-644.
Also in Proc. of the 26th Symposium on Computational Geometry (SoCG ’10), 2010.Centerpoints and Tverberg’s Technique. (with Nabil H. Mustafa, Saurabh Ray and Sarfraz Raza).
Computational Geometry, 43.6 (2010): 593-600.