Standard
Finding the maximum subset with bounded convex curvature. / Abrahamsen, Mikkel; Thorup, Mikkel.
32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. 4 (Leibniz International Proceedings in Informatics, Vol. 51).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Abrahamsen, M & Thorup, M 2016,
Finding the maximum subset with bounded convex curvature. in
32nd International Symposium on Computational Geometry (SoCG 2016)., 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 51, International Symposium on Computational Geometry (SoCG 2016), Boston, MA, United States,
14/06/2016.
https://doi.org/10.4230/LIPIcs.SoCG.2016.4
APA
Abrahamsen, M., & Thorup, M. (2016).
Finding the maximum subset with bounded convex curvature. In
32nd International Symposium on Computational Geometry (SoCG 2016) [4] Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Vol. 51
https://doi.org/10.4230/LIPIcs.SoCG.2016.4
Vancouver
Abrahamsen M, Thorup M.
Finding the maximum subset with bounded convex curvature. In 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2016. 4. (Leibniz International Proceedings in Informatics, Vol. 51).
https://doi.org/10.4230/LIPIcs.SoCG.2016.4
Author
Abrahamsen, Mikkel ; Thorup, Mikkel. / Finding the maximum subset with bounded convex curvature. 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. (Leibniz International Proceedings in Informatics, Vol. 51).
Bibtex
@inproceedings{41e3a393327f4b13bcb756c3a1e33d5b,
title = "Finding the maximum subset with bounded convex curvature",
author = "Mikkel Abrahamsen and Mikkel Thorup",
year = "2016",
doi = "10.4230/LIPIcs.SoCG.2016.4",
language = "English",
isbn = "978-3-95977-009-5",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
booktitle = "32nd International Symposium on Computational Geometry (SoCG 2016)",
note = "null ; Conference date: 14-06-2016 Through 18-06-2016",
}
RIS
TY - GEN
T1 - Finding the maximum subset with bounded convex curvature
AU - Abrahamsen, Mikkel
AU - Thorup, Mikkel
N1 - Conference code: 32
PY - 2016
Y1 - 2016
U2 - 10.4230/LIPIcs.SoCG.2016.4
DO - 10.4230/LIPIcs.SoCG.2016.4
M3 - Article in proceedings
SN - 978-3-95977-009-5
T3 - Leibniz International Proceedings in Informatics
BT - 32nd International Symposium on Computational Geometry (SoCG 2016)
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Y2 - 14 June 2016 through 18 June 2016
ER -