  |
Items where Author is "Ackerman, Eyal"
Group by: Item Type | No Grouping Number of items: 7. Ackerman, Eyal and Keszegh, Balázs (2024) On the number of tangencies among 1-intersecting x-monotone curves. EUROPEAN JOURNAL OF COMBINATORICS, 118. ISSN 0195-6698 Ackerman, Eyal and Keszegh, Balázs (2023) On the Number of Tangencies Among 1-Intersecting Curves. In: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), 2023.08.28.- 2023.09.01., Prága. Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2022) An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. DISCRETE AND COMPUTATIONAL GEOMETRY : AN INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE. pp. 1-29. ISSN 0179-5376 (print); 1432-0444 (online) Ackerman, Eyal and Keszegh, Balázs and Pálvölgyi, Dömötör (2021) Coloring Delaunay-edges and their generalizations. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 96. ISSN 0925-7721 Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2020) An almost optimal bound on the number of intersections of two simple polygons. In: 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz-Zentrum für Informatik, Wadern. ISBN 9783959771436 Ackerman, Eyal and Keszegh, Balázs and Vizer, Máté (2016) Coloring points with respect to squares. Leibniz International Proceedings in Informatics (LIPIcs), 2nd International Symposium on Computational Geometry (SoCG 2016), 51. 5:1-5:16. ISSN 1868-8969 Ackerman, Eyal and Keszegh, Balázs and Vizer, Máté (2016) On the size of planarly connected crossing graphs. Lecture Notes in Computer Science (LNCS) : Proceedings of Graph Drawing 2016. (In Press) |
