@InProceedings{itsykson_et_al:LIPIcs.MFCS.2016.51,
  author =	{Itsykson, Dmitry and Okhotin, Alexander and Oparin, Vsevolod},
  title =	{{Computational and Proof Complexity of Partial String Avoidability}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{51:1--51:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.51},
  URN =		{urn:nbn:de:0030-drops-64637},
  doi =		{10.4230/LIPIcs.MFCS.2016.51},
  annote =	{Keywords: partial strings, partial words, avoidability, proof complexity, PSPACE-completeness}
}