BibTeX record conf/iwpec/MeeksS18

download as .bib file

@inproceedings{DBLP:conf/iwpec/MeeksS18,
  author       = {Kitty Meeks and
                  Fiona Skerman},
  editor       = {Christophe Paul and
                  Michal Pilipczuk},
  title        = {The Parameterised Complexity of Computing the Maximum Modularity of
                  a Graph},
  booktitle    = {13th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
  series       = {LIPIcs},
  volume       = {115},
  pages        = {9:1--9:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2018.9},
  doi          = {10.4230/LIPICS.IPEC.2018.9},
  timestamp    = {Fri, 27 Mar 2020 08:57:23 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/MeeksS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.