Eyal Ackerman
Department of Mathematics, Physics, and Computer Science, University of Haifa at Oranim. Tivon 36006, Israel.
Phone: +972-4-9838821
Fax: +972-4-9539608
E-mail: ackerman at sci dot haifa dot ac dot il
| |
Eyal Ackerman Department of Mathematics, Physics, and Computer Science, University of Haifa at Oranim. Tivon 36006, Israel. Phone: +972-4-9838821 Fax: +972-4-9539608 E-mail: ackerman at sci dot haifa dot ac dot il |
Research Interests
Combinatorial and Computational Geometry.
Teaching
Publications
Eyal Ackerman, Gill Barequet, Ron Y. Pinter, and Dan Romik, The number of guillotine partitions in d dimensions, Information Processing Letters (IPL), 98:4 (2006), 162-167.
Eyal Ackerman, Gill Barequet, and Ron Y. Pinter, On the number of rectangulations of a planar point set, J. Combinatorial Theory, Ser. A. (JCT-A), 113:6 (2006), 1072-1091. Preliminary results appeared in: On the number of rectangular partitions, Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), New Orleans, LA, January 2004, 729-738. And: An upper bound on the number of rectangulations of a point set, Proc. 11th Int. Computing and Combinatorics Conf. (COCOON), Kunming, Yunnan, China, August 2005, Lecture Notes in Computer Science, volume 3595, Springer-Verlag, 554-559.
Eyal Ackerman, Gill Barequet, and Ron Y. Pinter, A bijection between permutations and floorplans, and its applications, Discrete Applied Mathematics (DAM), 154:12 (2006), 1674-1684.
Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote, Acyclic orientation of drawings, Journal of Graph Algorithms and Applications (JGAA), 14:2 (2010), 367-384. Also in: 10th Scandinavian Workshop on Algorithm Theory (SWAT), Riga, Latvia, July 2006, Lecture Notes in Computer Science, volume 4059, Springer, 268-279. And in abstracts of the 22nd European Workshop on Computational Geometry (EWCG), Delphi, Greece, March 2006, 207-210.
Eyal Ackerman and Gábor Tardos, On the maximum number of edges in quasi-planar graphs, J. Combinatorial Theory, Ser. A. (JCT-A), 114:3 (2007), 563-571.
Eyal Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, Discrete and Computational Geometry (DCG), 41 (2009), 365–375. Also in: Proc. 22nd ACM Symp. on Computational Geometry (SoCG), Sedona, AZ, June 2006, 259-263.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter Rote, There are not too many Magic Configurations, Discrete and Computational Geometry (DCG), 39:1 (2008), 3-16. Also in: Proc. 23rd ACM Symp. on Computational Geometry (SoCG), Gyeongju, South Korea, June 2007, 142-149.
Eyal Ackerman, Oswin Aichholzer, and Balázs Keszegh, Improved upper bounds on the reflexivity of point sets, Computational Geometry: Theory and Applications (CGTA), 42:3 (2009), 241-249. Also in: Proc. 19th Canadian Conf. on Computational Geometry (CCCG), Ottawa, Canada, August 2007, 29-32.
Eyal Ackerman and Oren Ben-Zwi, On sets of points that determine only acute angles, Euro. J. Combinatorics, 30 (2009), 908-910.
Eyal Ackerman, Jacob Fox, János Pach, and Andrew Suk, On grids in topological graphs, Computational Geometry: Theory and Applications (CGTA), submitted. Also in: Proc. 25th ACM Symp. on Computational Geometry (SoCG), University of Aarhus, Denmark, June 2009, 403-412.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, and Marc Scherfenberg, On inducing polygons and related problems, Computational Geometry: Theory and Applications (CGTA), to appear. Also in: Proc. 17th European Symp. on Algorithms (ESA), IT University of Copenhagen, Denmark, September 2009, 47-58.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, and Marc Scherfenberg, Every simple arrangement of n lines contains an inducing simple n-gon, American Mathematical Monthly (AMM), 118:2 (2011), 164-167.
Eyal Ackerman, Oren Ben-Zwi, and Guy Wolfovitz, Combinatorial model and bounds for target set selection, Theoretical Computer Science (TCS), 411:44-46 (2010), 4017-4022.
Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth, Graphs that admit polyline drawings with few crossing angles, SIAM J. on Discrete Mathematics (SIDMA), to appear. Also in: Proc. Graph Drawing (GD), Konstanz, Germany, September 2010, 1-12.
Eyal Ackerman, Tsachik Gelander, and Rom Pinchasi, Ice-creams and wedge graphs, submitted. Also in: arXiv: 1106.0855.
Eyal Ackerman, The maximum number of tangencies among convex regions with a triangle-free intersection graph, Thirty Essays on Geometric Graph Theory, J. Pach (Ed.), to appear.
Eyal Ackerman, Noa Nitzan, and Rom Pinchasi, The maximum number of edges in geometric graphs with pairwise avoiding edges, submitted.
- Eyal Ackerman and Rom Pinchasi, On the light side of geometric graphs, Discrete Mathematics (DM), to appear.