Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{meeks_et_al:LIPIcs:2019:10210, author = {Kitty Meeks and Fiona Skerman}, 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:19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770842}, ISSN = {18688969}, year = {2019}, volume = {115}, editor = {Christophe Paul and Michal Pilipczuk}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10210}, URN = {urn:nbn:de:0030drops102103}, doi = {10.4230/LIPIcs.IPEC.2018.9}, annote = {Keywords: modularity, community detection, integer quadratic programming, vertex cover, pathwidth} }
Keywords:  modularity, community detection, integer quadratic programming, vertex cover, pathwidth  
Seminar:  13th International Symposium on Parameterized and Exact Computation (IPEC 2018)  
Issue Date:  2019  
Date of publication:  25.01.2019 