Boris Aronov, Ph.D.
Professor
General Information
Room: LC 236
Phone: 718.260.3092
Fax: 718-260-3609
E-mail:baronov@poly.edu
Website: http://cis.poly.edu/~aronov/

Research Interest
- Computational and Combinatorial Geometry
- Algorithms

Profile
Boris Aronov received his B.A. in Computer Science and Mathematics from Queens College of the City University of New York in 1984 and his M.S. and Ph.D. in Computer Science from the Courant Institute at New York University in 1986 and 1989. He has worked in the areas of computational and combinatorial geometry and their applications. He works both on developing efficient algorithms for geometric problems and showing that certain questions are inherently hard to answer. His interests span a range of topics, from motion planning for robots, to shortest-path problems, to visibility questions and analysis of multidimensional arrangements. He also works on geometric problems of combinatorial nature. He has published journal papers in several of these areas, and his work has been supported by grants from the National Science Foundation and by a Sloan Research Fellowship. Professor Aronov is also interested in developing tools for dealing with situations where the difficulty of solving a problem depends less on the input size, and more on some more subtle aspects of the input. He has taught a variety of courses, both graduate and undergraduate, including compiler design, programming languages, algorithms, theory of computation, and computational geometry.
Selected Publications
-
P.K. Agarwal, B. Aronov and M. Sharir, "On the Complexity of Many Faces in Arrangements of Circles," Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), Las Vegas, Nevada, 2001, pp. 74--83.
-
P.K. Agarwal, B. Aronov, and M. Sharir, "Exact and approximation algorithms for minimum-width cylindrical shells," Discrete and Computational Geometry, 26:307-320 (2001).
-
B. Aronov, J.E. Goodman, R. Pollack, and R. Wenger, "A Helly-type theorem for hyperplane transversals to well-separated convex sets," Discrete and Computational Geometry, 25:507--517 (2001).
-
For a complete publication list, please go to http://cis.poly.edu/~aronov/index.html#publications.

Education
- Ph.D. Courant Institute, New York University, 1989
|