( en | de | ru )

 

Disambiguation of "Sampaio, Rudini Menezes"

Author of the publication

copydeleteadd this publication to your clipboard
Graphs with few P4's under the convexity of paths of order three.

, , , and . Discret. Appl. Math., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Leonardo Sampaio

Erica Sampaio

Augusto Sampaio

Augusto Sampaio

Flo Menezes

 

Other publications of authors with the same name

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects., , , , and . Eur. J. Comb., (2015)Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings, , , , and . CoRR, (2011)Property Testing and Parameter Testing for Permutations., , , and . SODA, page 66-75. SIAM, (2010)Graphs with Few P4's Under the Convexity of Paths of Order Three., , , and . CTW, page 60-63. (2012)PSPACE-hardness of Two Graph Coloring Games., , , and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 333-344. Elsevier, (2019)Limits of permutation sequences.. University of São Paulo, Brazil, (2008)ndltd.org (oai:agregador.ibict.br.BDTD_USP:oai:teses.usp.br:tde-08122008-163417).The maximum time of 2-neighbor bootstrap percolation: Complexity results., and . Theor. Comput. Sci., (2018)Backbone colouring: Tree backbones with small diameter in planar graphs., , , and . Theor. Comput. Sci., (2013)Target set selection with maximum activation time., , , , and . LAGOS, volume 195 of Procedia Computer Science, page 86-96. Elsevier, (2021)On the complexity of finding even pairs in planar perfect graphs., and . Electron. Notes Discret. Math., (2001)