@InProceedings{fomin_et_al:LIPIcs.STACS.2017.32,
  author =	{Fomin, Fedor V. and Lokshtanov, Daniel and Meesum, S. M. and Saurabh, Saket and Zehavi, Meirav},
  title =	{{Matrix Rigidity from the Viewpoint of Parameterized Complexity}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{32:1--32:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Vollmer, Heribert and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.32},
  URN =		{urn:nbn:de:0030-drops-70019},
  doi =		{10.4230/LIPIcs.STACS.2017.32},
  annote =	{Keywords: Matrix Rigidity, Parameterized Complexity, Linear Algebra}
}