Boris Aronov

Affiliations: 
Computer Science and Engineering Polytechnic Institute of New York University, Brooklyn, NY, NY, United States 
Area:
Computer Science, Applied Mathematics
Google:
"Boris Aronov"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Aronov B, Cheong O, Dobbins MG, et al. (2016) The number of holes in the union of translates of a convex set in three dimensions Leibniz International Proceedings in Informatics, Lipics. 51: 10.1-10.16
Aronov B, Dulieu M, Hurtado F. (2014) Mutual witness proximity graphs Information Processing Letters. 114: 519-523
Aronov B, Dulieu M, Hurtado F. (2014) Witness Rectangle Graphs Graphs and Combinatorics. 30: 827-846
Aronov B, Yagnatinsky M. (2014) Quickly placing a point to maximize angles 26th Canadian Conference On Computational Geometry, Cccg 2014. 395-400
Agarwal PK, Aronov B, Van Kreveld M, et al. (2013) Computing correlation between piecewise-linear functions Siam Journal On Computing. 42: 1867-1887
Aronov B, Dulieu M. (2013) How to cover a point set with a V-shape of minimum width Computational Geometry: Theory and Applications. 46: 298-309
Aronov B, Dulieu M, Hurtado F. (2013) Witness Gabriel graphs Computational Geometry: Theory and Applications. 46: 894-908
Aronov B, De Berg M, Roeloffzen M, et al. (2013) Distance-sensitive planar point location Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8037: 49-60
Aronov B, Dulieu M, Pinchasi R, et al. (2013) On the union complexity of diametral disks Electronic Journal of Combinatorics. 20
Aronov B, Iacono J, Özkan Ö, et al. (2013) How to cover most of a point set with a V-shape of minimum width Cccg 2013 - 25th Canadian Conference On Computational Geometry. 211-215
See more...