The SCEAS System
| |||||||

## Search the dblp DataBase
Eyal Ackerman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eyal Ackerman, Gill Barequet, Ron Y. Pinter
**An Upper Bound on the Number of Rectangulations of a Point Set.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:554-559 [Conf] - Eyal Ackerman
**On the maximum number of edges in topological graphs with no four pairwise crossing edges.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:259-263 [Conf] - Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
**There are not too many magic configurations.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:142-149 [Conf] - Eyal Ackerman, Gill Barequet, Ron Y. Pinter
**On the number of rectangular partitions.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:736-745 [Conf] - Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
**Acyclic Orientation of Drawings.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:268-279 [Conf] - Eyal Ackerman, Gill Barequet, Ron Y. Pinter
**A bijection between permutations and floorplans, and its applications.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:12, pp:1674-1684 [Journal] - Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik
**The number of guillotine partitions in**[Citation Graph (0, 0)][DBLP]*d*dimensions. Inf. Process. Lett., 2006, v:98, n:4, pp:162-167 [Journal] - Eyal Ackerman, Gill Barequet, Ron Y. Pinter
**On the number of rectangulations of a planar point set.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:6, pp:1072-1091 [Journal] - Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
**Improved Upper Bounds on the Reflexivity of Point Sets.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:29-32 [Conf] - Eyal Ackerman, Gábor Tardos
**On the maximum number of edges in quasi-planar graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2007, v:114, n:3, pp:563-571 [Journal] **On grids in topological graphs.**[Citation Graph (, )][DBLP]**On Inducing Polygons and Related Problems.**[Citation Graph (, )][DBLP]**Improved upper bounds on the reflexivity of point sets.**[Citation Graph (, )][DBLP]**On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges.**[Citation Graph (, )][DBLP]**There Are Not Too Many Magic Configurations.**[Citation Graph (, )][DBLP]**On sets of points that determine only acute angles.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |