 | 2011 |
| 16 |  | Carlos A. J. Martinhon,
Fábio Protti:
An improved derandomized approximation algorithm for the max-controlled set problem.
RAIRO - Theor. Inf. and Applic. 45(2): 181-196 (2011) |
| 2010 |
| 15 |  | Laurent Gourvès,
Adria Lyra,
Carlos A. J. Martinhon,
Jérôme Monnot:
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.
TAMC 2010: 222-233 |
| 14 |  | Ivairton M. Santos,
Carlos A. J. Martinhon,
Luiz Satoru Ochi:
Near-optimal solutions for the generalized max-controlled set problem.
Computers & OR 37(10): 1805-1813 (2010) |
| 13 |  | Laurent Gourvès,
Adria Lyra,
Carlos A. J. Martinhon,
Jérôme Monnot:
The minimum reload s-t path, trail and walk problems.
Discrete Applied Mathematics 158(13): 1404-1417 (2010) |
| 12 |  | A. Abouelaoualim,
Kinkar Chandra Das,
Wenceslas Fernandez de la Vega,
Marek Karpinski,
Yannis Manoussakis,
Carlos A. J. Martinhon,
Rachid Saad:
Cycles and paths in edge-colored graphs with given degrees.
Journal of Graph Theory 64(1): 63-86 (2010) |
| 2009 |
| 11 |  | A. Abouelaoualim,
Valentin Borozan,
Yannis Manoussakis,
Carlos A. J. Martinhon,
R. Muthu,
Rachid Saad:
Colored Trees in Edge-Colored Graphs.
CTW 2009: 115-119 |
| 10 |  | 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 |
| 9 |  | Laurent Gourvès,
Adria Lyra,
Carlos A. J. Martinhon,
Jérôme Monnot,
Fábio Protti:
On s-t paths and trails in edge-colored graphs.
Electronic Notes in Discrete Mathematics 35: 221-226 (2009) |
| 8 |  | Gladstone M. Arantes Jr.,
Felipe M. G. França,
Carlos A. J. Martinhon:
Randomized generation of acyclic orientations upon anonymous distributed systems.
J. Parallel Distrib. Comput. 69(3): 239-246 (2009) |
| 2008 |
| 7 |  | A. Abouelaoualim,
Kinkar Chandra Das,
Luerbio Faria,
Yannis Manoussakis,
Carlos A. J. Martinhon,
Rachid Saad:
Paths and Trails in Edge-Colored Graphs.
LATIN 2008: 723-735 |
| 6 |  | Márcia R. Cerioli,
Luerbio Faria,
Talita O. Ferreira,
Carlos A. J. Martinhon,
Fábio Protti,
Bruce A. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discrete Applied Mathematics 156(12): 2270-2278 (2008) |
| 5 |  | 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 |  | A. Abouelaoualim,
Kinkar Chandra Das,
Luerbio 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 |  | Carlos A. J. Martinhon,
Fábio Protti:
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem.
WEA 2004: 341-355 |
| 2 |  | 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 |  | 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) |