Luérbio Faria

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 33

Top Topics

Parameterized Complexity

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Theor. Comput. Sci.

Publications

Luérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki
Results about the total chromatic number and the conformability of some families of circulant graphs. Discret. Appl. Math. 340 (2023)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346 (3) (2023)
Luérbio Faria, Mauro Nigro, Diana Sasaki
On the conformability of regular line graphs. RAIRO Oper. Res. 57 (5) (2023)
Luérbio Faria, Uéverton S. Souza
)-well-coveredness: Algorithms and complexity. Theor. Comput. Sci. 932 (2022)
Luérbio Faria, Uéverton S. Souza
On the Probe Problem for (r, ℓ )-Well-Coveredness. COCOON (2021)
Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein
On the Oriented Coloring of the Disjoint Union of Graphs. IWOCA (2021)
Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon
On feedback vertex set in reducible flow hypergraphs. LAGOS (2021)
Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77 (4) (2021)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. Discret. Appl. Math. 281 (2020)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281 (2020)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN (2020)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. CoRR (2018)
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
)-graph. Theor. Comput. Sci. 746 (2018)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The partitioned probe problem: NP-complete versus polynomial dichotomy. Discret. Appl. Math. 234 (2018)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the forbidden induced subgraph probe and sandwich problems. Discret. Appl. Math. 234 (2018)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69 (2018)
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61 (3) (2017)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62 (2017)
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR (2017)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198 (2016)
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
On complexities of minus domination. Discret. Optim. 22 (2016)
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o
-Cube. J. Graph Theory 83 (1) (2016)
Andréia C. S. Gusmão, Letícia Rodrigues Bueno, Rodrigo de A. Hausen, Celina M. H. de Figueiredo, Luérbio Faria
A note on the middle levels problem. Discret. Appl. Math. 210 (2016)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy. Inf. Process. Lett. 116 (4) (2016)
José R. Correa, Guillermo Durán, Luérbio Faria, Miguel A. Pizaña, Gelasio Salazar
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013. Discret. Appl. Math. 210 (2016)
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA (2016)
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR (2015)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. CoRR (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. WG (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the forbidden induced subgraph probe problem. CTW (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. Electron. Notes Discret. Math. 50 (2015)
Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. 602 (2015)
Fernanda Couto, Luérbio Faria, Sulamita Klein
Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems. J. Braz. Comput. Soc. 20 (1) (2014)
Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter
On defensive alliances and strong global offensive alliances. Discret. Appl. Math. 163 (2014)
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
On Complexities of Minus Domination. COCOA (2013)
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
On Complexities of Minus Domination. CoRR (2013)
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. WG (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Electron. Notes Discret. Math. 44 (2013)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
Split clique graph complexity. Theor. Comput. Sci. 506 (2013)
Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe
Forbidden subgraphs and the König-Egerváry property. Discret. Appl. Math. 161 (16-17) (2013)
Carlos A. J. Martinhon, Luérbio Faria
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. FAW-AAIM (2013)
Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
On specifying boundary conditions for the graph sandwich problem. CTW (2013)
Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira
, ℓ)-Graph Sandwich Problems. FAW-AAIM (2013)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The generalized split probe problem. Electron. Notes Discret. Math. 44 (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the Oriented Chromatic Number of Union of Graphs. CTW (2012)
Luérbio Faria, Sulamita Klein, Matej Stehlík
Odd Cycle Transversals and Independent Sets in Fullerene Graphs. SIAM J. Discret. Math. 26 (3) (2012)
Letícia Rodrigues Bueno, Celina M. H. de Figueiredo, Luérbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen
Hamiltonian Cycles in Kneser Graphs for n=2k+2. Electron. Notes Discret. Math. 37 (2011)
Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO Theor. Informatics Appl. 45 (3) (2011)
Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe
Forbidden subgraphs and the Kőnig property. Electron. Notes Discret. Math. 37 (2011)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
Split Clique Graph Complexity. WG (2011)
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
Flow hypergraph reducibility. Discret. Appl. Math. 159 (16) (2011)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Discret. Appl. Math. 158 (12) (2010)
Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
vertex-set partition into nonempty parts. Discret. Math. 310 (6-7) (2010)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Advances on the List Stubborn Problem. CATS (2010)
Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Discret. Math. 24 (3) (2010)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
The complexity of clique graph recognition. Theor. Comput. Sci. 410 (21-23) (2009)
Candido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Comb. 92 (2009)
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
Recognition of Reducible Flow Hypergraphs. CTW (2009)
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409 (3) (2008)
Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. BSB (2008)
Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30 (2008)
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
Paths and Trails in Edge-Colored Graphs. LATIN (2008)
Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed
Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. 156 (12) (2008)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Electron. Notes Discret. Math. 30 (2008)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59 (2) (2008)
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
Flow Hypergraph Reducibility. Electron. Notes Discret. Math. 30 (2008)
Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theor. Comput. Sci. 381 (1-3) (2007)
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi
On maximum planar induced subgraphs. Discret. Appl. Math. 154 (13) (2006)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
Clique Graph Recognition Is NP-Complete. WG (2006)
C. N. Campos, Simone Dantas, Luérbio Faria, Sylvain Gravier
-Partition Problem. Electron. Notes Discret. Math. 22 (2005)
Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
The non planar vertex deletion of Cn x Cm. Ars Comb. 76 (2005)
Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria
)-graph sandwich problems. Discret. Appl. Math. 143 (1-3) (2004)
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discret. Appl. Math. 141 (1-3) (2004)
Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electron. Notes Discret. Math. 18 (2004)
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi
-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18 (2004)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An Improved Upper Bound on the Crossing Number of the Hypercube. WG (2003)
Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
. Ars Comb. 63 (2002)
Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria
On the Complexity of (k, l)-Graph Sandwich Problems. WG (2002)
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Electron. Notes Discret. Math. 7 (2001)
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
SPLITTING NUMBER is NP-complete. Discret. Appl. Math. 108 (1-2) (2001)
Celina M. H. de Figueiredo, Luérbio Faria, Candido Ferreira Xavier de Mendonça Neto
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. SODA (1999)
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
The Splitting Number of the 4-Cube. LATIN (1998)
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
Splitting Number is NP-complete WG (1998)
Felipe M. G. França, Luérbio Faria
Optimal Mapping of Neighbourhood-Constrained Systems. IRREGULAR (1995)