( en | de | ru )

 

Disambiguation of "Faria, Luérbio"

Author of the publication

copydeleteadd this publication to your clipboard
SPLITTING NUMBER is NP-complete.

, , and . Discret. Appl. Math., 108 (1-2): 65-83 (2001)

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.

Alexander Faria e Castro

Alexander Faria e Castro

Sergio Faria

Víctor Farías

Matthias Farian

 

Other publications of authors with the same name

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs., , , , and . Electron. Notes Discret. Math., (2015)The generalized split probe problem., , , and . Electron. Notes Discret. Math., (2013)SPLITTING NUMBER is NP-complete., , and . Discret. Appl. Math., 108 (1-2): 65-83 (2001)On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs., , , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 312-324. Springer, (2015)Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters., , and . SODA, page 887-888. ACM/SIAM, (1999)Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques., , , , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 587-599. Springer, (2020)The splitting number and skewness of Cn x Cm., , , , , and . Ars Comb., (2002)Recognition of Reducible Flow Hypergraphs., , and . CTW, page 229-232. (2009)Forbidden subgraphs and the Kőnig property., , , , and . Electron. Notes Discret. Math., (2011)An oriented 8-coloring for acyclic oriented graphs with maximum degree 3., , , and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 55-58. (2013)