%0 Conference Paper %1 chan-etal18:stabbing %A Chan, Timothy M. %A van Dijk, Thomas C. %A Fleszar, Krzysztof %A Spoerhase, Joachim %A Wolff, Alexander %B Proc. 29th International Symposium on Algorithms and Computation (ISAAC'18) %D 2018 %K approximability complexity cover geometric myown rectangle set shallow-cell stabbing %T Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity %U https://arxiv.org/abs/1806.02851

@inproceedings{chan-etal18:stabbing, added-at = {2018-08-31T11:21:47.000+0200}, author = {Chan, Timothy M. and van Dijk, Thomas C. and Fleszar, Krzysztof and Spoerhase, Joachim and Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/263363f8a96a982f47335c02d6b54acc6/jspoerhase}, booktitle = {Proc. 29th International Symposium on Algorithms and Computation (ISAAC'18)}, interhash = {19042d8479c8c48a453038865a169555}, intrahash = {63363f8a96a982f47335c02d6b54acc6}, keywords = {approximability complexity cover geometric myown rectangle set shallow-cell stabbing}, note = {to appear}, timestamp = {2018-08-31T11:25:04.000+0200}, title = {Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity}, url = {https://arxiv.org/abs/1806.02851}, year = 2018 }