Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001. ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. In Mikolaj Bojanczyk, Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Volume 213 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{FominG0021,
title = {ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space},
author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar 0002 and Saket Saurabh 0001},
year = {2021},
doi = {10.4230/LIPIcs.FSTTCS.2021.21},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.21},
researchr = {https://researchr.org/publication/FominG0021},
cites = {0},
citedby = {0},
booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference},
editor = {Mikolaj Bojanczyk and Chandra Chekuri},
volume = {213},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-215-0},
}