@InProceedings{joshi_et_al:LIPIcs.FSTTCS.2022.21,
author = {Joshi, Utkarsh and Rahul, Saladi and Thoppil, Josson Joe},
title = {{A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs}},
booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
year = {2022},
volume = {250},
editor = {Dawar, Anuj and Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.21},
URN = {urn:nbn:de:0030-drops-174139},
doi = {10.4230/LIPIcs.FSTTCS.2022.21},
annote = {Keywords: Geometric intersection graphs, Max cut, Vertical ray shooting}
}