- Optimization: linear programming, combinatorial and convex optimization;
- Computational Geometry: triangulations, Hamiltonian visibility graphs, map labelling, GIS.
Andranik received his Ph.D. in Computer Science from Princeton in 1981. He is interested primarily in computation geometry, combinatorial optimization, graph algorithms, computational robotics, data structures and program animation.
Professor Mirzaian has extensive knowledge and expertise in combinatorial and optimization algorithms such as computational geometry, graph algorithms, linear programming, and convex optimization.
- X. Deng, E. Milios, A. Mirzaian, “Robot Map Verification of a Graph World”, Journal of Combinatorial Optimization 5:4, 383-395, December 2001.
- A. Mirzaian, ” Minimum weight Euclidean matching and weighted relative neighborhood graphs “, Proc. of the Workshop on Algorithms and Data Structures (WADS 93), Montreal, Canada, Springer-Verlag LNCS 709, 506-517, August 1993.
- A. Mirzaian, ” Hamiltonian triangulations and circumscribing polygons of disjoint line segments “, Computational Geometry: Theory and Applications, Vol. 2, 15-30,1992.
- A. Mirzaian, ” River routing in VLSI “, Journal of Computer and System Sciences, 34(1), 43-54, Feb. 1987. Also in STOC’84, 101-107, May 1984
- A. Mirzaian, ” Lagrangian relaxation for the star-star concentrator location problem: approximation algorithms and bounds “, J. of Networks, 15, 1-20, Spring 1985.