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

Mario Valencia-Pabon Vis

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

*2009
13EEFlavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon: Minimum Sum Set Coloring on some Subclasses of Block Graphs. CTW 2009: 195-198
2008
12EEJean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs. Electronic Notes in Discrete Mathematics 30: 39-44 (2008)
11EEChristian 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
10EEJean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs CoRR abs/0706.3848: (2007)
2006
9EEChristian Lavault, Mario Valencia-Pabon: A distributed approximation algorithm for the minimum degree minimum weight spanning trees CoRR abs/cs/0607031: (2006)
8EEMario Valencia-Pabon, Juan Vera: Independence and coloring properties of direct products of some vertex-transitive graphs. Discrete Mathematics 306(18): 2275-2281 (2006)
2005
7EESylvie Corteel, Mario Valencia-Pabon, Juan Carlos Vera: On approximating the b-chromatic number. Discrete Applied Mathematics 146(1): 106-110 (2005)
6EEMario Valencia-Pabon, Juan Carlos Vera: On the diameter of Kneser graphs. Discrete Mathematics 305(1-3): 383-385 (2005)
2003
5EEMario Valencia-Pabon: Revisiting Tucker's Algorithm to Color Circular Arc Graphs. SIAM J. Comput. 32(4): 1067-1072 (2003)
4EESylvie 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
3EEMario 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
1EEDominique Barth, Mario Valencia-Pabon: Message Scheduling on Trees under a Generalized Line-Communication Model. ISPAN 1999: 10-15

Coauthor Index

1Dominique Barth [1] [2] [4]
2Flavia Bonomo [13]
3Jean Cardinal [10] [12]
4Sylvie Corteel [2] [4] [7]
5Alain Denise [2] [4]
6Guillermo Durán [13]
7Danièle Gardy [2] [4]
8Christian Lavault [9] [11]
9Javier Marenco [13]
10Vlady Ravelomanana [10] [12]
11Juan Vera [8]
12Juan Carlos Vera [6] [7]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)