English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

MPS-Authors
/persons/resource/persons216986

Fleszar,  Krzysztof
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Chan, T. M., van Dijk, T. C., Fleszar, K., Spoerhase, J., & Wolff, A. (2018). Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. In W.-L. Hsu, D.-T. Lee, & C.-S. Liao (Eds.), 29th International Symposium on Algorithms and Computation (pp. 1-13). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2018.61.


Cite as: http://hdl.handle.net/21.11116/0000-0002-ADEA-4
Abstract
There is no abstract available