Leonardo Nagami Coregliano

Orcid: 0000-0001-7189-8565

According to our database1, Leonardo Nagami Coregliano authored at least 12 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Left-Cut-Percolation and Induced-Sidorenko Bigraphs.
SIAM J. Discret. Math., 2024

High-arity PAC learning via exchangeability.
CoRR, 2024

2023
Natural quasirandomness properties.
Random Struct. Algorithms, October, 2023

Exact Completeness of LP Hierarchies for Linear Codes.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
On the abstract chromatic number and its computability for finitely axiomatizable theories.
J. Comb. Theory B, 2022

Tighter bounds on the independence number of the Birkhoff graph.
Eur. J. Comb., 2022

A Complete Linear Programming Hierarchy for Linear Codes.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2019
Semantic Limits of Dense Combinatorial Objects.
CoRR, 2019

On the Maximum Density of Fixed Strongly Connected Subtournaments.
Electron. J. Comb., 2019

2018
Quasi-carousel tournaments.
J. Graph Theory, 2018

2017
On the Density of Transitive Tournaments.
J. Graph Theory, 2017

2016
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations.
Discret. Math. Theor. Comput. Sci., 2016


  Loading...