No photo of Eyal Ackerman

View Scopus Profile

Eyal Ackerman

Former affiliation
 https://orcid.org/0000-0002-2912-7772
    20042024

    Research activity per year

    Filter
    Conference contribution

    Search results

    • 2024

      On the Number of Digons in Arrangements of Pairwise Intersecting Circles

      Ackerman, E., Damásdi, G., Keszegh, B., Pinchasi, R. & Raffay, R., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2020

      An almost optimal bound on the number of intersections of two simple polygons

      Ackerman, E., Keszegh, B. & Rote, G., 1 Jun 2020, 36th International Symposium on Computational Geometry, SoCG 2020. Cabello, S. & Chen, D. Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-SoCG-2020-1. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2016

      Coloring points with respect to squares

      Ackerman, E., Keszegh, B. & Vizer, M., 1 Jun 2016, 32nd International Symposium on Computational Geometry, SoCG 2016. Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 5.1-5.16 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 51).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On the size of planarly connected crossing graphs

      Ackerman, E., Keszegh, B. & Vizer, M., 2016, Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Revised Selected Papers. Nollenburg, M. & Hu, Y. (eds.). Springer Verlag, p. 311-320 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9801 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2014

      The flip diameter of rectangulations and convex subdivisions

      Ackerman, E., Allen, M. M., Barequet, G., Löffler, M., Mermelstein, J., Souvaine, D. L. & Tóth, C. D., 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 478-489 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2011

      On the size of graphs that admit polyline drawings with few bends and crossing angles

      Ackerman, E., Fulek, R. & Tóth, C. D., 2011, Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers. p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6502 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2009

      On grids in topological graphs

      Ackerman, E., Fox, J., Pach, J. & Suk, A., 2009, Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09. p. 403-412 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • On inducing polygons and related problems

      Ackerman, E., Pinchasi, R., Scharf, L. & Scherfenberg, M., 2009, Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings. p. 47-58 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5757 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2007

      There are not too many magic configurations

      Ackerman, E., Buchin, K., Knauer, C., Pinchasi, R. & Rote, G., 2007, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07. p. 142-149 8 p. (Proceedings of the Annual Symposium on Computational Geometry).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2006

      Acyclic orientation of drawings

      Ackerman, E., Buchin, K., Knauer, C. & Rote, G., 2006, Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. Springer Verlag, p. 268-279 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4059 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On the maximum number of edges in topologlcal graphs with no four pairwise crossing edges

      Ackerman, E., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. p. 259-260 2 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review