2008 |
12 | EE | Jean Cardinal,
Vlady Ravelomanana,
Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs.
Electronic Notes in Discrete Mathematics 30: 39-44 (2008) |
11 | EE | 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 |
10 | EE | Jean Cardinal,
Vlady Ravelomanana,
Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs
CoRR abs/0706.3848: (2007) |
2006 |
9 | EE | Christian Lavault,
Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
CoRR abs/cs/0607031: (2006) |
8 | EE | Mario Valencia-Pabon,
Juan Vera:
Independence and coloring properties of direct products of some vertex-transitive graphs.
Discrete Mathematics 306(18): 2275-2281 (2006) |
2005 |
7 | EE | Sylvie Corteel,
Mario Valencia-Pabon,
Juan Carlos Vera:
On approximating the b-chromatic number.
Discrete Applied Mathematics 146(1): 106-110 (2005) |
6 | EE | Mario Valencia-Pabon,
Juan Carlos Vera:
On the diameter of Kneser graphs.
Discrete Mathematics 305(1-3): 383-385 (2005) |
2003 |
5 | EE | Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular Arc Graphs.
SIAM J. Comput. 32(4): 1067-1072 (2003) |
4 | EE | 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 |
3 | EE | Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs.
Electronic Notes in Discrete Mathematics 7: 198-201 (2001) |
2000 |
2 | | 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 |
1 | EE | Dominique Barth,
Mario Valencia-Pabon:
Message Scheduling on Trees under a Generalized Line-Communication Model.
ISPAN 1999: 10-15 |