b-chromatic index of graphs. - Carlos Vinícius G. C. Lima; Nicolas Almeida Martins; Leonardo Sampaio Rocha; Marcio Costa Santos; Ana Silva 001 (Electron. Notes Discret. Math., 2013)

The b-chromatic index of graphs. - Victor A. Campos; Carlos Vinícius G. C. Lima; Nicolas Almeida Martins; Leonardo Sampaio Rocha; Marcio Costa Santos; Ana Silva 001 (Discret. Math., 2015)

Graphs of girth at least 7 have high b-chromatic number. - Victor A. Campos; Carlos Vinícius G. C. Lima; Ana Silva 001 (Eur. J. Comb., 2015)

On f-Reversible Processes on Graphs. - Mitre Costa Dourado; Carlos Vinícius G. C. Lima; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2015)

Eliminating Odd Cycles by Removing a Matching. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (CoRR, 2017)

Decycling with a matching. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2017)

Generalized threshold processes on graphs. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2017)

Complexity and algorithms related to two classes of graph problems - Carlos V. G. C. Lima (2017)

Bipartizing with a Matching. - Carlos V. G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (COCOA, 2018)

And/or-convexity: a graph convexity based on processes and deadlock models. - Carlos Vinícius G. C. Lima; Fábio Protti; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2018)

A computational study of f-reversible processes on graphs. - Carlos Vinícius G. C. Lima; Leonardo I. L. Oliveira; Valmir C. Barbosa; Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

Parameterized Complexity of Equitable Coloring. - Guilherme de C. M. Gomes; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos (Discret. Math. Theor. Comput. Sci., 2019)

Dual Parameterization of Weighted Coloring. - Júlio Araújo 001; Victor A. Campos; Carlos Vinícius G. C. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Ana Silva 001 (Algorithmica, 2020)

Intersection graph of maximal stars. - Guilherme de C. M. Gomes; Marina Groshaus; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos (Discret. Appl. Math., 2020)

On the proper orientation number of chordal graphs. - Júlio Araújo 001; Alexandre A. Cezar; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos; Ana Silva 001 (Theor. Comput. Sci., 2021)

On the computational complexity of the bipartizing matching problem. - Carlos V. G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2022)

PSPACE-hardness of variants of the graph coloring game. - Carlos V. G. C. Lima; Thiago Marcilon; Nicolas Almeida Martins; Rudini M. Sampaio (Theor. Comput. Sci., 2022)

The Conversion Set Problem on Graphs. - Isac Costa; Carlos V. G. C. Lima; Thiago Marcilon (LAGOS, 2023)

The connected greedy coloring game. - Carlos V. G. C. Lima; Thiago Marcilon; Nicolas Almeida Martins; Rudini Menezes Sampaio (Theor. Comput. Sci., 2023)

Target set selection with maximum activation time. - Lucas Keiler; Carlos Vinícius G. C. Lima; Ana Karolinna Maia; Rudini M. Sampaio; Ignasi Sau (Discret. Appl. Math., 2023)

The complexity of convexity number and percolation time in the cycle convexity. - Carlos V. G. C. Lima; Thiago Marcilon; Pedro Paulo de Medeiros (CoRR, 2024)

On the computational complexity of the strong geodetic recognition problem. - Carlos V. G. C. Lima; Vinícius Fernandes dos Santos; João H. G. Sousa; Sebastián Alberto Urrutia (RAIRO Oper. Res., 2024)