A note on the minimum number of edges in hypergraphs with property O. - Gal Kronenberg; Christopher Kusch; Ander Lamaison; Piotr Micek; Tuan Tran (Eur. J. Comb., 2019)

Finding Unavoidable Colorful Patterns in Multicolored Graphs. - Matt Bowen; Ander Lamaison; Alp Müyesser (Electron. J. Comb., 2020)

Majority Colorings of Sparse Digraphs. - Michael Anastos; Ander Lamaison; Raphael Steiner; Tibor Szabó (Electron. J. Comb., 2021)

Coloring graphs by translates in the circle. - Pablo Candela; Carlos Catalá; Robert Hancock 002; Adam Kabela; Daniel Král'; Ander Lamaison; Lluís Vena (Eur. J. Comb., 2021)

On a colored Turán problem of Diwan and Mubayi. - Ander Lamaison; Alp Müyesser; Michael Tait (Discret. Math., 2022)

Quasirandom Latin squares. - Jacob W. Cooper; Daniel Král'; Ander Lamaison; Samuel Mohr (Random Struct. Algorithms, 2022)

Closure property of contraction-depth of matroids. - Marcin Brianski; Daniel Král; Ander Lamaison (CoRR, 2023)

Ramsey upper density of infinite graphs. - Ander Lamaison (Comb. Probab. Comput., 2023)

Planar graph with twin-width seven. - Daniel Král'; Ander Lamaison (Eur. J. Comb., 2025)

The Dimension of the Region of Feasible Tournament Profiles. - Daniel Král'; Ander Lamaison; Magdalena Prorok; Xichao Shu (SIAM J. Discret. Math., 2025)