Coloring 2-Intersecting Hypergraphs. - Lucas Colucci; András Gyárfás (Electron. J. Comb., 2013)

Evaluating Item-Item Similarity Algorithms for Movies. - Lucas Colucci; Prachi Doshi; Kun-Lin Lee; Jiajie Liang; Yin Lin; Ishan Vashishtha; Jia Zhang 001; Alvin Jude (CHI Extended Abstracts, 2016)

Predicting the Unpredictable: Using Monte Carlo Simulation to Predict Project Completion Date. - Lucas Colucci; Raphael Albino (WBMA, 2016)

Terminal-pairability in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Discret. Appl. Math., 2018)

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Theor. Comput. Sci., 2019)

Edge colorings of graphs without monochromatic stars. - Lucas Colucci; Ervin Györi; Abhishek Methuku (Discret. Math., 2020)

On the Zero-Sum Ramsey Problem over $ mathbb {Z}_2^d$. - José D. Alvarado; Lucas Colucci; Roberto Parente; Victor Souza (LATIN, 2022)

On L(2, 1)-labelings of oriented graphs. - Lucas Colucci; Ervin Györi (Discuss. Math. Graph Theory, 2022)

On L(2, 1)-labelings of some products of oriented cycles. - Lucas Colucci; Ervin Györi (Math. Found. Comput., 2022)

The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. - Fábio Botler; Lucas Colucci; Yoshiharu Kohayakawa (J. Graph Theory, 2023)

The mod k $k$ chromatic index of random graphs. - Fábio Botler; Lucas Colucci; Yoshiharu Kohayakawa (J. Graph Theory, 2023)

On Modular Edge Colourings of Graphs. - Gaétan Berthe; Marthe Bonamy; Fábio Botler; Gaia Carenini; Lucas Colucci; Arthur Dumas; Fatemeh Ghasemi; Pedro Mariano Viana Neto (CoRR, 2025)