@InProceedings{henzinger_et_al:LIPIcs.SoCG.2020.51,
author = {Henzinger, Monika and Neumann, Stefan and Wiese, Andreas},
title = {{Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.51},
URN = {urn:nbn:de:0030-drops-122094},
doi = {10.4230/LIPIcs.SoCG.2020.51},
annote = {Keywords: Dynamic algorithms, independent set, approximation algorithms, interval graphs, geometric intersection graphs}
}