| Year |
Citation |
Score |
| 2016 |
Aronov B, Cheong O, Dobbins MG, Goaoc X. 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. DOI: 10.4230/LIPIcs.SoCG.2016.10 |
0.321 |
|
| 2014 |
Aronov B, Dulieu M, Hurtado F. Mutual witness proximity graphs Information Processing Letters. 114: 519-523. DOI: 10.1016/j.ipl.2014.04.001 |
0.762 |
|
| 2014 |
Aronov B, Dulieu M, Hurtado F. Witness Rectangle Graphs Graphs and Combinatorics. 30: 827-846. DOI: 10.1007/s00373-013-1316-x |
0.759 |
|
| 2014 |
Aronov B, Yagnatinsky M. Quickly placing a point to maximize angles 26th Canadian Conference On Computational Geometry, Cccg 2014. 395-400. |
0.326 |
|
| 2013 |
Agarwal PK, Aronov B, Van Kreveld M, Löffler M, Silveira RI. Computing correlation between piecewise-linear functions Siam Journal On Computing. 42: 1867-1887. DOI: 10.1137/120900708 |
0.405 |
|
| 2013 |
Aronov B, Dulieu M. How to cover a point set with a V-shape of minimum width Computational Geometry: Theory and Applications. 46: 298-309. DOI: 10.1016/j.comgeo.2012.09.006 |
0.715 |
|
| 2013 |
Aronov B, Dulieu M, Hurtado F. Witness Gabriel graphs Computational Geometry: Theory and Applications. 46: 894-908. DOI: 10.1016/j.comgeo.2011.06.004 |
0.764 |
|
| 2013 |
Aronov B, De Berg M, Roeloffzen M, Speckmann B. 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. DOI: 10.1007/978-3-642-40104-6_5 |
0.341 |
|
| 2013 |
Aronov B, Dulieu M, Pinchasi R, Sharir M. On the union complexity of diametral disks Electronic Journal of Combinatorics. 20. |
0.702 |
|
| 2013 |
Aronov B, Iacono J, Özkan Ö, Yagnatinsky M. 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. |
0.385 |
|
| 2012 |
Aronov B, de Berg M. Unions of fat convex polytopes have short skeletons Discrete and Computational Geometry. 48: 53-64. DOI: 10.1007/s00454-012-9422-8 |
0.342 |
|
| 2011 |
Aronov B, Dulieu M, Hurtado F. Witness (Delaunay) graphs Computational Geometry: Theory and Applications. 44: 329-344. DOI: 10.1016/j.comgeo.2011.01.001 |
0.754 |
|
| 2011 |
Aronov B, Van Kreveld M, Löffler M, Silveira RI. Peeling meshed potatoes Algorithmica (New York). 60: 349-367. DOI: 10.1007/s00453-009-9346-8 |
0.318 |
|
| 2010 |
Agarwal PK, Aronov B, Van Kreveld M, Löffler M, Silveira RI. Computing similarity between piecewise-linear functions Proceedings of the Annual Symposium On Computational Geometry. 375-383. DOI: 10.1145/1810959.1811020 |
0.415 |
|
| 2010 |
Aronov B, Asano T, Funke S. Optimal triangulations of points and segments with Steiner points International Journal of Computational Geometry and Applications. 20: 89-104. DOI: 10.1142/S0218195910003219 |
0.33 |
|
| 2010 |
Aronov B, Sharir M. Approximate halfspace range counting Siam Journal On Computing. 39: 2704-2725. DOI: 10.1137/080736600 |
0.31 |
|
| 2009 |
Aronov B, Aurenhammer F, Hurtado F, Langerman S, Rappaport D, Seara C, Smorodinsky S. Small weak epsilon-nets Computational Geometry: Theory and Applications. 42: 455-462. DOI: 10.1016/j.comgeo.2008.02.005 |
0.376 |
|
| 2008 |
Aronov B, De Berg M, Gray C, Mumford E. Cutting cycles of rods in space: Hardness and approximation Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1241-1248. |
0.303 |
|
| 2007 |
Aronov B, Van Kreveld M, Löffler M, Silveira RI. Largest subsets of triangles in a triangulation Cccg 2007 - 19th Canadian Conference On Computational Geometry. 213-216. |
0.338 |
|
| 2005 |
Agarwal PK, Aronov B, Koltun V, Sharir M. Lines avoiding unit balls in three dimensions Discrete and Computational Geometry. 34: 231-250. DOI: 10.1007/s00454-005-1166-2 |
0.302 |
|
| 2005 |
Aronov B, De Berg M, Cheong O, Gudmundsson J, Haverkort H, Vigneron A. Sparse geometric graphs with small dilation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3827: 50-59. DOI: 10.1007/11602613_7 |
0.438 |
|
| 2004 |
Aronov B, Pach J, Sharir M, Tardos G. Distinct distances in three and higher dimensions Combinatorics Probability and Computing. 13: 283-293. DOI: 10.1017/S0963548304006091 |
0.305 |
|
| 2004 |
Aronov B, Schiffenbauer R, Sharir M. On the number of views of translates of a cube and related problems Computational Geometry: Theory and Applications. 27: 179-182. DOI: 10.1016/j.comgeo.2003.10.001 |
0.33 |
|
| 2002 |
Aronov B, Sharir M. Cutting circles into pseudo-segments and improved bounds for incidences Discrete and Computational Geometry. 28: 475-490. DOI: 10.1007/s00454-001-0084-1 |
0.445 |
|
| 2001 |
Agarwal PK, Aronov B, Sharir M. Exact and approximation algorithms for minimum-width cylindrical shells Discrete and Computational Geometry. 26: 307-320. |
0.308 |
|
| 1999 |
Agarwal PK, Aronov B, Sharir M. Line transversals of balls and smallest enclosing cylinders in three dimensions Discrete and Computational Geometry. 21: 373-388. |
0.306 |
|
| 1996 |
Agarwal PK, Aronov B, Pach J, Pollack R, Sharir M. Quasi-planar graphs have a linear number of edges Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1027: 1-7. |
0.579 |
|
| 1994 |
Agarwal PK, Alon N, Aronov B, Suri S. Can visibility graphs Be represented compactly? Discrete &Amp; Computational Geometry. 12: 347-365. DOI: 10.1007/Bf02574385 |
0.495 |
|
| 1994 |
Aronov B, Bern M, Eppstein D. On the number of minimal 1-Steiner trees Discrete &Amp; Computational Geometry. 12: 29-34. DOI: 10.1007/Bf02574363 |
0.314 |
|
| 1993 |
Aronov B, Seidel R, Souvaine D. On compatible triangulations of simple polygons Computational Geometry: Theory and Applications. 3: 27-35. DOI: 10.1016/0925-7721(93)90028-5 |
0.379 |
|
| Show low-probability matches. |