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

• Discrete Math

• Advanced Algorithms

• Models of Computation

• CS Seminar on Computational Geometry

• Introduction to the Theory of Computation

 
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 (EuroCG), 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), 47 (2014), 710-723. 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), 46:7 (2013), 861-878. 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), 26:1 (2012), 305-320. Also in: Proc. Graph Drawing (GD), Konstanz, Germany, September 2010, 1-12.

• Eyal Ackerman, Tsachik Gelander, and Rom Pinchasi, Ice-creams and wedge graphs, Computational Geometry: Theory and Applications (CGTA), 46 (2013), 213-218.

• 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.), Springer, 2013, 19-30.

• Eyal Ackerman, Noa Nitzan, and Rom Pinchasi, The maximum number of edges in geometric graphs with pairwise virtually avoiding edges, Graphs and Combinatorics, 30:5 (2014), 1065-1072.

• Eyal Ackerman and Rom Pinchasi, On the light side of geometric graphs, Discrete Mathematics (DM), 312:6 (2012), 1213–1217.

• Eyal Ackerman, Jacob Fox, and Rom Pinchasi, A note on light geometric graphs, Discrete Mathematics (DM), 313 (2013), 1281–1283.

• Eyal Ackerman and Rom Pinchasi, On coloring points with respect to rectangles, J. Combinatorial Theory, Ser. A. (JCT-A), 120 (2013), 811-815.

• Eyal Ackerman, János Pach, Rom Pinchasi, Radoš Radoičić, and Géza Tóth, A note on coloring line arrangements, The Electronic Journal of Combinatorics (E-JC), 21:2 (2014), #P2.23.

• Eyal Ackerman and Rom Pinchasi, Covering a chessboard with staircase walks, Discrete Mathematics (DM), 313 (2013), 2547–2551. 

• Eyal Ackerman and Rom Pinchasi, On the degenerate crossing number, Discrete and Computational Geometry (DCG), 49:3 (2013), 695–702. 

• Eyal Ackerman, On topological graphs with at most four crossings per edge, Computational Geometry: Theory and Applications (CGTA), 85 (2019), to appear.  

• Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, and Csaba D. Tóth, The flip diameter of rectangulations and convex subdivisions, Discrete Mathematics & Theoretical Computer Science (DMTCS), 18:3 (2016), Also in: Proc. 11th Latin American Theoretical Informatics Symp. (LATIN), Montevideo, Uruguay, March-April 2014, Lecture Notes in Computer Science, volume 8392, Springer-Verlag, 478-489.

• Eyal Ackerman, A note on 1-planar graphs, Discrete Applied Mathematics (DAM), 175 (2014), 104-108. Also in abstracts of the 30th European Workshop on Computational Geometry (EuroCG), Ein-Gedi, Israel, March 2014. 

• Eyal Ackerman and Marcus Schaefer, A crossing lemma for the pair-crossing number, Proc. 22nd Symp. on Graph Drawing (GD), Würzburg, Germany, September 2014, 222-233.

• Eyal Ackerman, Balázs Keszegh and Mate Vizer, On the size of planarly connected crossing graphs, Journal of Graph Algorithms and Applications (JGAA), 22:1 (2018), 11-22. Also in: Proc. 24nd Symp. on Graph Drawing (GD), Athens, Greece, September 2016, 311-320.

• Eyal Ackerman, Balázs Keszegh and Mate Vizer, Coloring points with respect to squares, Discrete and Computational Geometry (DCG), 58:4 (2017), 757-784. Also in: Proc. 32rd ACM Symp. on Computational Geometry (SoCG), Boston, US, June 2016, 5:1-5:16.
• Eyal Ackerman, Balázs Keszegh and Dömötör Pálvölgyi, Coloring Delaunay-edges and their generalizations, submitted.
• Eyal Ackerman, Balázs Keszegh and Dömötör Pálvölgyi, Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs, Acta Mathematica Universitatis Comenianae, 88:3 (2019), 363-370 (Proc. of EuroComb 2019).
• Eyal Ackerman and Rom Pinchasi, On partitions of two-dimensional discrete boxes, submitted.
• Eyal Ackerman, Balázs Keszegh and Günter Rote, An almost optimal bound on the number of intersections of two simple polygons, submitted.