@InProceedings{bazgan_et_al:LIPIcs.SWAT.2022.13,
author = {Bazgan, Cristina and Casel, Katrin and Cazals, Pierre},
title = {{Dense Graph Partitioning on Sparse and Dense Graphs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.13},
URN = {urn:nbn:de:0030-drops-161732},
doi = {10.4230/LIPIcs.SWAT.2022.13},
annote = {Keywords: NP-hardness, approximation, density, graph partitioning, bipartite graphs, cubic graphs, dense graphs}
}