Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. - Josefran de Oliveira Bastos; Leonardo Nagami Coregliano (Discret. Math. Theor. Comput. Sci., 2016)

On the Density of Transitive Tournaments. - Leonardo Nagami Coregliano; Alexander A. Razborov (J. Graph Theory, 2017)

Quasi-carousel tournaments. - Leonardo Nagami Coregliano (J. Graph Theory, 2018)

On the Maximum Density of Fixed Strongly Connected Subtournaments. - Leonardo Nagami Coregliano; Roberto F. Parente; Cristiane M. Sato (Electron. J. Comb., 2019)

Semantic Limits of Dense Combinatorial Objects. - Leonardo Nagami Coregliano; Alexander A. Razborov (CoRR, 2019)

A Complete Linear Programming Hierarchy for Linear Codes. - Leonardo Nagami Coregliano; Fernando Granha Jeronimo; Chris Jones (ITCS, 2022)

Tighter bounds on the independence number of the Birkhoff graph. - Leonardo Nagami Coregliano; Fernando Granha Jeronimo (Eur. J. Comb., 2022)

On the abstract chromatic number and its computability for finitely axiomatizable theories. - Leonardo Nagami Coregliano (J. Comb. Theory B, 2022)

Exact Completeness of LP Hierarchies for Linear Codes. - Leonardo Nagami Coregliano; Fernando Granha Jeronimo; Chris Jones (ITCS, 2023)

Natural quasirandomness properties. - Leonardo Nagami Coregliano; Alexander A. Razborov (Random Struct. Algorithms, 2023)

High-arity PAC learning via exchangeability. - Leonardo Nagami Coregliano; Maryanthe Malliaris (CoRR, 2024)

Left-Cut-Percolation and Induced-Sidorenko Bigraphs. - Leonardo Nagami Coregliano (SIAM J. Discret. Math., 2024)

How to Get the Random Graph with Non-Uniform Probabilities? - Leonardo Nagami Coregliano; Jaroslaw Swaczyna; Agnieszka Widz (Electron. J. Comb., 2025)

Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness. - Leonardo Nagami Coregliano; Fernando Granha Jeronimo; Chris Jones; Nati Linial; Elyassaf Loyfer (CoRR, 2025)

Weak Randomness in Graphons and Theons. - Leonardo Nagami Coregliano; Maryanthe Malliaris (Random Struct. Algorithms, 2025)

A packing lemma for VCNk-dimension and learning high-dimensional data. - Leonardo Nagami Coregliano; Maryanthe Malliaris (CoRR, 2025)