default search action
Eyal Ackerman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Eyal Ackerman, Rom Pinchasi:
On partitions of two-dimensional discrete boxes. Discret. Math. 347(4): 113848 (2024) - [j32]Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting x-monotone curves. Eur. J. Comb. 118: 103929 (2024) - [j31]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
On tangencies among planar curves with an application to coloring L-shapes. Eur. J. Comb. 121: 103837 (2024) - [c15]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG 2024: 3:1-3:14 - [i10]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the number of digons in arrangements of pairwise intersecting circles. CoRR abs/2406.02276 (2024) - 2023
- [i9]Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting curves. CoRR abs/2305.13807 (2023) - [i8]Eyal Ackerman, Balázs Keszegh:
The maximum size of adjacency-crossing graphs. CoRR abs/2309.06507 (2023) - 2022
- [j30]Eyal Ackerman, Balázs Keszegh
, Günter Rote
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. Discret. Comput. Geom. 68(4): 1049-1077 (2022) - 2021
- [j29]Eyal Ackerman
Coloring Delaunay-edges and their generalizations. Comput. Geom. 96: 101745 (2021) - 2020
- [j28]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. SIAM J. Discret. Math. 34(4): 2250-2269 (2020) - [c14]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. SoCG 2020: 1:1-1:18 - [p1]Eyal Ackerman:
Quasi-planar Graphs. Beyond Planar Graphs 2020: 31-45 - [i7]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An almost optimal bound on the number of intersections of two simple polygons. CoRR abs/2002.05680 (2020)
2010 – 2019
- 2019
- [j27]Eyal Ackerman:
On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019) - 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
Coloring Points with Respect to Squares. Discret. Comput. Geom. 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. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [c13]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. SoCG 2016: 5:1-5:16 - [c12]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. GD 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. Electron. J. Comb. 21(2): 2 (2014) - [j22]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - [j21]Eyal Ackerman:
A note on 1-planar graphs. Discret. Appl. Math. 175: 104-108 (2014) - [j20]Eyal Ackerman, Noa Nitzan, Rom Pinchasi:
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs Comb. 30(5): 1065-1072 (2014) - [c11]Eyal Ackerman, Marcus Schaefer:
A Crossing Lemma for the Pair-Crossing Number. GD 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
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. Discret. Comput. Geom. 49(3): 695-702 (2013) - [j16]Eyal Ackerman, Jacob Fox, Rom Pinchasi:
A note on light geometric graphs. Discret. Math. 313(11): 1281-1283 (2013) - [j15]Eyal Ackerman, Rom Pinchasi:
Covering a chessboard with staircase walks. Discret. Math. 313(22): 2547-2551 (2013) - [j14]Eyal Ackerman, Rom Pinchasi:
On coloring points with respect to rectangles. J. Comb. Theory 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. Discret. Math. 312(6): 1213-1217 (2012) - [j12]Eyal Ackerman, Radoslav Fulek
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26(1): 305-320 (2012) - [i2]Eyal Ackerman, Rom Pinchasi:
A note on coloring line arrangements. CoRR abs/1207.0080 (2012) - 2011
- [j11]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. Am. Math. Mon. 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
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
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. GD 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. Discret. Comput. Geom. 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. SCG 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
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 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 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
There are not too many magic configurations. SCG 2007: 142-149 - 2006
- [b1]Eyal Ackerman:
Counting problems for geometric structures: rectangulations, floorplans, and quasi-planar graphs. Technion - Israel Institute of Technology, Israel, 2006 - [j3]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
A bijection between permutations and floorplans, and its applications. Discret. Appl. Math. 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 A 113(6): 1072-1091 (2006) - [c4]Eyal Ackerman:
On the maximum number of edges in topological graphs with no four pairwise crossing edges. SCG 2006: 259-263 - [c3]Eyal Ackerman, Kevin Buchin
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: