Optimal Mapping of Neighbourhood-Constrained Systems. - Felipe M. G. França; Luérbio Faria (IRREGULAR, 1995)

The Splitting Number of the 4-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (LATIN, 1998)

Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. - Celina M. H. de Figueiredo; Luérbio Faria; Candido Ferreira Xavier de Mendonça Neto (SODA, 1999)

SPLITTING NUMBER is NP-complete. - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (Discret. Appl. Math., 2001)

On the Complexity of (k, l)-Graph Sandwich Problems. - Simone Dantas; Celina M. H. de Figueiredo; Luérbio Faria (WG, 2002)

The splitting number and skewness of Cn x Cm. - Candido Ferreira Xavier de Mendonça Neto; Karl Schaffer; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2002)

On decision and optimization (k, l)-graph sandwich problems. - Simone Dantas; Celina M. H. de Figueiredo; Luérbio Faria (Discret. Appl. Math., 2004)

On the complexity of the approximation of nonplanarity parameters for cubic graphs. - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (Discret. Appl. Math., 2004)

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (Electron. Notes Discret. Math., 2004)

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. - Luérbio Faria; Celina M. H. de Figueiredo; Sylvain Gravier; Candido F. X. Mendonça; Jorge Stolfi (Electron. Notes Discret. Math., 2004)

The non planar vertex deletion of Cn x Cm. - Candido Ferreira Xavier de Mendonça Neto; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2005)

2K2-Partition Problem. - C. N. Campos; Simone Dantas; Luérbio Faria; Sylvain Gravier (Electron. Notes Discret. Math., 2005)

Clique Graph Recognition Is NP-Complete. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (WG, 2006)

On maximum planar induced subgraphs. - Luérbio Faria; Celina M. H. de Figueiredo; Sylvain Gravier; Candido Ferreira Xavier de Mendonça Neto; Jorge Stolfi (Discret. Appl. Math., 2006)

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. - Celina M. H. de Figueiredo; Luérbio Faria; Sulamita Klein; R. Sritharan (Theor. Comput. Sci., 2007)

On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. - Rodrigo de A. Hausen; Luérbio Faria; Celina M. H. de Figueiredo; Luis Antonio Brasil Kowada (BSB, 2008)

Partition into cliques for cubic graphs: Planar case, complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Carlos A. J. Martinhon; Fábio Protti; Bruce A. Reed (Discret. Appl. Math., 2008)

2K2 vertex-set partition into nonempty parts. - Simone Dantas; Elaine M. Eschen; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein (Electron. Notes Discret. Math., 2008)

An improved upper bound on the crossing number of the hypercube. - Luérbio Faria; Celina M. H. de Figueiredo; Ondrej Sýkora; Imrich Vrto (J. Graph Theory, 2008)

Paths and trails in edge-colored graphs. - Abdelfattah Abouelaoualim; Kinkar Chandra Das; Luérbio Faria; Yannis Manoussakis; Carlos A. J. Martinhon; Rachid Saad (Theor. Comput. Sci., 2008)

Recognition of Reducible Flow Hypergraphs. - André Luiz Pires Guedes; Lilian Markenzon; Luérbio Faria (CTW, 2009)

Skewness, splitting number and vertex deletion of some toroidal meshes. - Candido Ferreira Xavier de Mendonça Neto; Ademir Aparecido Constantino; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2009)

The complexity of clique graph recognition. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (Theor. Comput. Sci., 2009)

Advances on the List Stubborn Problem. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CATS, 2010)

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (Discret. Appl. Math., 2010)

2K2 vertex-set partition into nonempty parts. - Kathryn Cook; Simone Dantas; Elaine M. Eschen; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein (Discret. Math., 2010)

Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. - Rodrigo de A. Hausen; Luérbio Faria; Celina M. H. de Figueiredo; Luis Antonio Brasil Kowada (SIAM J. Discret. Math., 2010)

Flow hypergraph reducibility. - André Luiz Pires Guedes; Lilian Markenzon; Luérbio Faria (Discret. Appl. Math., 2011)

Hamiltonian Cycles in Kneser Graphs for n=2k+2. - Letícia Rodrigues Bueno; Celina M. H. de Figueiredo; Luérbio Faria; Candido F. X. Mendonça; Rodrigo de A. Hausen (Electron. Notes Discret. Math., 2011)

Forbidden subgraphs and the Kőnig property. - Mitre Costa Dourado; Guillermo Durán; Luérbio Faria; Luciano N. Grippo; Martín Darío Safe (Electron. Notes Discret. Math., 2011)

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (RAIRO Theor. Informatics Appl., 2011)

On the Oriented Chromatic Number of Union of Graphs. - Hebert Coelho; Luérbio Faria; Sylvain Gravier; Sulamita Klein (CTW, 2012)

Odd Cycle Transversals and Independent Sets in Fullerene Graphs. - Luérbio Faria; Sulamita Klein; Matej Stehlík (SIAM J. Discret. Math., 2012)

On (k, ℓ)-Graph Sandwich Problems. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Fábio Protti; Loana Tito Nogueira (FAW-AAIM, 2013)

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. - Carlos A. J. Martinhon; Luérbio Faria (FAW-AAIM, 2013)

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. - Hebert Coelho; Luérbio Faria; Sylvain Gravier; Sulamita Klein (CTW, 2013)

