Lurbio Faria
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
22
Venues
8
Active years
1998–2025
Best venue rank
A*
Where they publish
Papers
22 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | LAGOS | The oriented chromatic number of a wheel and of the disjoint union of a wheel with a complete graph. | Erika M. M. Coelho, Hebert Coelho, Lurbio Faria, Mateus de Paula Ferreira, Sulamita Klein |
| 2025 | LAGOS | Strong conformable coloring: the conformable coloring for Type 1 graphs. | Lurbio Faria, Mauro Nigro, Diana Sasaki |
| 2025 | LAGOS | On musical arrangement problems time complexity. | N. Figueiredo, Lurbio Faria, Vincius Fernandes dos Santos, Uverton S. Souza |
| 2023 | LAGOS | On the absolute and relative oriented clique problems' time complexity. | Erika Morais Martins Coelho, Hebert Coelho da Coelho, Lurbio Faria, Mateus de Paula Ferreira, Sulamita Klein |
| 2021 | COCOON | On the Probe Problem for (r, ℓ )-Well-Coveredness. | Lurbio Faria, Uverton S. Souza |
| 2021 | IWOCA | On the Oriented Coloring of the Disjoint Union of Graphs. | Erika Morais Martins Coelho, Hebert Coelho, Lurbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein |
| 2021 | LAGOS | On feedback vertex set in reducible flow hypergraphs. | Lurbio Faria, Andr Luiz Pires Guedes, Lilian Markenzon |
| 2020 | LATIN | Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. | Sancrey Rodrigues Alves, Fernanda Couto, Lurbio Faria, Sylvain Gravier, Sulamita Klein, Uverton S. Souza |
| 2016 | COCOA | On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. | Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Lurbio Faria, Sulamita Klein, Ignasi Sau, Uverton dos Santos Souza |
| 2015 | WG | On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. | Fernanda Couto, Lurbio Faria, Sylvain Gravier, Sulamita Klein, Vincius Fernandes dos Santos |
| 2013 | AAIM | On ( | Fernanda Couto, Lurbio Faria, Sulamita Klein, Fbio Protti, Loana Tito Nogueira |
| 2013 | AAIM | The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. | Carlos A. J. Martinhon, Lurbio Faria |
| 2013 | COCOA | On Complexities of Minus Domination. | Lurbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang |
| 2013 | WG | The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. | Lurbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto |
| 2011 | WG | Split Clique Graph Complexity. | Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
| 2008 | LATIN | Paths and Trails in Edge-Colored Graphs. | Abdelfattah Abouelaoualim, Kinkar Chandra Das, Lurbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad |
| 2006 | WG | Clique Graph Recognition Is NP-Complete. | Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
| 2003 | WG | An Improved Upper Bound on the Crossing Number of the Hypercube. | Lurbio Faria, Celina M. H. de Figueiredo, Ondrej Skora, Imrich Vrto |
| 2002 | WG | On the Complexity of (k, l)-Graph Sandwich Problems. | Simone Dantas, Celina M. H. de Figueiredo, Lurbio Faria |
| 1999 | SODA | Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. | Celina M. H. de Figueiredo, Lurbio Faria, Candido Ferreira Xavier de Mendona Neto |
| 1998 | LATIN | The Splitting Number of the 4-Cube. | Lurbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendona Neto |
| 1998 | WG | Splitting Number is NP-complete | Lurbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendona Neto |