Luérbio Faria

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