On Abelian and Additive Complexity in Infinite Words. - Hayri Ardal; Tom C. Brown; Veselin Jungic; Julian Sahasrabudhe (Integers, 2012)

Permutations Destroying Arithmetic Structure. - Veselin Jungic; Julian Sahasrabudhe (Electron. J. Comb., 2015)

Sturmian Words and Constant Additive Complexity. - Julian Sahasrabudhe (Integers, 2015)

The multiplication table problem for bipartite graphs. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2017)

On the Maximum Running Time in Graph Bootstrap Percolation. - Béla Bollobás; Michal Przykucki; Oliver Riordan; Julian Sahasrabudhe (Electron. J. Comb., 2017)

A stability theorem for maximal Kr+1-free graphs. - Kamil Popielarz; Julian Sahasrabudhe; Richard Snyder (J. Comb. Theory B, 2018)

Monochromatic solutions to systems of exponential equations. - Julian Sahasrabudhe (J. Comb. Theory A, 2018)

Ramsey Graphs Induce Subgraphs of Many Different Sizes. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2019)

Dense subgraphs in random graphs. - Paul Balister; Béla Bollobás; Julian Sahasrabudhe; Alexander Veremyev (Discret. Appl. Math., 2019)

Partitioning a graph into monochromatic connected subgraphs. - António Girão; Shoham Letzter; Julian Sahasrabudhe (J. Graph Theory, 2019)