On subbetweennesses of trees: Hardness, algorithms, and characterizations. - Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Comput. Math. Appl., 2011)

Characterization and representation problems for intersection betweennesses. - Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2011)

On the Radon Number for P 3-Convexity. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (LATIN, 2012)

An upper bound on the P3-Radon number. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (Discret. Math., 2012)

Characterization and recognition of Radon-independent sets in split graphs. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2012)

On total coloring and equitable total coloring of cubic graphs with large girth. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (CTW, 2013)

Algorithmic and structural aspects of the P 3-Radon number. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (Ann. Oper. Res., 2013)

On Minimal and Minimum Hull Sets. - Rommel M. Barbosa; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2013)

On the Carathéodory number of interval and graph convexities. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2013)

Recognizing Threshold Tolerance Graphs in O(n2) Time. - Petr A. Golovach; Pinar Heggernes; Nathan Lindzey; Ross M. McConnell; Vinícius Fernandes dos Santos; Jeremy P. Spinrad (WG, 2014)

Complexity aspects of the computation of the rank of a graph. - Igor da Fonseca Ramos; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2014)

Irreversible conversion processes with deadlines. - Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer (J. Discrete Algorithms, 2014)

Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. - Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CTW, 2015)

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (WG, 2015)

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (Electron. Notes Discret. Math., 2015)

A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem. - João F. M. Sarubbi; Caio Mário Mesquita; Elizabeth F. Wanner; Vinícius Fernandes dos Santos; Cristiano M. Silva (NOMS, 2016)

On the equitable total chromatic number of cubic graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Appl. Math., 2016)

On the total coloring of generalized Petersen graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Math., 2016)

Combining rules and proportions: A multiobjective approach to algorithmic composition. - Henrique Barros Lopes; Flávio Vinícius Cruzeiro Martins; Rodrigo T. N. Cardoso; Vinícius Fernandes dos Santos (CEC, 2017)

Connectivity with backbone structures in obstructed wireless networks. - Manassés Ferreira Neto; Olga Goussevskaia; Vinícius Fernandes dos Santos (Comput. Networks, 2017)

On recognition of threshold tolerance graphs and their complements. - Petr A. Golovach; Pinar Heggernes; Nathan Lindzey; Ross M. McConnell; Vinícius Fernandes dos Santos; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2017)

Qubit allocation. - Marcos Yukio Siraichi; Vinícius Fernandes dos Santos; Caroline Collange; Fernando Magno Quintão Pereira (CGO, 2018)

Infraestrutura de acesso em redes sem fio obstruídas: da Intratabilidade à Conectividade. - Manassés Ferreira Neto; Olga Goussevskaia; Vinícius Fernandes dos Santos (SBRC Companion, 2018)

The convexity of induced paths of order three and applications: Complexity aspects. - Rafael T. Araújo; Rudini M. Sampaio; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs. - Sérgio H. Nogueira; Vinícius Fernandes dos Santos (Electron. Notes Discret. Math., 2018)

Bigfoot Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors. - Lucas José Carneiro Maciel; Jônatas Alves; Vinícius Fernandes dos Santos; Loïc Cerf (EUSFLAT Conf., 2019)

Parameterized Complexity of Equitable Coloring. - Guilherme de C. M. Gomes; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos (Discret. Math. Theor. Comput. Sci., 2019)

Preface. - Gabriel Coutinho; Yoshiharu Kohayakawa; Vinícius Fernandes dos Santos; Sebastián Urrutia (LAGOS, 2019)

Qubit allocation as a combination of subgraph isomorphism and token swapping. - Marcos Yukio Siraichi; Vinícius Fernandes dos Santos; Caroline Collange; Fernando Magno Quintão Pereira (Proc. ACM Program. Lang., 2019)

One-Sided Weak Dominance Drawing. - Rodrigo Ferreira da Silva; Sebastián Urrutia; Vinícius Fernandes dos Santos (Theor. Comput. Sci., 2019)

Structural Parameterizations for Equitable Coloring. - Guilherme de C. M. Gomes; Matheus R. Guedes; Vinícius Fernandes dos Santos (LATIN, 2020)

Dual Parameterization of Weighted Coloring. - Júlio Araújo 001; Victor A. Campos; Carlos Vinícius G. C. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Ana Silva 001 (Algorithmica, 2020)

Some results on Vertex Separator Reconfiguration. - Guilherme de C. M. Gomes; Sérgio H. Nogueira; Vinícius Fernandes dos Santos (CoRR, 2020)

FPT and kernelization algorithms for the k-in-a-tree problem. - Guilherme de C. M. Gomes; Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CoRR, 2020)

Characterizations, probe and sandwich problems on (k, ℓ)-cographs. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein; Vinícius Fernandes dos Santos (Discret. Appl. Math., 2020)

