Vinícius Fernandes dos Santos
Orcid: 0000-0002-4608-4559Affiliations:
- Federal University of Minas Gerais, Belo Horizonte, Brazil
According to our database1,
Vinícius Fernandes dos Santos
authored at least 63 papers
between 2011 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Discret. Math., 2025
2024
Computational complexity and linear formulations for optimizing the location of shared mobility stations.
Int. Trans. Oper. Res., September, 2024
Int. Trans. Oper. Res., September, 2024
RAIRO Oper. Res., January, 2024
RAIRO Oper. Res., 2024
RAIRO Oper. Res., 2024
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024
2023
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization.
Algorithmica, July, 2023
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
Int. Trans. Oper. Res., 2023
2022
Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil.
Discret. Appl. Math., 2022
Proceedings of the LATIN 2022: Theoretical Informatics, 2022
2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Inf. Process. Lett., 2020
Int. J. Comput. Intell. Syst., 2020
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
Proc. ACM Program. Lang., 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Discret. Math. Theor. Comput. Sci., 2019
Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology, 2019
2018
Characterization by forbidden induced subgraphs of some subclasses of chordal graphs.
Electron. Notes Discret. Math., 2018
Discret. Appl. Math., 2018
Infraestrutura de acesso em redes sem fio obstruídas: da Intratabilidade à Conectividade.
Proceedings of the Companion Proceedings of the 36th Brazilian Symposium on Computer Networks and Distributed Systems, 2018
Proceedings of the 2018 International Symposium on Code Generation and Optimization, 2018
2017
Discret. Appl. Math., 2017
Comput. Networks, 2017
Combining rules and proportions: A multiobjective approach to algorithmic composition.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
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
2015
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
Electron. Notes Discret. Math., 2015
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
2014
Discret. Math. Theor. Comput. Sci., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2013
Theor. Comput. Sci., 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
2012
Inf. Process. Lett., 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
Discret. Appl. Math., 2011
Comput. Math. Appl., 2011