@InProceedings{jansen_et_al:LIPIcs.IPEC.2015.163,
  author =	{Jansen, Bart M. P. and Pieterse, Astrid},
  title =	{{Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT}},
  booktitle =	{10th International Symposium on Parameterized and Exact Computation (IPEC 2015)},
  pages =	{163--174},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-92-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{43},
  editor =	{Husfeldt, Thore and Kanj, Iyad},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.163},
  URN =		{urn:nbn:de:0030-drops-55806},
  doi =		{10.4230/LIPIcs.IPEC.2015.163},
  annote =	{Keywords: sparsification, graph coloring, Hamiltonian cycle, satisfiability}
}