BibTeX record conf/compgeom/AckermanKR20

download as .bib file

@inproceedings{DBLP:conf/compgeom/AckermanKR20,
  author       = {Eyal Ackerman and
                  Bal{\'{a}}zs Keszegh and
                  G{\"{u}}nter Rote},
  editor       = {Sergio Cabello and
                  Danny Z. Chen},
  title        = {An Almost Optimal Bound on the Number of Intersections of Two Simple
                  Polygons},
  booktitle    = {36th International Symposium on Computational Geometry, SoCG 2020,
                  June 23-26, 2020, Z{\"{u}}rich, Switzerland},
  series       = {LIPIcs},
  volume       = {164},
  pages        = {1:1--1:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2020.1},
  doi          = {10.4230/LIPICS.SOCG.2020.1},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AckermanKR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.