default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndranik Mirzaian
Person information
- affiliation: York University, Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j10]Xiaotie Deng
, Evangelos E. Milios, Andranik Mirzaian:
Robot Map Verification of a Graph World. J. Comb. Optim. 5(4): 383-395 (2001)
1990 – 1999
- 1999
- [c8]Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian:
Robot Map Verification of a Graph World. WADS 1999: 86-97 - 1997
- [c7]Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu:
Map Labeling and Its Generalizations. SODA 1997: 148-157 - 1996
- [j9]Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian:
Landmark selection strategies for path execution. Robotics Auton. Syst. 17(3): 171-185 (1996) - [j8]Xiaotie Deng, Andranik Mirzaian:
Competitive robot mapping with homogeneous markers. IEEE Trans. Robotics Autom. 12(4): 532-542 (1996) - [c6]Andranik Mirzaian, Cao An Wang, Yin-Feng Xu:
On Stable Line Segments in Triangulations. CCCG 1996: 62-67 - 1993
- [c5]Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian:
Landmark selection for path execution. IROS 1993: 1339-1346 - [c4]Xiaotie Deng, Andy Mirzaian:
Robot Mapping: Foot-Prints versus Tokens. ISAAC 1993: 353-362 - [c3]Andy Mirzaian:
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs. WADS 1993: 506-517 - 1992
- [j7]Andranik Mirzaian:
Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments. Comput. Geom. 2: 15-30 (1992)
1980 – 1989
- 1989
- [j6]Joseph W. H. Liu, Andranik Mirzaian:
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs. SIAM J. Discret. Math. 2(1): 100-107 (1989) - [c2]Andranik Mirzaian:
A minimum separation algorithm for river routing with bounded number of jogs. ICCAD 1989: 10-13 - 1987
- [j5]Andranik Mirzaian:
A Halving Technique for the Longest Stuttering Subsequence Problem. Inf. Process. Lett. 26(2): 71-75 (1987) - [j4]Andranik Mirzaian:
River Routing in VLSI. J. Comput. Syst. Sci. 34(1): 43-54 (1987) - 1985
- [j3]Andranik Mirzaian, Eshrat Arjomandi:
Selection in X+Y and Matrices With Sorted Rows and Columns. Inf. Process. Lett. 20(1): 13-17 (1985) - [j2]Andranik Mirzaian:
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks 15(1): 1-20 (1985) - 1984
- [c1]Andranik Mirzaian:
Channel Routing in VLSI (Extended Abstract). STOC 1984: 101-107 - 1981
- [j1]Andranik Mirzaian, Kenneth Steiglitz:
A Note on the Complexity of the Star-Star Concentrator Problem. IEEE Trans. Commun. 29(10): 1549-1552 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