On the computational complexity of closest genome problems. - Luís Felipe I. Cunha; Pedro Feijão; Vinícius Fernandes dos Santos; Luis Antonio Brasil Kowada; Celina M. H. de Figueiredo (Discret. Appl. Math., 2020)

Intersection graph of maximal stars. - Guilherme de C. M. Gomes; Marina Groshaus; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos (Discret. Appl. Math., 2020)

Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors. - Lucas Maciel 002; Jônatas Alves; Vinícius Fernandes dos Santos; Loïc Cerf (Int. J. Comput. Intell. Syst., 2020)

Covering graphs with convex sets and partitioning graphs into convex sets. - Lucía M. González; Luciano N. Grippo; Martín D. Safe; Vinícius Fernandes dos Santos (Inf. Process. Lett., 2020)

FPT and Kernelization Algorithms for the Induced Tree Problem. - Guilherme de Castro Mendes Gomes; Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CIAC, 2021)

Parameterized algorithms for locating-dominating sets. - Márcia R. Cappelle; Guilherme C. M. Gomes; Vinícius Fernandes dos Santos (LAGOS, 2021)

Kernelization results for Equitable Coloring. - Guilherme de C. M. Gomes; Vinícius Fernandes dos Santos (LAGOS, 2021)

On structural parameterizations of the selective coloring problem. - Guilherme C. M. Gomes; Vinícius Fernandes dos Santos (LAGOS, 2021)

Reducing graph transversals via edge contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza (J. Comput. Syst. Sci., 2021)

On the proper orientation number of chordal graphs. - Júlio Araújo 001; Alexandre A. Cezar; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos; Ana Silva 001 (Theor. Comput. Sci., 2021)

On the arboreal jump number of a poset. - Evellyn S. Cavalcante; Sebastián Urrutia; Vinícius Fernandes dos Santos (CoRR, 2022)

Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil. - Vinícius Fernandes dos Santos; Sebastián Urrutia (Discret. Appl. Math., 2022)

A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. - Iago A. Carvalho; Thiago F. Noronha; Christophe Duhamel; Luiz Filipe M. Vieira; Vinícius Fernandes dos Santos (Int. Trans. Oper. Res., 2023)

Reducing the vertex cover number via edge contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza; Prafullkumar Tale (J. Comput. Syst. Sci., 2023)

Disconnected matchings. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2023)

Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization. - Guilherme C. M. Gomes; Matheus R. Guedes; Vinícius Fernandes dos Santos (Algorithmica, 2023)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration. - Guilherme C. M. Gomes; Emanuel Juliano; Gabriel Martins; Vinícius Fernandes dos Santos (IPEC, 2024)

Finding the Minimum Cost Acceptable Element in a Sorted Matrix. - Sebastián Urrutia; Vinícius Fernandes dos Santos (SEA, 2024)

Complexity of Deciding the Equality of Matching Numbers. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter; Florian Werner 003 (CoRR, 2024)

Edge deletion to tree-like graph classes. - Ivo Koch; Nina Pardal; Vinícius Fernandes dos Santos (Discret. Appl. Math., 2024)

Minimum separator reconfiguration. - Guilherme C. M. Gomes; Clément Legrand-Duchesne; Reem Mahmoud; Amer E. Mouawad; Yoshio Okamoto; Vinícius Fernandes dos Santos; Tom C. van der Zanden (J. Comput. Syst. Sci., 2024)

Distinct sizes of maximal independent sets on graphs with restricted girth. - Márcia R. Cappelle; Julliano Rosa Nascimento; Vinícius Fernandes dos Santos (RAIRO Oper. Res., 2024)

On the computational complexity of the strong geodetic recognition problem. - Carlos V. G. C. Lima; Vinícius Fernandes dos Santos; João H. G. Sousa; Sebastián Alberto Urrutia (RAIRO Oper. Res., 2024)

Polynomial time algorithms for the token swapping problem on cographs. - Caio Henrique Segawa Tonetti; Vinícius Fernandes dos Santos; Sebastián Urrutia (RAIRO Oper. Res., 2024)

Integer programming formulations for the k $k$ -in-a-tree problem in graphs. - Lucas Saldanha Ferreira; Vinícius Fernandes dos Santos; Cristiano Arbex Valle (Int. Trans. Oper. Res., 2024)

Computational complexity and linear formulations for optimizing the location of shared mobility stations. - Cristiano Martins Monteiro; Vinícius Fernandes dos Santos; Clodoveu Augusto Davis Junior (Int. Trans. Oper. Res., 2024)

On the proper interval completion problem within some chordal subclasses. - François Dross; Claire Hilaire; Ivo Koch; Valeria Leoni; Nina Pardal; María Inés Lopez Pujato; Vinícius Fernandes dos Santos (Discret. Math., 2025)

Weighted connected matchings. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2025)

Exploring subgraph complementation to bounded degree graphs. - Ivo Koch; Nina Pardal; Vinícius Fernandes dos Santos (CoRR, 2025)