| 2009 |
|---|
| 8 | EE | Laurent Gourvès,
Adria Lyra,
Carlos A. J. Martinhon,
Jérôme Monnot:
The Minimum Reload s-tPath/Trail/Walk Problems.
SOFSEM 2009: 621-632 |
| 2008 |
|---|
| 7 | EE | 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 |
| 6 | 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) |
| 5 | EE | Ivairton M. Santos,
Carlos A. J. Martinhon,
Luiz Satoru Ochi:
The Generalized Max-Controlled Set Problem.
Electronic Notes in Discrete Mathematics 30: 183-188 (2008) |
| 4 | EE | 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 |
|---|
| 3 | EE | Carlos A. J. Martinhon,
Fábio Protti:
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem.
WEA 2004: 341-355 |
| 2 | EE | Carlos A. J. Martinhon,
Abilio Lucena,
Nelson Maculan:
Stronger K-tree relaxations for the vehicle routing problem.
European Journal of Operational Research 158(1): 56-71 (2004) |
| 2001 |
|---|
| 1 | EE | Luciene C. S. Motta,
Luiz Satoru Ochi,
Carlos A. J. Martinhon:
Reduction Rules for the Covering Tour Problem.
Electronic Notes in Discrete Mathematics 7: 142-145 (2001) |
