Reduction Rules for the Covering Tour Problem. - Luciene C. S. Motta; Luiz Satoru Ochi; Carlos A. J. Martinhon (Electron. Notes Discret. Math., 2001)

Stronger K-tree relaxations for the vehicle routing problem. - Carlos A. J. Martinhon; Abilio Lucena; Nelson Maculan (Eur. J. Oper. Res., 2004)

Partition into cliques for cubic graphs: Planar case, complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Carlos A. J. Martinhon; Fábio Protti; Bruce A. Reed (Discret. Appl. Math., 2008)

The Generalized Max-Controlled Set Problem. - Ivairton M. Santos; Carlos A. J. Martinhon; Luiz Satoru Ochi (Electron. Notes Discret. Math., 2008)

Paths and trails in edge-colored graphs. - Abdelfattah Abouelaoualim; Kinkar Chandra Das; Luérbio Faria; Yannis Manoussakis; Carlos A. J. Martinhon; Rachid Saad (Theor. Comput. Sci., 2008)

Colored Trees in Edge-Colored Graphs. - Abdelfattah Abouelaoualim; Valentin Borozan; Yannis Manoussakis; Carlos A. J. Martinhon; Rahul Muthu; Rachid Saad (CTW, 2009)

The Minimum Reload s-tPath/Trail/Walk Problems. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (SOFSEM, 2009)

On s-t paths and trails in edge-colored graphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot; Fábio Protti (Electron. Notes Discret. Math., 2009)

Randomized generation of acyclic orientations upon anonymous distributed systems. - Gladstone M. Arantes Jr.; Felipe M. G. França; Carlos A. J. Martinhon (J. Parallel Distributed Comput., 2009)

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (TAMC, 2010)

Near-optimal solutions for the generalized max-controlled set problem. - Ivairton M. Santos; Carlos A. J. Martinhon; Luiz Satoru Ochi (Comput. Oper. Res., 2010)

The minimum reload s-t path, trail and walk problems. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Appl. Math., 2010)

Cycles and paths in edge-colored graphs with given degrees. - Abdelfattah Abouelaoualim; Kinkar Chandra Das; Wenceslas Fernandez de la Vega; Marek Karpinski; Yannis Manoussakis; Carlos A. J. Martinhon; Rachid Saad (J. Graph Theory, 2010)

An improved derandomized approximation algorithm for the max-controlled set problem. - Carlos A. J. Martinhon; Fábio Protti (RAIRO Theor. Informatics Appl., 2011)

On paths, trails and closed trails in edge-colored graphs. - Laurent Gourvès; Adria Ramos de Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Math. Theor. Comput. Sci., 2012)

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. - Carlos A. J. Martinhon; Luérbio Faria (FAW-AAIM, 2013)

Complexity of trails, paths and circuits in arc-colored digraphs. - Laurent Gourvès; Adria Lyra; Carlos A. J. Martinhon; Jérôme Monnot (Discret. Appl. Math., 2013)

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Philippe Yves Paul Michelon; Edcarllos Santos (ICEIS (1), 2014)

An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Edcarllos Santos; Philippe Yves Paul Michelon (ICORES, 2014)

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Edcarllos Santos; Philippe Yves Paul Michelon (ICORES (Selected Papers), 2014)

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. - Luérbio Faria; Laurent Gourvès; Carlos A. J. Martinhon; Jérôme Monnot (Theor. Comput. Sci., 2015)

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. - Pedro Henrique González 001; Luidi Simonetti; Philippe Michelon; Carlos Alberto de Jesus Martinhon; Edcarllos Santos (Comput. Oper. Res., 2016)

Maximum colored trees in edge-colored graphs. - Valentin Borozan; Wenceslas Fernandez de la Vega; Yannis Manoussakis; Carlos A. J. Martinhon; Rahul Muthu; Hong Phong Pham; Rachid Saad (Eur. J. Comb., 2019)