| |
| 2008 | ||
|---|---|---|
| 2 | EE | M. 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) |
| 2004 | ||
| 1 | EE | M. 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) |
| 1 | M. R. Cerioli | [1] [2] |
| 2 | L. Faria | [1] [2] |
| 3 | Carlos A. J. Martinhon | [2] |
| 4 | Fábio Protti | [1] [2] |
| 5 | B. Reed | [2] |