Mario Valencia-Pabon

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 18

Top Topics

Cartesian Product

Bipartite Graph

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Agustina Victoria Ledezma, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon
On the diameter of Schrijver graphs. Discret. Appl. Math. 350 (2024)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
The rotation distance of brooms. Eur. J. Comb. 118 (2024)
Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
On total and edge coloring some Kneser graphs. J. Comb. Optim. 44 (1) (2022)
Mitre Costa Dourado, Luciano N. Grippo, Mario Valencia-Pabon
On restricted completions of chordal and trivially perfect graphs. CoRR (2022)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Bounds on the Diameter of Graph Associahedra. CoRR (2021)
Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon
On the diameter of Schrijver graphs. LAGOS (2021)
Luciano N. Grippo, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon, Juan C. Vera
On the $P_3$-Hull Number of Kneser Graphs. Electron. J. Comb. 28 (3) (2021)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Bounds on the Diameter of Graph Associahedra. LAGOS (2021)
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, D. Sasaki, Mario Valencia-Pabon
On total coloring the direct product of complete graphs. LAGOS (2021)
Flavia Bonomo-Braberman, Mitre Costa Dourado, Mario Valencia-Pabon, Juan C. Vera
A note on homomorphisms of Kneser hypergraphs. Appl. Math. Comput. 366 (2020)
Bostjan Bresar, Mario Valencia-Pabon
On the P3-hull number of Hamming graphs. Discret. Appl. Math. 282 (2020)
Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. Discret. Appl. Math. 281 (2020)
Bostjan Bresar, Mario Valencia-Pabon
Independence number of products of Kneser graphs. Discret. Math. 342 (4) (2019)
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234 (2018)
Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon
k-tuple colorings of the Cartesian product of graphs. Discret. Appl. Math. 245 (2018)
Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon
On the (k, i)-coloring of cacti and complete graphs. Ars Comb. 137 (2018)
Pablo Daniel Torres, Mario Valencia-Pabon
Shifts of the stable Kneser graphs and hom-idempotence. Eur. J. Comb. 62 (2017)
Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62 (2017)
Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon
k-tuple chromatic number of the cartesian product of graphs. Electron. Notes Discret. Math. 50 (2015)
Pablo Daniel Torres, Mario Valencia-Pabon
The packing chromatic number of hypercubes. Discret. Appl. Math. (2015)
Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs. Inf. Process. Lett. 115 (6-8) (2015)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73 (2) (2015)
Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon
Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor. Comput. Sci. 600 (2015)
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50 (2015)
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. Discret. Appl. Math. 164 (2014)
Flavia Bonomo, Mario Valencia-Pabon
On the Minimum Sum Coloring of P 4-Sparse Graphs. Graphs Comb. 30 (2) (2014)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO (2014)
Pablo Daniel Torres, Mario Valencia-Pabon
On the packing chromatic number of hypercubes. Electron. Notes Discret. Math. 44 (2013)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR (2013)
Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon
Minimum sum set coloring of trees and line graphs of trees. Discret. Appl. Math. 159 (5) (2011)
Mekkia Kouider, Mario Valencia-Pabon
On lower bounds for the b-chromatic number of connected bipartite graphs. Electron. Notes Discret. Math. 37 (2011)
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 37 (2011)
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
Minimum sum edge colorings of multicycles. Discret. Appl. Math. 158 (12) (2010)
Mario Valencia-Pabon
Idomatic partitions of direct products of complete graphs. Discret. Math. 310 (5) (2010)
Flavia Bonomo, Mario Valencia-Pabon
-sparse graphs. Electron. Notes Discret. Math. 35 (2009)
Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon
-Sparse Graphs. Graphs Comb. 25 (2) (2009)
Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon
Minimum Sum Set Coloring on some Subclasses of Block Graphs. CTW (2009)
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
Chromatic Edge Strength of Some Multigraphs. Electron. Notes Discret. Math. 30 (2008)
Christian Lavault, Mario Valencia-Pabon
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distributed Comput. 68 (2) (2008)
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
Chromatic Edge Strength of Some Multigraphs CoRR (2007)
Mario Valencia-Pabon, Juan Vera
Independence and coloring properties of direct products of some vertex-transitive graphs. Discret. Math. 306 (18) (2006)
Christian Lavault, Mario Valencia-Pabon
A distributed approximation algorithm for the minimum degree minimum weight spanning trees CoRR (2006)
Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera
On approximating the b-chromatic number. Discret. Appl. Math. 146 (1) (2005)
Mario Valencia-Pabon, Juan-Carlos Vera
On the diameter of Kneser graphs. Discret. Math. 305 (1-3) (2005)
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) (2003)
Mario Valencia-Pabon
Revisiting Tucker's Algorithm to Color Circular Arc Graphs. SIAM J. Comput. 32 (4) (2003)
Mario Valencia-Pabon
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs. Electron. Notes Discret. Math. 7 (2001)
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)
Dominique Barth, Mario Valencia-Pabon
Message Scheduling on Trees under a Generalized Line-Communication Model. ISPAN (1999)