Sancrey Rodrigues Alves

According to our database, Sancrey Rodrigues Alves authored at least 4 papers between 2016 and 2023.

Collaborative distances:

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

2023

Partitions and well-coveredness: The graph sandwich problem.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Discret. Math., 2023

2020

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2018

On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza

Theor. Comput. Sci., 2018

2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza

Proceedings of the Combinatorial Optimization and Applications, 2016