Victor A. Campos

Orcid: 0000-0002-2730-4640

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the hull number on cycle convexity of graphs.
Inf. Process. Lett., January, 2024

2023
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica, October, 2023

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.
Algorithmica, February, 2023

Deciding the Erdős-Pósa Property in 3-Connected Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds.
Algorithmica, 2022

2021
Edge-Disjoint Branchings in Temporal Digraphs.
Electron. J. Comb., 2021

Coloring Problems on Bipartite Graphs of Small Diameter.
Electron. J. Comb., 2021

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Cycle convexity and the tunnel number of links.
CoRR, 2020

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Algorithmica, 2020

Dual Parameterization of Weighted Coloring.
Algorithmica, 2020

Edge-Disjoint Branchings in Temporal Graphs.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Adapting The Directed Grid Theorem into an FPT Algorithm.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Edge-b-Coloring Trees.
Algorithmica, 2018

2016
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

2015
A Proof for a Conjecture of Gorgol.
Electron. Notes Discret. Math., 2015

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 P<sub>4</sub>'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

2014
Maximization coloring problems on graphs with few P<sub>4</sub>.
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

2013
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

Transversals in Trees.
J. Graph Theory, 2013

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

b-Coloring graphs with large girth.
J. Braz. Comput. 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

2011
Restricted coloring problems on graphs with few P'<sub>4</sub>s.
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

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

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


  Loading...