Eyal Ackerman

	2012
22		Eyal Ackerman, Rom Pinchasi: On the light side of geometric graphs. Discrete Mathematics 312(6): 1213-1217 (2012)
21		Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth: Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discrete Math. 26(1): 305-320 (2012)
	2011
20		Eyal Ackerman, Tsachik Gelander, Rom Pinchasi: Ice-Creams and Wedge Graphs CoRR abs/1106.0855: (2011)
	2010
19		Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. Graph Drawing 2010: 1-12
18		Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote: Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14(2): 367-384 (2010)
17		Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz: Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411(44-46): 4017-4022 (2010)
	2009
16		Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg: On Inducing Polygons and Related Problems. ESA 2009: 47-58
15		Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk: On grids in topological graphs. Symposium on Computational Geometry 2009: 403-412
14		Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh: Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42(3): 241-249 (2009)
13		Eyal Ackerman: On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. Discrete & Computational Geometry 41(3): 365-375 (2009)
12		Eyal Ackerman, Oren Ben-Zwi: On sets of points that determine only acute angles. Eur. J. Comb. 30(4): 908-910 (2009)
	2008
11		Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There Are Not Too Many Magic Configurations. Discrete & Computational Geometry 39(1-3): 3-16 (2008)
	2007
10		Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh: Improved Upper Bounds on the Reflexivity of Point Sets. CCCG 2007: 29-32
9		Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There are not too many magic configurations. Symposium on Computational Geometry 2007: 142-149
8		Eyal Ackerman, Gábor Tardos: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114(3): 563-571 (2007)
	2006
7		Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote: Acyclic Orientation of Drawings. SWAT 2006: 268-279
6		Eyal Ackerman: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Symposium on Computational Geometry 2006: 259-263
5		Eyal Ackerman, Gill Barequet, Ron Y. Pinter: A bijection between permutations and floorplans, and its applications. Discrete Applied Mathematics 154(12): 1674-1684 (2006)
4		Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik: The number of guillotine partitions in d dimensions. Inf. Process. Lett. 98(4): 162-167 (2006)
3		Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangulations of a planar point set. J. Comb. Theory, Ser. A 113(6): 1072-1091 (2006)
	2005
2		Eyal Ackerman, Gill Barequet, Ron Y. Pinter: An Upper Bound on the Number of Rectangulations of a Point Set. COCOON 2005: 554-559
	2004
1		Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangular partitions. SODA 2004: 736-745

Coauthor Index

1	Oswin Aichholzer	[10] [14]
2	Gill Barequet	[1] [2] [3] [4] [5]
3	Oren Ben-Zwi	[12] [17]
4	Kevin Buchin	[7] [9] [11] [18]
5	Jacob Fox	[15]
6	Radoslav Fulek	[19] [21]
7	Tsachik Gelander	[20]
8	Balázs Keszegh	[10] [14]
9	Christian Knauer	[7] [9] [11] [18]
10	János Pach	[15]
11	Rom Pinchasi	[9] [11] [16] [20] [22]
12	Ron Y. Pinter	[1] [2] [3] [4] [5]
13	Dan Romik	[4]
14	Günter Rote	[7] [9] [11] [18]
15	Ludmila Scharf	[16]
16	Marc Scherfenberg	[16]
17	Andrew Suk	[15]
18	Gábor Tardos	[8]
19	Csaba D. Tóth	[19] [21]
20	Guy Wolfovitz	[17]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page