default search action
Anhua Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j10]Anhua Lin, Jianzhong Zhang, Xiangzhou Jiang, Jingya Zhang:
A reliable and energy-efficient outdoor localisation method for smartphones. Int. J. Ad Hoc Ubiquitous Comput. 23(3/4): 230-242 (2016) - 2014
- [c3]Anhua Lin, Jianzhong Zhang, Kai Lu, Wen Zhang:
An efficient outdoor localization method for smartphones. ICCCN 2014: 1-8 - [c2]Yuwei Xu, Ying Wu, Jingdong Xu, Tingting Liu, Jian Wang, Anhua Lin:
An efficient detection scheme for urban traffic condition using volunteer probes. ICPADS 2014: 768-773 - 2012
- [c1]Anhua Lin, Jianzhong Zhang, Yu Zhang, Zhicheng Wang, Gang Yu:
An Efficient Mechanism for Querying Offline Map Database on Smartphones. CIT 2012: 76-81 - 2011
- [j9]Christine T. Cheng, Anhua Lin:
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings. SIAM J. Discret. Math. 25(1): 72-94 (2011) - 2010
- [j8]Xugang Ye, Shih-Ping Han, Anhua Lin:
A Note on the Connection Between the Primal-Dual and the A* Algorithm. Int. J. Oper. Res. Inf. Syst. 1(1): 73-85 (2010) - [j7]Anhua Lin:
On a special class of regularized central paths for semidefinite programs. Math. Program. 122(1): 65-85 (2010)
2000 – 2009
- 2009
- [j6]Anhua Lin, Rong Luo, Xiaoya Zha:
On sharp bounds of the zero-order Randic index of certain unicyclic graphs. Appl. Math. Lett. 22(4): 585-589 (2009) - [j5]Yinmei Cao, Anhua Lin, Rong Luo, Xiaoya Zha:
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures. Discret. Appl. Math. 157(5): 913-919 (2009) - 2008
- [j4]Anhua Lin, Rong Luo, Xiaoya Zha:
A sharp lower bound of the Randic index of cacti with r pendants. Discret. Appl. Math. 156(10): 1725-1735 (2008) - [j3]Anhua Lin:
A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs. SIAM J. Optim. 18(4): 1414-1435 (2008) - 2004
- [j2]Anhua Lin, Shih-Ping Han:
A Class of Methods for Projection on the Intersection of Several Ellipsoids. SIAM J. Optim. 15(1): 129-138 (2004) - 2002
- [j1]Anhua Lin, Shih-Ping Han:
On the Distance between Two Ellipsoids. SIAM J. Optim. 13(1): 298-308 (2002)
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-25 05:48 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: