Carlos V. G. C. Lima

According to our database, Carlos V. G. C. Lima authored at least 20 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., October, 2023

The connected greedy coloring game.

Carlos V. G. C. Lima, Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio

Theor. Comput. Sci., 2023

The Conversion Set Problem on Graphs.

Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

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

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

CoRR, 2022

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

2021

On the proper orientation number of chordal graphs.

Júlio Araújo, Alexandre A. Cezar, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, Ana Silva

Theor. Comput. Sci., 2021

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

Dual Parameterization of Weighted Coloring.

Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva

Algorithmica, 2020

2019

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

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

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

Bipartizing with a Matching.

Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Proceedings of the Combinatorial Optimization and Applications, 2018

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

Decycling with a matching.

Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2017

Eliminating Odd Cycles by Removing a Matching.

Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter

CoRR, 2017

2015

On f-Reversible Processes on Graphs.

Mitre Costa Dourado, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter

Electron. Notes 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

Eur. J. Comb., 2015

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

Discret. Math., 2015

2013

b-chromatic index of graphs.

Carlos Vinícius G. C. Lima, Nicolas Almeida Martins, Leonardo Sampaio Rocha, Marcio Costa Santos, Ana Silva

Electron. Notes Discret. Math., 2013