Paulo Renato da Costa Pereira

According to our database, Paulo Renato da Costa Pereira authored at least 7 papers between 2005 and 2014.

Collaborative distances:

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

2014

Generating and counting unlabeled k-path graphs.

Paulo Renato da Costa Pereira, Alex Garcia, Lilian Markenzon

Discret. Appl. Math., 2014

2013

An efficient representation of chordal graphs.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Paulo Renato da Costa Pereira, Clícia Valladares Peixoto Friedmann, Abel Rodolfo Garcia Lozano

Oper. Res. Lett., 2013

<i>k</i>-separator chordal graphs: leafage and subfamilies.

Lilian Markenzon, Paulo Renato da Costa Pereira, Christina Fraga Esteves Maciel Waga

Int. Trans. Oper. Res., 2013

2010

One-phase algorithm for the determination of minimal vertex separators of chordal graphs.

Lilian Markenzon, Paulo Renato da Costa Pereira

Int. Trans. Oper. Res., 2010

2008

A clique-difference encoding scheme for labelled k-path graphs.

Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet

Discret. Appl. Math., 2008

A Compact Representation for Chordal Graphs.

Lilian Markenzon, Paulo Renato da Costa Pereira

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2005

The Reduced Prüfer Code for Rooted Labelled k-Trees.

Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet

Electron. Notes Discret. Math., 2005