@InProceedings{dallant_et_al:LIPIcs.FUN.2022.13,
  author =	{Dallant, Justin and Iacono, John},
  title =	{{How Fast Can We Play Tetris Greedily with Rectangular Pieces?}},
  booktitle =	{11th International Conference on Fun with Algorithms (FUN 2022)},
  pages =	{13:1--13:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-232-7},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{226},
  editor =	{Fraigniaud, Pierre and Uno, Yushi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.13},
  URN =		{urn:nbn:de:0030-drops-159839},
  doi =		{10.4230/LIPIcs.FUN.2022.13},
  annote =	{Keywords: Tetris, Fine-grained complexity, Dynamic data structures, Axis-aligned rectangles}
}