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.

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Amedeo Napoli

Mario Valencia-Pabon

Inf. Process. Lett., 2015

k-tuple chromatic number of the cartesian product of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

On the Minimum Sum Coloring of P 4-Sparse Graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Mario Valencia-Pabon

Graphs Comb., 2014

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.

[BibT_eX]

[DOI]

Flavia Bonomo

Thomas M. Liebling

Javier Marenco

Jayme Luiz Szwarcfiter

Mario Valencia-Pabon

Discret. Appl. Math., 2014

2013

On the packing chromatic number of hypercubes.

[BibT_eX]

[DOI]

Pablo Daniel Torres

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2013

2011

On lower bounds for the b-chromatic number of connected bipartite graphs.

[BibT_eX]

[DOI]

Mekkia Kouider

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.

[BibT_eX]

[DOI]

Flavia Bonomo

Thomas M. Liebling

Javier Marenco

Jayme Luiz Szwarcfiter

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2011

Minimum sum set coloring of trees and line graphs of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Idomatic partitions of direct products of complete graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

Discret. Math., 2010

Minimum sum edge colorings of multicycles.

[BibT_eX]

[DOI]

Jean Cardinal

Vlady Ravelomanana

Mario Valencia-Pabon

Discret. Appl. Math., 2010

2009

On the b-Coloring of Cographs and P4-Sparse Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Minimum Sum Coloring of P4-sparse graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2009

Minimum Sum Set Coloring on some Subclasses of Block Graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

A distributed approximation algorithm for the minimum degree minimum weight spanning trees.

[BibT_eX]

[DOI]

Christian Lavault

Mario Valencia-Pabon

J. Parallel Distributed Comput., 2008

Chromatic Edge Strength of Some Multigraphs.

[BibT_eX]

[DOI]

Jean Cardinal

Vlady Ravelomanana

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2008

2006

Independence and coloring properties of direct products of some vertex-transitive graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

Juan Vera

Discret. Math., 2006

2005

On the diameter of Kneser graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

Juan-Carlos Vera

Discret. Math., 2005

On approximating the b-chromatic number.

[BibT_eX]

[DOI]

Sylvie Corteel

Mario Valencia-Pabon

Juan-Carlos Vera

Discret. Appl. Math., 2005

2003

The permutation-path coloring problem on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2001

Revisiting Tucker's Algorithm to Color Circular-Arc Graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2001

2000

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Message Scheduling on Trees under a Generalized Line-Communication Model.

[BibT_eX]

[DOI]

Dominique Barth

Mario Valencia-Pabon

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Mario Valencia-Pabon

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...