Luerbio Faria

Hebert Coelho, Luerbio Faria, Sylvain Gravier, Sulamita Klein: An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58

Fernanda Couto, Luerbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66

Luerbio Faria, Sulamita Klein, Matej Stehlík: Odd Cycle Transversals and Independent Sets in Fullerene Graphs. SIAM J. Discrete Math. 26(3): 1458-1469 (2012)

Hebert Coelho, Luerbio Faria, Sylvain Gravier, Sulamita Klein: On the Oriented Chromatic Number of Union of Graphs. CTW 2012: 88-91

André Luiz Pires Guedes, Lilian Markenzon, Luerbio Faria: Flow hypergraph reducibility. Discrete Applied Mathematics 159(16): 1775-1785 (2011)

L. R. Bueno, Celina M. Herrera de Figueiredo, Luerbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen: Hamiltonian Cycles in Kneser Graphs for n=2k+2. Electronic Notes in Discrete Mathematics 37: 291-296 (2011)

Mitre Costa Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín Darío Safe: Forbidden subgraphs and the Kőnig property. Electronic Notes in Discrete Mathematics 37: 333-338 (2011)

Márcia R. Cerioli, Luerbio 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. Inf. and Applic. 45(3): 331-346 (2011)

Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez: Split Clique Graph Complexity. WG 2011: 11-22

Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez: On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Discrete Applied Mathematics 158(12): 1279-1285 (2010)

Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein: 2K₂ vertex-set partition into nonempty parts. Discrete Mathematics 310(6-7): 1259-1264 (2010)

Rodrigo de A. Hausen, Luerbio Faria, Celina M. Herrera de Figueiredo, Luis Antonio Brasil Kowada: Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Discrete Math. 24(3): 792-807 (2010)

Simone Dantas, Luerbio Faria, C. M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: Advances on the List Stubborn Problem. CATS 2010: 65-70

Candido Ferreira Xavier de Mendonça Neto, A. A. Constantino, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, C. M. H. de Figueiredo: Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Comb. 92 (2009)

Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez: The complexity of clique graph recognition. Theor. Comput. Sci. 410(21-23): 2072-2083 (2009)

André Luiz Pires Guedes, Lilian Markenzon, Luerbio Faria: Recognition of Reducible Flow Hypergraphs. CTW 2009: 229-232

Márcia R. Cerioli, Luerbio 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. Discrete Applied Mathematics 156(12): 2270-2278 (2008)

Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez: On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Electronic Notes in Discrete Mathematics 30: 147-152 (2008)

André Luiz Pires Guedes, Lilian Markenzon, Luerbio Faria: Flow Hypergraph Reducibility. Electronic Notes in Discrete Mathematics 30: 255-260 (2008)

Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein: 2K₂ vertex-set partition into nonempty parts. Electronic Notes in Discrete Mathematics 30: 291-296 (2008)

Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto: An improved upper bound on the crossing number of the hypercube. Journal of Graph Theory 59(2): 145-161 (2008)

A. Abouelaoualim, Kinkar Chandra Das, Luerbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008)

A. Abouelaoualim, Kinkar Chandra Das, Luerbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735

Rodrigo de A. Hausen, Luerbio Faria, Celina M. Herrera de Figueiredo, Luis Antonio Brasil Kowada: On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. BSB 2008: 79-91

Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luerbio Faria (Eds.): 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

Celina M. Herrera de Figueiredo, Luerbio 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): 57-67 (2007)

Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi: On maximum planar induced subgraphs. Discrete Applied Mathematics 154(13): 1774-1782 (2006)

Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez: Clique Graph Recognition Is NP-Complete. WG 2006: 269-277

Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, Celina M. Herrera de Figueiredo: The non planar vertex deletion of Cn x Cm. Ars Comb. 76 (2005)

C. N. Campos, Simone Dantas, Luerbio Faria, Sylvain Gravier: 2K₂-Partition Problem. Electronic Notes in Discrete Mathematics 22: 217-221 (2005)

Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto: On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discrete Applied Mathematics 141(1-3): 119-134 (2004)

Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria: On decision and optimization (k, l)-graph sandwich problems. Discrete Applied Mathematics 143(1-3): 155-165 (2004)

Márcia R. Cerioli, Luerbio 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. Electronic Notes in Discrete Mathematics 18: 73-79 (2004)

Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi: Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. Electronic Notes in Discrete Mathematics 18: 121-126 (2004)

Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto: An Improved Upper Bound on the Crossing Number of the Hypercube. WG 2003: 230-236

Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, Celina M. Herrera de Figueiredo: The splitting number and skewness of C_n x C_m. Ars Comb. 63 (2002)

Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria: On the Complexity of (k, l)-Graph Sandwich Problems. WG 2002: 92-101

Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto: SPLITTING NUMBER is NP-complete. Discrete Applied Mathematics 108(1-2): 65-83 (2001)

Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto: On the complexity of the approximation of nonplanarity parameters for cubic graphs. Electronic Notes in Discrete Mathematics 7: 18-21 (2001)

Celina M. Herrera de Figueiredo, Luerbio Faria, Candido Ferreira Xavier de Mendonça Neto: Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. SODA 1999: 887-888

Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto: The Splitting Number of the 4-Cube. LATIN 1998: 141-150

Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto: Splitting Number is NP-complete. WG 1998: 285-297

Felipe M. G. França, Luerbio Faria: Optimal Mapping of Neighbourhood-Constrained Systems. IRREGULAR 1995: 165-170