2009 |
23 | EE | 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) |
2008 |
22 | | Eduardo Sany Laber,
Claudson F. Bornstein,
Loana Tito Nogueira,
Luerbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
Springer 2008 |
21 | EE | 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 |
20 | EE | 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) |
19 | EE | Simone Dantas,
Elaine M. Eschen,
Luerbio Faria,
Celina M. Herrera de Figueiredo,
Sulamita Klein:
2K2 vertex-set partition into nonempty parts.
Electronic Notes in Discrete Mathematics 30: 291-296 (2008) |
18 | EE | 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) |
2007 |
17 | EE | 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) |
2006 |
16 | EE | Liliana Alcón,
Luerbio Faria,
Celina M. Herrera de Figueiredo,
Marisa Gutierrez:
Clique Graph Recognition Is NP-Complete.
WG 2006: 269-277 |
15 | EE | 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) |
2005 |
14 | | 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) |
13 | EE | C. N. Campos,
Simone Dantas,
Luerbio Faria,
Sylvain Gravier:
2K2-Partition Problem.
Electronic Notes in Discrete Mathematics 22: 217-221 (2005) |
2004 |
12 | EE | 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) |
11 | EE | 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) |
10 | EE | 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) |
2003 |
9 | EE | 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 |
2002 |
8 | EE | Simone Dantas,
Celina M. Herrera de Figueiredo,
Luerbio Faria:
On the Complexity of (k, l)-Graph Sandwich Problems.
WG 2002: 92-101 |
7 | | 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 Cn x Cm.
Ars Comb. 63: (2002) |
2001 |
6 | | 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) |
5 | EE | 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) |
1999 |
4 | EE | 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 |
1998 |
3 | EE | 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 |
2 | | Luerbio Faria,
Celina M. Herrera de Figueiredo,
Candido Ferreira Xavier de Mendonça Neto:
Splitting Number is NP-complete
WG 1998: 285-297 |
1995 |
1 | | Felipe M. G. França,
Luerbio Faria:
Optimal Mapping of Neighbourhood-Constrained Systems.
IRREGULAR 1995: 165-170 |