@InProceedings{bliem:OASIcs.ICLP.2017.12,
  author =	{Bliem, Bernhard},
  title =	{{Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{12:1--12:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.12},
  URN =		{urn:nbn:de:0030-drops-84656},
  doi =		{10.4230/OASIcs.ICLP.2017.12},
  annote =	{Keywords: answer set programming, treewidth, secure set, defensive alliance, parameterized complexity}
}