A Point in Many Triangles. - Boris Bukh (Electron. J. Comb., 2006)

Maximum pebbling number of graphs of diameter three. - Boris Bukh (J. Graph Theory, 2006)

Measurable sets with excluded distances. - Boris Bukh (Electron. Notes Discret. Math., 2007)

Induced subgraphs of Ramsey graphs with many distinct degrees. - Boris Bukh; Benny Sudakov (J. Comb. Theory B, 2007)

Sums of Dilates. - Boris Bukh (Comb. Probab. Comput., 2008)

Lower bounds for weak epsilon-nets and stair-convexity. - Boris Bukh; Jirí Matousek 001; Gabriel Nivasch (SCG, 2009)

Set Families with a Forbidden Subposet. - Boris Bukh (Electron. J. Comb., 2009)

Radon partitions in convexity spaces - Boris Bukh (CoRR, 2010)

Stabbing Simplices by Points and Flats. - Boris Bukh; Jirí Matousek 001; Gabriel Nivasch (Discret. Comput. Geom., 2010)

Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions. - Pavle V. M. Blagojevic; Boris Bukh; Roman N. Karasev (Electron. Notes Discret. Math., 2011)

Space Crossing Numbers. - Boris Bukh; Alfredo Hubard (Comb. Probab. Comput., 2012)

Upper bounds for centerlines. - Boris Bukh; Gabriel Nivasch (J. Comput. Geom., 2012)

Multidimensional Kruskal-Katona Theorem. - Boris Bukh (SIAM J. Discret. Math., 2012)

Longest Common Subsequences in Sets of Words. - Boris Bukh; Jie Ma (SIAM J. Discret. Math., 2014)

An improved bound on the fraction of correctable deletions. - Boris Bukh; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2015)

One-sided epsilon-approximants. - Boris Bukh; Gabriel Nivasch (CoRR, 2016)

An Improvement of the Beck-Fiala Theorem. - Boris Bukh (Comb. Probab. Comput., 2016)

Bounds on Equiangular Lines and on Related Spherical Codes. - Boris Bukh (SIAM J. Discret. Math., 2016)

A Bound on the Number of Edges in Graphs Without an Even Cycle. - Boris Bukh; Zilin Jiang (Comb. Probab. Comput., 2017)

Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'. - Boris Bukh; Zilin Jiang (Comb. Probab. Comput., 2017)

Classifying unavoidable Tverberg partitions. - Boris Bukh; Po-Shen Loh; Gabriel Nivasch (J. Comput. Geom., 2017)

An Improved Bound on the Fraction of Correctable Deletions. - Boris Bukh; Venkatesan Guruswami; Johan Håstad (IEEE Trans. Inf. Theory, 2017)

Consistent Sets of Lines with no Colorful Incidence. - Boris Bukh; Xavier Goaoc; Alfredo Hubard; Matthew Trager (SoCG, 2018)

Nearly orthogonal vectors and small antipodal spherical codes. - Boris Bukh; Christopher Cox (CoRR, 2018)

Bipartite algebraic graphs without quadrilaterals. - Boris Bukh; Zilin Jiang (Discret. Math., 2018)

Shatter Functions with Polynomial Growth Rates. - Boris Bukh; Xavier Goaoc (SIAM J. Discret. Math., 2019)

List-Decodable Zero-Rate Codes. - Noga Alon; Boris Bukh; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2019)

On a Fractional Version of Haemers' Bound. - Boris Bukh; Christopher Cox (IEEE Trans. Inf. Theory, 2019)

Empty axis-parallel boxes. - Boris Bukh; Ting-Wei Chao (CoRR, 2020)

Turán numbers of theta graphs. - Boris Bukh; Michael Tait (Comb. Probab. Comput., 2020)

Length of the Longest Common Subsequence between Overlapping Words. - Boris Bukh; Raymond Hogenson (SIAM J. Discret. Math., 2020)

Order-Isomorphic Twins in Permutations. - Boris Bukh; Oleksandr Rudenko (SIAM J. Discret. Math., 2020)

Applications of Random Algebraic Constructions to Hardness of Approximation. - Boris Bukh; Karthik C. S. 001; Bhargav Narayanan (Electron. Colloquium Comput. Complex., 2021)

Digital Almost Nets. - Boris Bukh; Ting-Wei Chao (Electron. J. Comb., 2022)

On convex holes in d-dimensional point sets. - Boris Bukh; Ting-Wei Chao; Ron Holzman (Comb. Probab. Comput., 2022)

Planar Convex Codes are Decidable. - Boris Bukh; R. Amzi Jeffs (SIAM J. Discret. Math., 2023)

New Bounds for the Same-Type Lemma. - Boris Bukh; Alexey Vasileuski (Electron. J. Comb., 2024)

Colouring random subgraphs. - Boris Bukh; Michael Krivelevich; Bhargav Narayanan (Comb. Probab. Comput., 2025)

Distances between Realizations of Order Types. - Boris Bukh; R. Amzi Jeffs (SIAM J. Discret. Math., 2025)