On specifying boundary conditions for the graph sandwich problem. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CTW, 2013)

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; R. Bruce Richter; Imrich Vrto (WG, 2013)

Forbidden subgraphs and the König-Egerváry property. - Flavia Bonomo; Mitre Costa Dourado; Guillermo Durán; Luérbio Faria; Luciano N. Grippo; Martín Darío Safe (Discret. Appl. Math., 2013)

The generalized split probe problem. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Electron. Notes Discret. Math., 2013)

Split clique graph complexity. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (Theor. Comput. Sci., 2013)

On defensive alliances and strong global offensive alliances. - Mitre Costa Dourado; Luérbio Faria; Miguel A. Pizaña; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems. - Fernanda Couto; Luérbio Faria; Sulamita Klein (J. Braz. Comput. Soc., 2014)

On the forbidden induced subgraph probe problem. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (CTW, 2015)

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (WG, 2015)

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (Electron. Notes Discret. Math., 2015)

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. - Luérbio Faria; Laurent Gourvès; Carlos A. J. Martinhon; Jérôme Monnot (Theor. Comput. Sci., 2015)

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. - Sancrey Rodrigues Alves; Konrad Kazimierz Dabrowski; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton dos Santos Souza (COCOA, 2016)

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. - Hebert Coelho; Luérbio Faria; Sylvain Gravier; Sulamita Klein (Discret. Appl. Math., 2016)

Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013. - José Correa 001; Guillermo Durán; Luérbio Faria; Miguel A. Pizaña; Gelasio Salazar (Discret. Appl. Math., 2016)

A note on the middle levels problem. - Andréia C. S. Gusmão; Letícia Rodrigues Bueno; Rodrigo de A. Hausen; Celina M. H. de Figueiredo; Luérbio Faria (Discret. Appl. Math., 2016)

On complexities of minus domination. - Luérbio Faria; Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Tao-Ming Wang; Yue-Li Wang (Discret. Optim., 2016)

The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Inf. Process. Lett., 2016)

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; R. Bruce Richter; Imrich Vrt'o (J. Graph Theory, 2016)

Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. - Luérbio Faria; Sulamita Klein; Ignasi Sau; Rubens Sucupira (Discret. Math. Theor. Comput. Sci., 2017)

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. - Julien Baste; Luérbio Faria; Sulamita Klein; Ignasi Sau (Theory Comput. Syst., 2017)

On the forbidden induced subgraph probe and sandwich problems. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (Discret. Appl. Math., 2018)

The partitioned probe problem: NP-complete versus polynomial dichotomy. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Discret. Appl. Math., 2018)

Chordal-(2, 1) graph sandwich problem with boundary conditions. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (Electron. Notes Discret. Math., 2018)

On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. - Sancrey Rodrigues Alves; Konrad K. Dabrowski; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton S. Souza (Theor. Comput. Sci., 2018)

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. - Sancrey Rodrigues Alves; Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Uéverton S. Souza (LATIN, 2020)

Characterizations, probe and sandwich problems on (k, ℓ)-cographs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (Discret. Appl. Math., 2020)

Maximum cuts in edge-colored graphs. - Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton S. Souza; Rubens Sucupira (Discret. Appl. Math., 2020)

On the Probe Problem for (r, ℓ )-Well-Coveredness. - Luérbio Faria; Uéverton S. Souza (COCOON, 2021)

On feedback vertex set in reducible flow hypergraphs. - Luérbio Faria; André Luiz Pires Guedes; Lilian Markenzon (LAGOS, 2021)

Optimizing concurrency under Scheduling by Edge Reversal. - Carlos E. Marciano; Gladstone M. Arantes Jr.; Abilio Lucena; Luidi Gelabert Simonetti; Luérbio Faria; Felipe M. G. França (Networks, 2021)

On the probe problem for (r, ℓ)-well-coveredness: Algorithms and complexity. - Luérbio Faria; Uéverton S. Souza (Theor. Comput. Sci., 2022)

Partitions and well-coveredness: The graph sandwich problem. - Sancrey Rodrigues Alves; Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Uéverton S. Souza (Discret. Math., 2023)

On the conformability of regular line graphs. - Luérbio Faria; Mauro Nigro; Diana Sasaki (RAIRO Oper. Res., 2023)

Results about the total chromatic number and the conformability of some families of circulant graphs. - Luérbio Faria; Mauro Nigro; Myriam Preissmann; Diana Sasaki (Discret. Appl. Math., 2023)

Canonical cuts of path powers. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez; Sulamita Klein; Uéverton S. Souza; Rubens Sucupira (Contributions Discret. Math., 2024)

On the oriented coloring of the disjoint union of graphs. - Erika Morais Martins Coelho; Hebert Coelho da Coelho; Luérbio Faria; Mateus de Paula Ferreira; Sylvain Gravier; Sulamita Klein (RAIRO Oper. Res., 2024)

On the absolute and relative oriented clique problems' time complexity. - Erika M. M. Coelho; Hebert Coelho; Luérbio Faria; Mateus de Paula Ferreira; Sulamita Klein (Discret. Appl. Math., 2025)

A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs. - Luérbio Faria; Mauro Nigro; Diana Sasaki (Discret. Optim., 2025)