Mario Valencia-Pabon

53 papers A* 1B 1C 6Journal 44Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable.
ICALP
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 J jnl
Computing Distances on Graph Associahedra is Fixed-parameter Tractable.
CoRR
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 C conf
Spectral properties of stellohedra.
LAGOS
Ana Gargantini, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon
2024 J jnl
On the diameter of Schrijver graphs.
Discret. Appl. Math.
Agustina Victoria Ledezma, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon
2024 J jnl
On the total chromatic number of the direct product of cycles and complete graphs.
RAIRO Oper. Res.
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2024 J jnl
The rotation distance of brooms.
Eur. J. Comb.
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2022 J jnl
On restricted completions of chordal and trivially perfect graphs.
CoRR
Mitre Costa Dourado, Luciano N. Grippo, Mario Valencia-Pabon
2022 J jnl
On total and edge coloring some Kneser graphs.
J. Comb. Optim.
Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2021 C conf
Bounds on the Diameter of Graph Associahedra.
LAGOS
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2021 J jnl
Bounds on the Diameter of Graph Associahedra.
CoRR
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2021 J jnl
On the $P_3$-Hull Number of Kneser Graphs.
Electron. J. Comb.
Luciano N. Grippo, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon, Juan C. Vera
2021 C conf
On the diameter of Schrijver graphs.
LAGOS
Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon
2021 C conf
On total coloring the direct product of complete graphs.
LAGOS
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2020 J jnl
A note on homomorphisms of Kneser hypergraphs.
Appl. Math. Comput.
Flavia Bonomo-Braberman, Mitre Costa Dourado, Mario Valencia-Pabon, Juan C. Vera
2020 J jnl
On the P3-hull number of Hamming graphs.
Discret. Appl. Math.
Bostjan Bresar, Mario Valencia-Pabon
2020 J jnl
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017.
Discret. Appl. Math.
Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon
2019 J jnl
Independence number of products of Kneser graphs.
Discret. Math.
Bostjan Bresar, Mario Valencia-Pabon
2018 J jnl
On the (k, i)-coloring of cacti and complete graphs.
Ars Comb.
Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon
2018 J jnl
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Discret. Appl. Math.
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
2018 J jnl
k-tuple colorings of the Cartesian product of graphs.
Discret. Appl. Math.
Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon
2017 J jnl
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math.
Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
2017 J jnl
Shifts of the stable Kneser graphs and hom-idempotence.
Eur. J. Comb.
Pablo Daniel Torres, Mario Valencia-Pabon
2015 J jnl
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.
Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon
2015 J jnl
Complexity of the cluster deletion problem on subclasses of chordal graphs.
Theor. Comput. Sci.
Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon
2015 J jnl
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electron. Notes Discret. Math.
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
2015 J jnl
The packing chromatic number of hypercubes.
Discret. Appl. Math.
Pablo Daniel Torres, Mario Valencia-Pabon
2015 J jnl
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.
Algorithmica
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2015 J jnl
k-tuple chromatic number of the cartesian product of graphs.
Electron. Notes Discret. Math.
Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon
2014 J jnl
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math.
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
2014 J jnl
On the Minimum Sum Coloring of P 4-Sparse Graphs.
Graphs Comb.
Flavia Bonomo, Mario Valencia-Pabon
2014 C conf
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs.
ISCO
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2013 J jnl
On the packing chromatic number of hypercubes.
Electron. Notes Discret. Math.
Pablo Daniel Torres, Mario Valencia-Pabon
2013 J jnl
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs.
CoRR
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2011 J jnl
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math.
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
2011 J jnl
Minimum sum set coloring of trees and line graphs of trees.
Discret. Appl. Math.
Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon
2011 J jnl
On lower bounds for the b-chromatic number of connected bipartite graphs.
Electron. Notes Discret. Math.
Mekkia Kouider, Mario Valencia-Pabon
2010 J jnl
Idomatic partitions of direct products of complete graphs.
Discret. Math.
Mario Valencia-Pabon
2010 J jnl
Minimum sum edge colorings of multicycles.
Discret. Appl. Math.
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2009 J jnl
Minimum Sum Coloring of P
Electron. Notes Discret. Math.
Flavia Bonomo, Mario Valencia-Pabon
2009 C conf
Minimum Sum Set Coloring on some Subclasses of Block Graphs.
CTW
Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon
2009 J jnl
On the b-Coloring of Cographs and
Graphs Comb.
Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon
2008 J jnl
A distributed approximation algorithm for the minimum degree minimum weight spanning trees.
J. Parallel Distributed Comput.
Christian Lavault, Mario Valencia-Pabon
2008 J jnl
Chromatic Edge Strength of Some Multigraphs.
Electron. Notes Discret. Math.
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2007 J jnl
Chromatic Edge Strength of Some Multigraphs
CoRR
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2006 J jnl
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
CoRR
Christian Lavault, Mario Valencia-Pabon
2006 J jnl
Independence and coloring properties of direct products of some vertex-transitive graphs.
Discret. Math.
Mario Valencia-Pabon, Juan Vera
2005 J jnl
On approximating the b-chromatic number.
Discret. Appl. Math.
Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera
2005 J jnl
On the diameter of Kneser graphs.
Discret. Math.
Mario Valencia-Pabon, Juan-Carlos Vera
2003 J jnl
Revisiting Tucker's Algorithm to Color Circular Arc Graphs.
SIAM J. Comput.
Mario Valencia-Pabon
2003 J jnl
The permutation-path coloring problem on trees.
Theor. Comput. Sci.
Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise
2001 J jnl
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs.
Electron. Notes Discret. Math.
Mario Valencia-Pabon
2000 B conf
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
LATIN
Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon
1999 — conf
Message Scheduling on Trees under a Generalized Line-Communication Model.
ISPAN
Dominique Barth, Mario Valencia-Pabon