@InProceedings{sharir_et_al:LIPIcs.SoCG.2019.62,
author = {Sharir, Micha and Ziv, Chen},
title = {{On the Complexity of the k-Level in Arrangements of Pseudoplanes}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.62},
URN = {urn:nbn:de:0030-drops-104662},
doi = {10.4230/LIPIcs.SoCG.2019.62},
annote = {Keywords: k-level, pseudoplanes, arrangements, three dimensions, k-sets}
}