@InProceedings{defigueiredo_et_al:LIPIcs.MFCS.2021.38,
author = {de Figueiredo, Celina M. H. and de Melo, Alexsander A. and Oliveira, Fabiano S. and Silva, Ana},
title = {{Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.38},
URN = {urn:nbn:de:0030-drops-144781},
doi = {10.4230/LIPIcs.MFCS.2021.38},
annote = {Keywords: maximum cut, interval graphs, interval lengths, interval count, NP-complete}
}