@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2021.21,
author = {Fomin, Fedor V. and Golovach, Petr A. and Inamdar, Tanmay and Saurabh, Saket},
title = {{ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space}},
booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
pages = {21:1--21:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-215-0},
ISSN = {1868-8969},
year = {2021},
volume = {213},
editor = {Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.21},
URN = {urn:nbn:de:0030-drops-155323},
doi = {10.4230/LIPIcs.FSTTCS.2021.21},
annote = {Keywords: Subexponential Algorithms, Geometric Intersection Graphs, Treedepth, Treewidth}
}