@InProceedings{chan_et_al:LIPIcs.ISAAC.2018.61,
  author =	{Chan, Timothy M. and van Dijk, Thomas C. and Fleszar, Krzysztof and Spoerhase, Joachim and Wolff, Alexander},
  title =	{{Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity}},
  booktitle =	{29th International Symposium on Algorithms and Computation (ISAAC 2018)},
  pages =	{61:1--61:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.61},
  URN =		{urn:nbn:de:0030-drops-100094},
  doi =		{10.4230/LIPIcs.ISAAC.2018.61},
  annote =	{Keywords: Geometric optimization, NP-hard, approximation, shallow-cell complexity, line stabbing}
}