@InProceedings{meeks_et_al:LIPIcs.IPEC.2018.9,
author = {Meeks, Kitty and Skerman, Fiona},
title = {{The Parameterised Complexity of Computing the Maximum Modularity of a Graph}},
booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-084-2},
ISSN = {1868-8969},
year = {2019},
volume = {115},
editor = {Paul, Christophe and Pilipczuk, Michal},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.9},
URN = {urn:nbn:de:0030-drops-102103},
doi = {10.4230/LIPIcs.IPEC.2018.9},
annote = {Keywords: modularity, community detection, integer quadratic programming, vertex cover, pathwidth}
}