Eyal Ackerman  Department of Mathematics and Computer Science, Freie Universität Berlin. Takustr. 9, 14195 Berlin, Germany.  Phone: +49 30 838 75582  Fax: +49 30 838 75192  E-mail: eyal at inf dot fu desh berlin dot de

Past and current positions

Since October 2007, I am an Alexander von Humboldt postdoc fellow at the Theoretical Computer Science Group, Freie Universität Berlin.

I was a postdoc fellow at the School of Computing Science, Simon Fraser University from September 2006 until September 2007.

I graduated my Ph.D. studies at the Computer Science Department, Technion-Israel Institute of Technology on September 2006. My advisors were Gill Barequet and Ron Pinter.

From November 2005 to January 2006 I was a Marie Curie Scholar at the Theoretical Computer Science Group, Freie Universität Berlin.

Research Interests
Combinatorics, Discrete and Computational Geometry.

Publications

• Eyal Ackerman, Gill Barequet, and Ron Y. Pinter, On the number of rectangular partitions, Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), New Orleans, LA, January 2004, 729-738.

• Eyal Ackerman, Gill Barequet, and Ron Y. Pinter, 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, 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.

• 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, 10th Scandinavian Workshop on Algorithm Theory (SWAT), Riga, Latvia, July 2006, Lecture Notes in Computer Science, volume 4059, Springer, 268-279. Also 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, 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, Proc. 17th European Symp. on Algorithms (ESA), IT University of Copenhagen, Denmark, September 2009, to appear.