Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001. Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{FigueiredoMO021,
title = {Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete},
author = {Celina M. H. de Figueiredo and Alexsander Andrade de Melo and Fabiano de S. Oliveira and Ana Silva 0001},
year = {2021},
doi = {10.4230/LIPIcs.MFCS.2021.38},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.38},
researchr = {https://researchr.org/publication/FigueiredoMO021},
cites = {0},
citedby = {0},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia},
editor = {Filippo Bonchi and Simon J. Puglisi},
volume = {202},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-201-3},
}