Items where Author is "Ackerman, Eyal"

Article

Ackerman, Eyal and Keszegh, Balázs and Pálvölgyi, Dömötör (2024) On tangencies among planar curves with an application to coloring L-shapes. EUROPEAN JOURNAL OF COMBINATORICS, 121. No. 103837. ISSN 0195-6698 (In Press)

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 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 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)

Book Section

Ackerman, Eyal and Damásdi, Gábor and Keszegh, Balázs and Pinchasi, Rom and Raffay, Rebeka (2025) The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles. In: 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), 332 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Schloss Dagstuhl, No.-2.

Ackerman, Eyal and Damásdi, Gábor and Keszegh, Balázs and Pinchasi, Rom and Raffay, Rebeka (2024) On the Number of Digons in Arrangements of Pairwise Intersecting Circles. In: 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics, LIPIcs (293). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Wadern, No.-3. ISBN 9783959773164

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

Conference or Workshop Item

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.