Advancements on SEFE and Partitioned Book Embedding problems

Finally, we prove that the problem of maximizing the number of edges that are drawn the same in a SEFE of two graphs (optimization of SEFE) is NP-complete, even in several restricted settings.