@InProceedings{jonsson_et_al:LIPIcs.CP.2021.32,
  author =	{Jonsson, Peter and Lagerkvist, Victor and Ordyniak, Sebastian},
  title =	{{Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors}},
  booktitle =	{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
  pages =	{32:1--32:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-211-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{210},
  editor =	{Michel, Laurent D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.32},
  URN =		{urn:nbn:de:0030-drops-153238},
  doi =		{10.4230/LIPIcs.CP.2021.32},
  annote =	{Keywords: Constraint Satisfaction Problems, Parameterised Complexity, Backdoors}
}