default search action
Luérbio Faria
Person information
- affiliation: Rio de Janeiro State University (UERJ), Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j55]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: 123-133 (2023) - [j54]Sancrey Rodrigues Alves, Fernanda Couto
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346(3): 113253 (2023) - [j53]Luérbio Faria, Mauro Nigro
On the conformability of regular line graphs. RAIRO Oper. Res. 57(5): 2527-2536 (2023) - 2022
- [j52]Luérbio Faria
On the probe problem for (r, ℓ)-well-coveredness: Algorithms and complexity. Theor. Comput. Sci. 932: 56-68 (2022) - 2021
- [j51]Carlos E. Marciano
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77(4): 520-537 (2021) - [c23]Luérbio Faria, Uéverton S. Souza
On the Probe Problem for (r, ℓ )-Well-Coveredness. COCOON 2021: 375-386 - [c22]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: 194-207 - [c21]Luérbio Faria, André Luiz Pires Guedes
On feedback vertex set in reducible flow hypergraphs. LAGOS 2021: 212-220 - 2020
- [j50]Fernanda Couto
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. Discret. Appl. Math. 281: 118-133 (2020) - [j49]Luérbio Faria, Sulamita Klein, Ignasi Sau
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281: 229-234 (2020) - [c20]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: 587-599
2010 – 2019
- 2018
- [j48]Fernanda Couto
On the forbidden induced subgraph probe and sandwich problems. Discret. Appl. Math. 234: 56-66 (2018) - [j47]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo
The partitioned probe problem: NP-complete versus polynomial dichotomy. Discret. Appl. Math. 234: 67-75 (2018) - [j46]Fernanda Couto
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69: 277-284 (2018) - [j45]Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. Theor. Comput. Sci. 746: 36-48 (2018) - [i8]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. CoRR abs/1805.00858 (2018) - 2017
- [j44]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) - [j43]Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62: 87-92 (2017) - [j42]Julien Baste
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61(3): 777-794 (2017) - [i7]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR abs/1705.09177 (2017) - 2016
- [j41]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198: 109-117 (2016) - [j40]José 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: 1-3 (2016) - [j39]Andréia C. S. Gusmão, Letícia Rodrigues Bueno
A note on the middle levels problem. Discret. Appl. Math. 210: 290-296 (2016) - [j38]Luérbio Faria, Wing-Kai Hon
On complexities of minus domination. Discret. Optim. 22: 6-19 (2016) - [j37]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy. Inf. Process. Lett. 116(4): 294-298 (2016) - [j36]Luérbio Faria, Celina M. H. de Figueiredo
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube. J. Graph Theory 83(1): 19-33 (2016) - [c19]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437 - 2015
- [j35]Fernanda Couto
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. Electron. Notes Discret. Math. 50: 133-138 (2015) - [j34]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: 89-102 (2015) - [c18]Fernanda Couto
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. WG 2015: 312-324 - [i6]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe problem. CTW 2015: 231-234 - [i5]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR abs/1504.05515 (2015) - [i4]Luérbio Faria, Sulamita Klein, Ignasi Sau
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. CoRR abs/1512.05223 (2015) - 2014
- [j33]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: 136-141 (2014) - [j32]Fernanda Couto
Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems. J. Braz. Comput. Soc. 20(1): 19:1-19:10 (2014) - 2013
- [j31]Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo
Forbidden subgraphs and the König-Egerváry property. Discret. Appl. Math. 161(16-17): 2380-2388 (2013) - [j30]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo
The generalized split probe problem. Electron. Notes Discret. Math. 44: 39-45 (2013) - [j29]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: 195-200 (2013) - [j28]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo
Split clique graph complexity. Theor. Comput. Sci. 506: 29-42 (2013) - [c17]Fernanda Couto
On (k, ℓ)-Graph Sandwich Problems. FAW-AAIM 2013: 187-197 - [c16]Carlos A. J. Martinhon, Luérbio Faria:
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. FAW-AAIM 2013: 231-240 - [c15]Luérbio Faria, Wing-Kai Hon
On Complexities of Minus Domination. COCOA 2013: 178-189 - [c14]Luérbio Faria, Celina M. H. de Figueiredo
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. WG 2013: 249-260 - [i3]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58 - [i2]Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66 - [i1]Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang:
On Complexities of Minus Domination. CoRR abs/1307.6663 (2013) - 2012
- [j27]Luérbio Faria, Sulamita Klein, Matej Stehlík:
Odd Cycle Transversals and Independent Sets in Fullerene Graphs. SIAM J. Discret. Math. 26(3): 1458-1469 (2012) - [c13]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the Oriented Chromatic Number of Union of Graphs. CTW 2012: 88-91 - 2011
- [j26]André Luiz Pires Guedes
Flow hypergraph reducibility. Discret. Appl. Math. 159(16): 1775-1785 (2011) - [j25]Letícia Rodrigues Bueno
Hamiltonian Cycles in Kneser Graphs for n=2k+2. Electron. Notes Discret. Math. 37: 291-296 (2011) - [j24]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: 333-338 (2011) - [j23]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): 331-346 (2011) - [c12]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo
Split Clique Graph Complexity. WG 2011: 11-22 - 2010
- [j22]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Discret. Appl. Math. 158(12): 1279-1285 (2010) - [j21]Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo
2K2 vertex-set partition into nonempty parts. Discret. Math. 310(6-7): 1259-1264 (2010) - [j20]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Discret. Math. 24(3): 792-807 (2010) - [c11]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: 65-70
2000 – 2009
- 2009
- [j19]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) - [j18]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo
The complexity of clique graph recognition. Theor. Comput. Sci. 410(21-23): 2072-2083 (2009) - [c10]André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Recognition of Reducible Flow Hypergraphs. CTW 2009: 229-232 - 2008
- [j17]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): 2270-2278 (2008) - [j16]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Electron. Notes Discret. Math. 30: 147-152 (2008) - [j15]André Luiz Pires Guedes
Flow Hypergraph Reducibility. Electron. Notes Discret. Math. 30: 255-260 (2008) - [j14]Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo
2K2 vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30: 291-296 (2008) - [j13]Luérbio Faria, Celina M. H. de Figueiredo
An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59(2): 145-161 (2008) - [j12]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): 497-510 (2008) - [c9]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: 723-735 - [c8]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. BSB 2008: 79-91 - [e1]Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Lecture Notes in Computer Science 4957, Springer 2008, ISBN 978-3-540-78772-3 [contents] - 2007
- [j11]Celina M. H. de Figueiredo
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theor. Comput. Sci. 381(1-3): 57-67 (2007) - 2006
- [j10]Luérbio Faria, Celina M. H. de Figueiredo
On maximum planar induced subgraphs. Discret. Appl. Math. 154(13): 1774-1782 (2006) - [c7]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Clique Graph Recognition Is NP-Complete. WG 2006: 269-277 - 2005
- [j9]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) - [j8]C. N. Campos
2K2-Partition Problem. Electron. Notes Discret. Math. 22: 217-221 (2005) - 2004
- [j7]Luérbio Faria, Celina M. H. de Figueiredo
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discret. Appl. Math. 141(1-3): 119-134 (2004) - [j6]Simone Dantas, Celina M. H. de Figueiredo
On decision and optimization (k, l)-graph sandwich problems. Discret. Appl. Math. 143(1-3): 155-165 (2004) - [j5]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: 73-79 (2004) - [j4]Luérbio Faria, Celina M. H. de Figueiredo
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18: 121-126 (2004) - 2003
- [c6]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: 230-236 - 2002
- [j3]Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
The splitting number and skewness of Cn x Cm. Ars Comb. 63 (2002) - [c5]Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria:
On the Complexity of (k, l)-Graph Sandwich Problems. WG 2002: 92-101 - 2001
- [j2]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): 65-83 (2001) - [j1]Luérbio Faria, Celina M. H. de Figueiredo
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Electron. Notes Discret. Math. 7: 18-21 (2001)
1990 – 1999
- 1999
- [c4]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: 887-888 - 1998
- [c3]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
The Splitting Number of the 4-Cube. LATIN 1998: 141-150 - [c2]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
Splitting Number is NP-complete. WG 1998: 285-297 - 1995
- [c1]Felipe M. G. França
Optimal Mapping of Neighbourhood-Constrained Systems. IRREGULAR 1995: 165-170
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-15 23:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: