Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarEyal Ackerman
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j26]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22(1): 11-22 (2018)- [i6]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Delaunay-Edges and their Generalizations. CoRR abs/1806.03931 (2018) - 2017
- [j25]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. Discrete & Computational Geometry 58(4): 757-784 (2017) - 2016
- [j24]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. Discrete Mathematics & Theoretical Computer Science 18(3) (2016) - [c13]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. Symposium on Computational Geometry 2016: 5:1-5:16 - [c12]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. Graph Drawing 2016: 311-320 - 2015
- [i5]Eyal Ackerman:
On topological graphs with at most four crossings per edge. CoRR abs/1509.01932 (2015) - [i4]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. CoRR abs/1509.02475 (2015) - 2014
- [j23]Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electr. J. Comb. 21(2): P2.23 (2014) - [j22]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - [j21]
- [j20]Eyal Ackerman, Noa Nitzan, Rom Pinchasi:
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs and Combinatorics 30(5): 1065-1072 (2014) - [c11]Eyal Ackerman, Marcus Schaefer:
A Crossing Lemma for the Pair-Crossing Number. Graph Drawing 2014: 222-233 - [c10]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN 2014: 478-489 - 2013
- [j19]Eyal Ackerman, Tsachik Gelander, Rom Pinchasi:
Ice-creams and wedge graphs. Comput. Geom. 46(3): 213-218 (2013) - [j18]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On inducing polygons and related problems. Comput. Geom. 46(7): 861-878 (2013) - [j17]Eyal Ackerman, Rom Pinchasi:
On the Degenerate Crossing Number. Discrete & Computational Geometry 49(3): 695-702 (2013) - [j16]Eyal Ackerman, Jacob Fox, Rom Pinchasi:
A note on light geometric graphs. Discrete Mathematics 313(11): 1281-1283 (2013) - [j15]Eyal Ackerman, Rom Pinchasi:
Covering a chessboard with staircase walks. Discrete Mathematics 313(22): 2547-2551 (2013) - [j14]Eyal Ackerman, Rom Pinchasi:
On coloring points with respect to rectangles. J. Comb. Theory, Ser. A 120(4): 811-815 (2013) - [i3]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR abs/1312.4429 (2013) - 2012
- [j13]Eyal Ackerman, Rom Pinchasi:
On the light side of geometric graphs. Discrete Mathematics 312(6): 1213-1217 (2012) - [j12]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) - [i2]
- 2011
- [j11]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. The American Mathematical Monthly 118(2): 164-167 (2011) - [i1]Eyal Ackerman, Tsachik Gelander, Rom Pinchasi:
Ice-Creams and Wedge Graphs. CoRR abs/1106.0855 (2011) - 2010
- [j10]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14(2): 367-384 (2010) - [j9]Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz:
Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411(44-46): 4017-4022 (2010) - [c9]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
2000 – 2009
- 2009
- [j8]Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42(3): 241-249 (2009) - [j7]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) - [j6]Eyal Ackerman, Oren Ben-Zwi:
On sets of points that determine only acute angles. Eur. J. Comb. 30(4): 908-910 (2009) - [c8]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Symposium on Computational Geometry 2009: 403-412 - [c7]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On Inducing Polygons and Related Problems. ESA 2009: 47-58 - 2008
- [j5]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
- [j4]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) - [c6]Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved Upper Bounds on the Reflexivity of Point Sets. CCCG 2007: 29-32 - [c5]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 - 2006
- [j3]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
A bijection between permutations and floorplans, and its applications. Discrete Applied Mathematics 154(12): 1674-1684 (2006) - [j2]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) - [j1]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) - [c4]Eyal Ackerman:
On the maximum number of edges in topological graphs with no four pairwise crossing edges. Symposium on Computational Geometry 2006: 259-263 - [c3]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. SWAT 2006: 268-279 - 2005
- [c2]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
An Upper Bound on the Number of Rectangulations of a Point Set. COCOON 2005: 554-559 - 2004
- [c1]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
On the number of rectangular partitions. SODA 2004: 736-745
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2018-12-25 18:42 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
