@InProceedings{marx_et_al:LIPIcs.ICALP.2021.95,
  author =	{Marx, D\'{a}niel and Sankar, Govind S. and Schepper, Philipp},
  title =	{{Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth}},
  booktitle =	{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
  pages =	{95:1--95:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-195-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{198},
  editor =	{Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.95},
  URN =		{urn:nbn:de:0030-drops-141647},
  doi =		{10.4230/LIPIcs.ICALP.2021.95},
  annote =	{Keywords: General Factor, General Matching, Treewidth, Cutwidth}
}