Andranik Mirzaian

Affiliations:
  • York University, Toronto, Canada


According to our database1, Andranik Mirzaian authored at least 17 papers between 1981 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2001
Robot Map Verification of a Graph World.
J. Comb. Optim., 2001

1997
Map Labeling and Its Generalizations.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Competitive robot mapping with homogeneous markers.
IEEE Trans. Robotics Autom., 1996

Landmark selection strategies for path execution.
Robotics Auton. Syst., 1996

On Stable Line Segments in Triangulations.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1993
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Robot Mapping: Foot-Prints versus Tokens.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Landmark selection for path execution.
Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems, 1993

1992
Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments.
Comput. Geom., 1992

1989
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs.
SIAM J. Discret. Math., 1989

A minimum separation algorithm for river routing with bounded number of jogs.
Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

1987
River Routing in VLSI.
J. Comput. Syst. Sci., 1987

A Halving Technique for the Longest Stuttering Subsequence Problem.
Inf. Process. Lett., 1987

1985
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds.
Networks, 1985

Selection in X+Y and Matrices With Sorted Rows and Columns.
Inf. Process. Lett., 1985

1984
Channel Routing in VLSI (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1981
A Note on the Complexity of the Star-Star Concentrator Problem.
IEEE Trans. Commun., 1981


  Loading...