The complexity of decomposing a graph into a matching and a bounded linear forest. - Agnijo Banerjee; João Pedro Marciano; Adva Mond; Jan Petr; Julien Portier (CoRR, 2023)

A lower bound for set-coloring Ramsey numbers. - Lucas Aragão; Maurício Collares Neto; João Pedro Marciano; Taísa Martins; Robert Morris 001 (Random Struct. Algorithms, 2024)

Degree conditions for Ramsey goodness of paths. - Lucas Aragão; João Pedro Marciano; Walner Mendonça (Eur. J. Comb., 2025)

The diameter of randomly twisted hypercubes. - Lucas Aragão; Maurício Collares Neto; Gabriel Dahia; João Pedro Marciano (Eur. J. Comb., 2025)