Go to the corresponding LIPIcs Volume Portal 
Ackerman, Eyal ; Keszegh, Balázs ; Rote, Günter
pdfformat: 

@InProceedings{ackerman_et_al:LIPIcs:2020:12159, author = {Eyal Ackerman and Bal{\'a}zs Keszegh and G{\"u}nter Rote}, title = {{An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {1:11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771436}, ISSN = {18688969}, year = {2020}, volume = {164}, editor = {Sergio Cabello and Danny Z. Chen}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12159}, URN = {urn:nbn:de:0030drops121591}, doi = {10.4230/LIPIcs.SoCG.2020.1}, annote = {Keywords: Simple polygon, Ramsey theory, combinatorial geometry} }
Keywords:  Simple polygon, Ramsey theory, combinatorial geometry  
Collection:  36th International Symposium on Computational Geometry (SoCG 2020)  
Issue Date:  2020  
Date of publication:  08.06.2020 