Alexsander Andrade de Melo

Fabiano de S. Oliveira

Discret. Comput. Geom., April, 2024

2023

MaxCut on permutation graphs is NP-complete.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

J. Graph Theory, September, 2023

On the computational difficulty of the terminal connection problem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

2022

Second-Order Finite Automata.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Revising Johnson's table for the 21st century.

[BibT_eX]

[DOI]

Diana Sasaki

Discret. Appl. Math., 2022

Computing the zig-zag number of directed graphs.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Discret. Appl. Math., 2022

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.

[BibT_eX]

[DOI]

Raul Lopes

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.

[BibT_eX]

[DOI]

Uéverton dos Santos Souza

Networks, 2021

On the Terminal Connection Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

A multivariate analysis of the strict terminal connection problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Maximum cut on interval graphs of interval count five is NP-complete.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

CoRR, 2020

Symbolic Solutions for Symbolic Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

On the Width of Regular Classes of Finite Structures.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 27, 2019

2017

Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.

[BibT_eX]

[DOI]