@InProceedings{gupta_et_al:LIPIcs.FSTTCS.2020.24,
  author =	{Gupta, Sushmita and Jain, Pallavi and Roy, Sanjukta and Saurabh, Saket and Zehavi, Meirav},
  title =	{{On the (Parameterized) Complexity of Almost Stable Marriage}},
  booktitle =	{40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
  pages =	{24:1--24:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-174-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{182},
  editor =	{Saxena, Nitin and Simon, Sunil},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.24},
  URN =		{urn:nbn:de:0030-drops-132655},
  doi =		{10.4230/LIPIcs.FSTTCS.2020.24},
  annote =	{Keywords: Stable Matching, Parameterized Complexity, Local Search}
}