Victor A. Campos

According to our database1, Victor A. Campos authored at least 26 papers between 2005 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




On the Search for Retrotransposons: Alternative Protocols to Obtain Sequences to Learn Profile Hidden Markov Models.
Journal of Computational Biology, 2018

Edge-b-Coloring Trees.
Algorithmica, 2018

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Dual Parameterization of Weighted Coloring.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

The maximum infection time in the geodesic and monophonic convexities.
Theor. Comput. Sci., 2016

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.
Discret. Appl. Math., 2016

Complexity of determining the maximum infection time in the geodetic convexity.
Electron. Notes Discret. Math., 2015

Graphs of girth at least 7 have high b-chromatic number.
Eur. J. Comb., 2015

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects.
Eur. J. Comb., 2015

The b-chromatic index of graphs.
Discret. Math., 2015

Graphs with few P4's under the convexity of paths of order three.
Discret. Appl. Math., 2015

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR, 2015

Maximization coloring problems on graphs with few P4.
Discret. Appl. Math., 2014

Fixed-parameter algorithms for the cocoloring problem.
Discret. Appl. Math., 2014

Connected Greedy Colourings.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Backbone colouring: Tree backbones with small diameter in planar graphs.
Theor. Comput. Sci., 2013

On the hull number of some graph classes.
Theor. Comput. Sci., 2013

New Bounds on the Grundy Number of Products of Graphs.
Journal of Graph Theory, 2012

b-Coloring graphs with large girth.
J. Braz. Comp. Soc., 2012

Graphs with Few P4's Under the Convexity of Paths of Order Three.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Restricted coloring problems on graphs with few P'4s.
Electron. Notes Discret. Math., 2011

On the hull number of some graph classes.
Electron. Notes Discret. Math., 2011

Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings
CoRR, 2011

Two Fixed-Parameter Algorithms for the Cocoloring Problem.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

b-chromatic number of cacti.
Electron. Notes Discret. Math., 2009

On the asymmetric representatives formulation for the vertex coloring problem.
Electron. Notes Discret. Math., 2005