Carlos A. J. Martinhon

21 papers B 2C 2Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2019 J jnl
Maximum colored trees in edge-colored graphs.
Eur. J. Comb.
Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad
2015 J jnl
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.
Theor. Comput. Sci.
Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
2013 J jnl
Complexity of trails, paths and circuits in arc-colored digraphs.
Discret. Appl. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2013 — conf
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.
FAW-AAIM
Carlos A. J. Martinhon, Luérbio Faria
2012 J jnl
On paths, trails and closed trails in edge-colored graphs.
Discret. Math. Theor. Comput. Sci.
Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2011 J jnl
An improved derandomized approximation algorithm for the max-controlled set problem.
RAIRO Theor. Informatics Appl.
Carlos A. J. Martinhon, Fábio Protti
2010 C conf
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.
TAMC
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2010 J jnl
Cycles and paths in edge-colored graphs with given degrees.
J. Graph Theory
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2010 J jnl
Near-optimal solutions for the generalized max-controlled set problem.
Comput. Oper. Res.
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi
2010 J jnl
The minimum reload s-t path, trail and walk problems.
Discret. Appl. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2009 C conf
Colored Trees in Edge-Colored Graphs.
CTW
Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad
2009 J jnl
On s-t paths and trails in edge-colored graphs.
Electron. Notes Discret. Math.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti
2009 J jnl
Randomized generation of acyclic orientations upon anonymous distributed systems.
J. Parallel Distributed Comput.
Gladstone M. Arantes Jr., Felipe M. G. França, Carlos A. J. Martinhon
2009 B conf
The Minimum Reload s-tPath/Trail/Walk Problems.
SOFSEM
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2008 J jnl
Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discret. Appl. Math.
Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed
2008 B conf
Paths and Trails in Edge-Colored Graphs.
LATIN
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2008 J jnl
Paths and trails in edge-colored graphs.
Theor. Comput. Sci.
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2008 J jnl
The Generalized Max-Controlled Set Problem.
Electron. Notes Discret. Math.
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi
2004 — conf
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem.
WEA
Carlos A. J. Martinhon, Fábio Protti
2004 J jnl
Stronger K-tree relaxations for the vehicle routing problem.
Eur. J. Oper. Res.
Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan
2001 J jnl
Reduction Rules for the Covering Tour Problem.
Electron. Notes Discret. Math.
Luciene C. S. Motta, Luiz Satoru Ochi, Carlos A. J. Martinhon