@InProceedings{assadi_et_al:LIPIcs.ICALP.2019.17,
  author =	{Assadi, Sepehr and Solomon, Shay},
  title =	{{When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{17:1--17:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17},
  URN =		{urn:nbn:de:0030-drops-105931},
  doi =		{10.4230/LIPIcs.ICALP.2019.17},
  annote =	{Keywords: Maximal Independent Set, Maximal Matching, Sublinear-Time Algorithms, Bounded Neighborhood Independence}
}