1.
ALVES, M. D. ; SOUZA, U. ; NOGUEIRA, L. T. ; BRAVO, R. S. F. . Geração de Obstruções Minimais de Grafos-(2; 1). MATEMATICA CONTEMPORANEA, v. 45, p. 11-21, 2017.
2.
BRANDSTÄDT, ANDREAS ; ESPOSITO, SIMONE ; Nogueira, Loana T. ; Protti, Fábio . Clique cycle-transversals in distance-hereditary graphs. DISCRETE APPLIED MATHEMATICS
, v. 210, p. 38-44, 2016.
Citações:
1
3.
Couto, F. ; KLEIN, S. ; FARIA, L. ; PROTTI, F ; NOGUEIRA, L. T. . (k,l)-sandwich problems: why not ask for special kinds of bread?.. MATEMATICA CONTEMPORANEA, v. 42, p. 17-26, 2014.
4.
BRANDSTADT, A. ; BRITO, S. P. ; NOGUEIRA, L. T. ; KLEIN, S ; PROTTI, F . Cycle transversals in perfect graphs and cographs. THEORETICAL COMPUTER SCIENCE, v. 469, p. 15-23, 2013.
5.
BRANDSTADT, A. ; PROTTI, F. ; Nogueira, Loana T. ; KLEIN, S ; BRITO, S. P. . Corrigendum to -Cycle transversals in perfect graphs and cographs- [Theoret. Comput. Sci. 469 (2013) 15-23]. Theoretical Computer Science, p. 103-105, 2013.
Citações:
1
6.
BRAVO, R. S. F. ; KLEIN, S. ; NOGUEIRA, L. T. ; PROTTI, F. . Clique cycle transversals in graphs with few P4's. Discrete Mathematics and Theoretical Computer Science (Online), v. 15:3, p. 13-20, 2013.
7.
Bravo, Raquel S.F. ; Klein, Sulamita ; Nogueira, Loana T. ; Protti, Fábio ; SAMPAIO, RUDINI M. . Partitioning extended P_4-laden graphs into cliques and stable sets. INFORMATION PROCESSING LETTERS, v. 112, p. 829-834, 2012.
8.
KLEIN, S ; Nogueira, L.T. ; PROTTI, F ; Bravo, Raquel S.F. . Characterization and recognition of P_4 sparse graphs graphs partitionable into k independent sets and l cliques. Discrete Applied Mathematics, v. 159, p. 165-173, 2011.
9.
GROSHAUS, M. ; HELL, P. ; KLEIN, S. ; NOGUEIRA, L. T. ; PROTTI, F. . Cycle transversals in bounded degree graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (ONLINE), v. 13, p. 45-66, 2011.
Citações:2
10.
COSTA, V ; HAEUSLER, E ; LABER, E ; NOGUEIRA, L . A note on the size of minimal covers. Information Processing Letters, v. 102, p. 124-126, 2007.
11.
HELL, P. ; KLEIN, S. ; NOGUEIRA, L. T. ; PROTTI, F. . Packing r-Cliques in Weighted Chordal Graphs. Annals of Operations Research, Netherlands, v. 138, p. 179-187, 2005.
12.
FEDER, T ; HELL, P ; KLEIN, S ; NOGUEIRA, L. T. ; PROTTI, F . List matrix partitions of chordal graphs. Theoretical Computer Science, p. 52, 2005.
13.
HELL, P ; KLEIN, S ; NOGUEIRA, L ; PROTTI, F . Partitioning chordal graphs into independent sets and cliques. Discrete Applied Mathematics, Holanda, v. 141, n.1-3, p. 185-194, 2004.
14.
LABER, E ; NOGUEIRA, L . On the hardness of the minimum height decision tree problem. Discrete Applied Mathematics, v. 144, n.1-2, p. 209-212, 2004.
15.
HELL, P. ; KLEIN, S. ; NOGUEIRA, L. T. ; PROTTI, F. . Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques. TEMA. Tendências em Matemática Aplicada e Computacional, Brasil, v. 3, n.1, p. 147-155, 2002.
“The joy of discovery is certainly the liveliest that the mind of man can ever feel.”