( en | de | ru )

 

Disambiguation of "Faria, Luérbio"

Author of the publication

copydeleteadd this publication to your clipboard
2K2 vertex-set partition into nonempty parts.

, , , , , and . Discret. Math., 310 (6-7): 1259-1264 (2010)

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

Matthias Farian

Víctor Farías

 

Other publications of authors with the same name

Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters., , and . SODA, page 887-888. ACM/SIAM, (1999)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)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)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)On the (parameterized) complexity of recognizing well-covered (r, l)-graphs., , , , , and . CoRR, (2017)On the Complexity of (k, l)-Graph Sandwich Problems., , and . WG, volume 2573 of Lecture Notes in Computer Science, page 92-101. Springer, (2002)The Splitting Number of the 4-Cube., , and . LATIN, volume 1380 of Lecture Notes in Computer Science, page 141-150. Springer, (1998)On the forbidden induced subgraph probe and sandwich problems., , , and . Discret. Appl. Math., (2018)