dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Carlos A. J. Martinhon Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIvairton 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)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot: The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM 2009: 621-632
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGladstone 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMá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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIvairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi: The Generalized Max-Controlled Set Problem. Electronic Notes in Discrete Mathematics 30: 183-188 (2008)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos A. J. Martinhon, Fábio Protti: An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. WEA 2004: 341-355
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuciene 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)

Coauthor Index

1A. Abouelaoualim [4] [7] [11] [12]
2Gladstone M. Arantes Jr. [8]
3Valentin Borozan [11]
4Márcia R. Cerioli [6]
5Kinkar Chandra Das [4] [7] [12]
6Luerbio Faria [4] [6] [7]
7Talita O. Ferreira [6]
8Felipe Maia Galvão França (Felipe M. G. França) [8]
9Laurent Gourvès [9] [10] [13] [15]
10Marek Karpinski [12]
11Abilio Lucena [2]
12Adria Lyra [9] [10] [13] [15]
13Nelson Maculan [2]
14Yannis Manoussakis [4] [7] [11] [12]
15Jérôme Monnot [9] [10] [13] [15]
16Luciene C. S. Motta [1]
17R. Muthu [11]
18Luiz Satoru Ochi (Luiz S. Ochi) [1] [5] [14]
19Fábio Protti [3] [6] [9] [16]
20Bruce A. Reed [6]
21Rachid Saad [4] [7] [11] [12]
22Ivairton M. Santos [5] [14]
23Wenceslas Fernandez de la Vega [12]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page