default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Alberto de Jesus Martinhon
Person information
- affiliation: Fluminense Federal University, Institute of Computation, Niterói, RJ, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j16]Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad:
Maximum colored trees in edge-colored graphs. Eur. J. Comb. 80: 296-310 (2019)- 2016
- [j15]Pedro Henrique González
, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos:
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. Comput. Oper. Res. 76: 134-146 (2016) - 2015
- [j14]Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot:
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. 602: 89-102 (2015) - [i1]Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos:
A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow. CoRR abs/1504.03217 (2015) - 2014
- [c9]Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Philippe Yves Paul Michelon, Edcarllos Santos:
A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow. ICEIS (1) 2014: 384-394 - [c8]Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon:
An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow. ICORES 2014: 100-107 - [c7]Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon:
A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. ICORES (Selected Papers) 2014: 173-185 - 2013
- [j13]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of trails, paths and circuits in arc-colored digraphs. Discret. Appl. Math. 161(6): 819-828 (2013) - [c6]Carlos A. J. Martinhon, Luérbio Faria:
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. FAW-AAIM 2013: 231-240 - 2012
- [j12]Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
On paths, trails and closed trails in edge-colored graphs. Discret. Math. Theor. Comput. Sci. 14(2): 57-74 (2012) - 2011
- [j11]Carlos A. J. Martinhon, Fábio Protti:
An improved derandomized approximation algorithm for the max-controlled set problem. RAIRO Theor. Informatics Appl. 45(2): 181-196 (2011) - 2010
- [j10]Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi:
Near-optimal solutions for the generalized max-controlled set problem. Comput. Oper. Res. 37(10): 1805-1813 (2010) - [j9]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. 158(13): 1404-1417 (2010) - [j8]Abdelfattah 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. J. Graph Theory 64(1): 63-86 (2010) - [c5]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
2000 – 2009
- 2009
- [j7]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. Electron. Notes Discret. Math. 35: 221-226 (2009) - [j6]Gladstone M. Arantes Jr., Felipe M. G. França, Carlos A. J. Martinhon:
Randomized generation of acyclic orientations upon anonymous distributed systems. J. Parallel Distributed Comput. 69(3): 239-246 (2009) - [c4]Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad:
Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119 - [c3]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
- [j5]Márcia R. Cerioli, Luérbio 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. Discret. Appl. Math. 156(12): 2270-2278 (2008) - [j4]Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi:
The Generalized Max-Controlled Set Problem. Electron. Notes Discret. Math. 30: 183-188 (2008) - [j3]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008) - [c2]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735 - 2004
- [j2]Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan:
Stronger K-tree relaxations for the vehicle routing problem. Eur. J. Oper. Res. 158(1): 56-71 (2004) - [c1]Carlos A. J. Martinhon, Fábio Protti:
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. WEA 2004: 341-355 - 2001
- [j1]Luciene C. S. Motta, Luiz Satoru Ochi, Carlos A. J. Martinhon:
Reduction Rules for the Covering Tour Problem. Electron. Notes Discret. Math. 7: 142-145 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
