Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. - Josefran de Oliveira Bastos; Leonardo Nagami Coregliano (Discret. Math. Theor. Comput. Sci., 2016)

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2016)

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (Electron. Notes Discret. Math., 2017)

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. - Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg (SIAM J. Discret. Math., 2017)

Counting Gallai 3-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Guilherme Oliveira Mota; Ignasi Sau (Discret. Math., 2019)

The number of Gallai k-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Jie Han 002 (J. Comb. Theory B, 2020)

Maximum number of r-edge-colorings such that all copies of Kk are rainbow. - Josefran de Oliveira Bastos; Hanno Lefmann; Andy Oertel; Carlos Hoppen; Dionatan Ricardo Schmidt (LAGOS, 2021)

Optimal SIC Decoding Order and WPT Time Length for WPCN With Imperfect SIC. - Francisco Rafael Marques Lima; Josefran de Oliveira Bastos; Jhenifer de O. Melo (IEEE Wirel. Commun. Lett., 2021)

Graphs with many edge-colorings such that complete graphs are rainbow. - Josefran de Oliveira Bastos; Carlos Hoppen; Hanno Lefmann; Andy Oertel; Dionatan Ricardo Schmidt (Discret. Appl. Math., 2023)