Hélio B. Macêdo Filho

According to our database, Hélio B. Macêdo Filho authored at least 7 papers between 2012 and 2018.

Collaborative distances:

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

2018

Using SPQR-trees to speed up recognition algorithms based on 2-cutsets.

Hélio B. Macêdo Filho, Celina M. H. de Figueiredo, Z. Li, Raphael Machado

Discret. Appl. Math., 2018

2017

Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.

Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo

Algorithmica, 2017

2016

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.

Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo

Theor. Comput. Sci., 2016

2015

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions.

Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Z. Li, Raphael Carlos Santos Machado, Nicolas Trotignon

Electron. Notes Discret. Math., 2015

Biclique-colouring verification complexity and biclique-colouring power graphs.

Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo

Discret. Appl. Math., 2015

2012

Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.

Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Biclique-colouring - Powers of Paths and Powers of Cycles.

Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012