Carlos Alberto de Jesus Martinhon

According to our database, Carlos Alberto de Jesus Martinhon authored at least 23 papers between 2001 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

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

2016

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow.

Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos

Comput. Oper. Res., 2016

2015

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

2014

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon

Proceedings of the Operations Research and Enterprise Systems, 2014

An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon

Proceedings of the ICORES 2014, 2014

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Philippe Yves Paul Michelon, Edcarllos Santos

Proceedings of the ICEIS 2014, 2014

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

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.

Carlos A. J. Martinhon, Luérbio Faria

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

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

2011

An improved derandomized approximation algorithm for the max-controlled set problem.

Carlos A. J. Martinhon, Fábio Protti

RAIRO Theor. Informatics Appl., 2011

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

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

Near-optimal solutions for the generalized max-controlled set problem.

Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi

Comput. Oper. Res., 2010

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.

Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

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

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

The Minimum Reload s-tPath/Trail/Walk Problems.

Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Colored Trees in Edge-Colored Graphs.

Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

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

The Generalized Max-Controlled Set Problem.

Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi

Electron. Notes Discret. Math., 2008

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

2004

Stronger K-tree relaxations for the vehicle routing problem.

Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan

Eur. J. Oper. Res., 2004

2001

Reduction Rules for the Covering Tour Problem.

Luciene C. S. Motta, Luiz Satoru Ochi, Carlos A. J. Martinhon

Electron. Notes Discret. Math., 2001