- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j15 |      | Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon: Minimum sum set coloring of trees and line graphs of trees. Discrete Applied Mathematics 159(5): 288-294 (2011) |
| j14 | | Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon: LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electronic Notes in Discrete Mathematics 37: 1-2 (2011) |
| j13 | | Mekkia Kouider, Mario Valencia-Pabon: On lower bounds for the b-chromatic number of connected bipartite graphs. Electronic Notes in Discrete Mathematics 37: 399-404 (2011) |
| 2010 | ||
| j12 | | Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Minimum sum edge colorings of multicycles. Discrete Applied Mathematics 158(12): 1216-1223 (2010) |
| j11 | | Mario Valencia-Pabon: Idomatic partitions of direct products of complete graphs. Discrete Mathematics 310(5): 1118-1122 (2010) |
| 2009 | ||
| j10 | | Flavia Bonomo, Mario Valencia-Pabon: Minimum Sum Coloring of P4-sparse graphs. Electronic Notes in Discrete Mathematics 35: 293-298 (2009) |
| j9 | | Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon: On the b-Coloring of Cographs and P4-Sparse Graphs. Graphs and Combinatorics 25(2): 153-167 (2009) |
| c3 | | Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon: Minimum Sum Set Coloring on some Subclasses of Block Graphs. CTW 2009: 195-198 |
| 2008 | ||
| j8 | | Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs. Electronic Notes in Discrete Mathematics 30: 39-44 (2008) |
| j7 | | Christian Lavault, Mario Valencia-Pabon: A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distrib. Comput. 68(2): 200-208 (2008) |
| 2007 | ||
| i2 | | Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs. CoRR abs/0706.3848 (2007) |
| 2006 | ||
| j6 | | Mario Valencia-Pabon, Juan Vera: Independence and coloring properties of direct products of some vertex-transitive graphs. Discrete Mathematics 306(18): 2275-2281 (2006) |
| i1 | | Christian Lavault, Mario Valencia-Pabon: A distributed approximation algorithm for the minimum degree minimum weight spanning trees. CoRR abs/cs/0607031 (2006) |
| 2005 | ||
| j5 | | Sylvie Corteel, Mario Valencia-Pabon, Juan Carlos Vera: On approximating the b-chromatic number. Discrete Applied Mathematics 146(1): 106-110 (2005) |
| j4 | | Mario Valencia-Pabon, Juan Carlos Vera: On the diameter of Kneser graphs. Discrete Mathematics 305(1-3): 383-385 (2005) |
| 2003 | ||
| j3 | | Mario Valencia-Pabon: Revisiting Tucker's Algorithm to Color Circular Arc Graphs. SIAM J. Comput. 32(4): 1067-1072 (2003) |
| j2 | | Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise: The permutation-path coloring problem on trees. Theor. Comput. Sci. 297(1-3): 119-143 (2003) |
| 2001 | ||
| j1 | | Mario Valencia-Pabon: Revisiting Tucker's Algorithm to Color Circular-Arc Graphs. Electronic Notes in Discrete Mathematics 7: 198-201 (2001) |
| 2000 | ||
| c2 | | Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon: On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. LATIN 2000: 308-317 |
| 1999 | ||
| c1 | | Dominique Barth, Mario Valencia-Pabon: Message Scheduling on Trees under a Generalized Line-Communication Model. ISPAN 1999: 10-15 |
Colors in the list of coauthors
Last update Sat May 18 10:02:15 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page