Ferrarini L., Mazzuoccolo G., Mkrtchyan V.V., Normal 5-edge-colorings of a family of Loupekhine snarks. AKCE International Journal of Graphs and Combinatorics 17(3),(2020), 720–724.
Ferrarini L., Gualandi S., Total Coloring and Total Matching: Polyhedra and Facets. European Journal of Operational Research (2022), 303(1), 129-142 https://doi.org/10.1016/j.ejor.2022.02.025.
Auricchio G.,Ferrarini L., Lanzarotto G., An Integer Linear Programming Model for Tilings. Journal of Mathematics and Music (2023), 17(3),514–530, https://doi.org/10.1080/17459737.2023.2180812.
Auricchio G., Ferrarini L., Gualandi S., Lanzarotto G., Pernazza L. A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2022. Lecture Notes in Computer Science, vol 13292. Springer,
Cham. https://doi.org/10.1007/978-3-031-08011-1_2.
Faenza Y., Ferrarini L., The Total Matching Polytope of Complete Bipartite Graphs. Preprint available at https://arxiv.org/pdf/2303.00328v1.pdf, Accepted to Operations Research Letters.
Ferrarini L., Fiorini S., Kober S., Yuditsky Y., The Total Matching and Subdeterminants. In: Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594. Springer, Cham. https://doi.org/10.1007/978-3-031-60924-4_15.
Auricchio G.,Ferrarini L., Gualandi S., Lanzarotto G., Pernazza L. "Computing aperiodictiling rhymtics canons via SAT models". Constraints Constraints 29, 215–233 (2024). https://doi.org/10.1007/s10601-024-09375-6.
Ferrarini L., Gualandi S., Moro L., Parmentier A. Accepted for CPAIOR 2025 "Learning Primal Heuristics for 0–1 Knapsack Interdiction Problems."
Ongoing project:
Bouvier L., Ferrarini L., Leclere V., Parmentier A., Contextual Stochastic Optimization using Mirror Progressive Hedging
Aprile M., Ferrarini L., A polyhedral approach to the Strong Total Covering