 | 2009 |
|---|
| 6 |       | André Luiz Pires Guedes,
Lilian Markenzon,
L. Faria:
Recognition of Reducible Flow Hypergraphs.
CTW 2009: 229-232 |
| 2008 |
|---|
| 5 | | A. Abouelaoualim,
Kinkar Chandra Das,
L. Faria,
Yannis Manoussakis,
Carlos A. J. Martinhon,
Rachid Saad:
Paths and Trails in Edge-Colored Graphs.
LATIN 2008: 723-735 |
| 4 | | Márcia R. Cerioli,
L. Faria,
T. O. Ferreira,
Carlos A. J. Martinhon,
Fábio Protti,
B. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discrete Applied Mathematics 156(12): 2270-2278 (2008) |
| 3 | | André Luiz Pires Guedes,
Lilian Markenzon,
L. Faria:
Flow Hypergraph Reducibility.
Electronic Notes in Discrete Mathematics 30: 255-260 (2008) |
| 2 | | A. Abouelaoualim,
Kinkar Chandra Das,
L. Faria,
Yannis Manoussakis,
Carlos A. J. Martinhon,
Rachid Saad:
Paths and trails in edge-colored graphs.
Theor. Comput. Sci. 409(3): 497-510 (2008) |
| 2004 |
|---|
| 1 | | Márcia R. Cerioli,
L. Faria,
T. 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) |
