2 papers
cs.CC2022
MaxCut on Permutation Graphs is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira +1
In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide t…
cs.CC2021
Revising Johnson's table for the 21st century
Celina M. H. de Figueiredo, Alexsander A. de Melo, Diana Sasaki +1
What does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 "Graph Restrictions and Their Effect" of D. S.…