Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree. - Roberto Fernández; Aldo Procacci (Comb. Probab. Comput., 2008)

An Improvement of the Lovász Local Lemma via Cluster Expansion. - Rodrigo Bissacot; Roberto Fernández; Aldo Procacci; Benedetto Scoppola (Comb. Probab. Comput., 2011)

Improved bounds on coloring of graphs. - Sokol Ndreca; Aldo Procacci; Benedetto Scoppola (Eur. J. Comb., 2012)

Properly coloured copies and rainbow copies of large graphs with small maximum degree. - Julia Böttcher; Yoshiharu Kohayakawa; Aldo Procacci (Random Struct. Algorithms, 2012)

Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights. - Bill Jackson; Aldo Procacci; Alan D. Sokal (J. Comb. Theory B, 2013)

A-priori upper bounds for the set covering problem. - Giovanni Felici; Sokol Ndreca; Aldo Procacci; Benedetto Scoppola (Ann. Oper. Res., 2016)

Moser-Tardos resampling algorithm, entropy compression method and the subset gas. - Paula M. S. Fialho; Bernardo N. B. de Lima; Aldo Procacci (CoRR, 2020)

A new bound on the acyclic edge chromatic number. - Paula M. S. Fialho; Bernardo N. B. de Lima; Aldo Procacci (Discret. Math., 2020)

Entropy compression versus Lovász Local Lemma. - Rogério Gomes Alves; Aldo Procacci; Rémy Sanchis (Adv. Appl. Math., 2021)

A remark on the Whitney Broken Circuit Theorem. - Paula M. S. Fialho; Emanuel Juliano; Aldo Procacci (Comput. Appl. Math., 2025)