Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (Electron. Notes Discret. Math., 2017)

On the Width of Regular Classes of Finite Structures. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (CADE, 2019)

Symbolic Solutions for Symbolic Constraint Satisfaction Problems. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (KR, 2020)

Maximum cut on interval graphs of interval count five is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (CoRR, 2020)

A multivariate analysis of the strict terminal connection problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (J. Comput. Syst. Sci., 2020)

On the Terminal Connection Problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (SOFSEM, 2021)

On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton dos Santos Souza (Networks, 2021)

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (WALCOM, 2022)

Computing the zig-zag number of directed graphs. - Mitre Costa Dourado; Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Mateus de Oliveira Oliveira; Uéverton S. Souza (Discret. Appl. Math., 2022)

Revising Johnson's table for the 21st century. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Diana Sasaki; Ana Silva 001 (Discret. Appl. Math., 2022)

Second-Order Finite Automata. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (Theory Comput. Syst., 2022)

On the computational difficulty of the terminal connection problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (RAIRO Theor. Informatics Appl., 2023)

MaxCut on permutation graphs is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (J. Graph Theory, 2023)

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (Networks, 2024)

Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (Discret. Comput. Geom., 2024)