Vinícius Fernandes dos Santos

According to our database1, Vinícius Fernandes dos Santos authored at least 41 papers between 2011 and 2020.

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



In proceedings 
PhD thesis 


Online presence:



Covering graphs with convex sets and partitioning graphs into convex sets.
Inf. Process. Lett., 2020

Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors.
Int. J. Comput. Intell. Syst., 2020

Intersection graph of maximal stars.
Discret. Appl. Math., 2020

On the computational complexity of closest genome problems.
Discret. Appl. Math., 2020

Characterizations, probe and sandwich problems on (k, ℓ)-cographs.
Discret. Appl. Math., 2020

Parameterized algorithms for locating-dominating sets.
CoRR, 2020

On structural parameterizations of the selective coloring problem.
CoRR, 2020

On the proper orientation number of chordal graphs.
CoRR, 2020

FPT and kernelization algorithms for the k-in-a-tree problem.
CoRR, 2020

Some results on Vertex Separator Reconfiguration.
CoRR, 2020

Dual Parameterization of Weighted Coloring.
Algorithmica, 2020

Reducing Graph Transversals via Edge Contractions.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Structural Parameterizations for Equitable Coloring.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

One-Sided Weak Dominance Drawing.
Theor. Comput. Sci., 2019

Qubit allocation as a combination of subgraph isomorphism and token swapping.
Proc. ACM Program. Lang., 2019

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Parameterized Complexity of Equitable Coloring.
Discret. Math. Theor. Comput. Sci., 2019

Bigfoot Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors.
Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology, 2019

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs.
Electron. Notes Discret. Math., 2018

The convexity of induced paths of order three and applications: Complexity aspects.
Discret. Appl. Math., 2018

Qubit allocation.
Proceedings of the 2018 International Symposium on Code Generation and Optimization, 2018

On recognition of threshold tolerance graphs and their complements.
Discret. Appl. Math., 2017

Connectivity with backbone structures in obstructed wireless networks.
Comput. Networks, 2017

Combining rules and proportions: A multiobjective approach to algorithmic composition.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

On the total coloring of generalized Petersen graphs.
Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math., 2016

A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
Electron. Notes Discret. Math., 2015

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial time algorithm for the k-in-a-tree problem on chordal graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Irreversible conversion processes with deadlines.
J. Discrete Algorithms, 2014

Recognizing Threshold Tolerance Graphs in O(n<sup>2</sup>) Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci., 2013

On Minimal and Minimum Hull Sets.
Electron. Notes Discret. Math., 2013

Algorithmic and structural aspects of the P 3-Radon number.
Ann. Oper. Res., 2013

On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Characterization and recognition of Radon-independent sets in split graphs.
Inf. Process. Lett., 2012

An upper bound on the P<sub>3</sub>-Radon number.
Discret. Math., 2012

On the Radon Number for P 3-Convexity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Characterization and representation problems for intersection betweennesses.
Discret. Appl. Math., 2011

On subbetweennesses of trees: Hardness, algorithms, and characterizations.
Comput. Math. Appl., 2011