default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAn Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Song Tang, An Chang, Fabian Zhang, Xiatian Zhu, Mao Ye, Changshui Zhang:
Source-Free Domain Adaptation via Target Prediction Distribution Searching. Int. J. Comput. Vis. 132(3): 654-672 (2024)- [j25]Bin Chen
, An Chang:
Disjoint cycles in tournaments and bipartite tournaments. J. Graph Theory 105(2): 297-314 (2024) - 2023
- [j24]Jianjun Shen, Siyi Lu, Ruize Qu, Hao Zhao, Yu Zhang, An Chang, Li Zhang, Wei Fu, Zhipeng Zhang:
Measuring distance from lowest boundary of rectal tumor to anal verge on CT images using pyramid attention pooling transformer. Comput. Biol. Medicine 155: 106675 (2023) - [j23]Bin Chen, An Chang:
A note on Seymour's second neighborhood conjecture. Discret. Appl. Math. 337: 272-277 (2023) - [j22]Guorong Gao, An Chang, Qi Sun:
Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs. Discret. Math. 346(1): 113128 (2023) - [j21]Bin Chen, An Chang:
Oriented diameter of graphs with given girth and maximum degree. Discret. Math. 346(4): 113287 (2023) - [j20]Jianjun Shen, Siyi Lu, Ruize Qu, Hao Zhao, Li Zhang, An Chang, Yu Zhang, Wei Fu, Zhipeng Zhang:
A boundary-guided transformer for measuring distance from rectal tumor to anal verge on magnetic resonance images. Patterns 4(4): 100711 (2023) - 2022
- [j19]Guorong Gao, An Chang:
A Linear Hypergraph Extension of Turán's Theorem. Electron. J. Comb. 29(4) (2022) - [j18]Bin Chen, An Chang:
Turán number of 3-free strong digraphs with out-degree restriction. Discret. Appl. Math. 314: 252-264 (2022) - [j17]An Chang, Yu Zhang, Shunli Zhang, Leisheng Zhong, Li Zhang:
Detecting prohibited objects with physical size constraint from cluttered X-ray baggage images. Knowl. Based Syst. 237: 107916 (2022) - [j16]Guorong Gao, An Chang, Yuan Hou:
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$. SIAM J. Discret. Math. 36(2): 1000-1011 (2022) - 2021
- [j15]Bin Chen, An Chang:
Diameter Three Orientability of Bipartite Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j14]Yuan Hou, An Chang, Joshua Cooper:
Spectral Extremal Results for Hypergraphs. Electron. J. Comb. 28(3) (2021) - [j13]Guorong Gao, An Chang:
A linear hypergraph extension of the bipartite Turán problem. Eur. J. Comb. 93: 103269 (2021) - [j12]Bin Chen, An Chang:
3-Free Strong Digraphs with the Maximum Size. Graphs Comb. 37(6): 2535-2554 (2021) - 2020
- [j11]Sarula Chang, An Chang, Yirong Zheng:
The leaf-free graphs with nullity 2c(G)-1. Discret. Appl. Math. 277: 44-54 (2020) - [j10]Leisheng Zhong, Yu Zhang, Hao Zhao, An Chang, Wenhao Xiang, Shunli Zhang, Li Zhang:
Seeing Through the Occluders: Robust Monocular 6-DOF Object Pose Tracking via Model-Guided Video Object Segmentation. IEEE Robotics Autom. Lett. 5(4): 5159-5166 (2020)
2010 – 2019
- 2018
- [j9]Bo Deng, An Chang:
The higher Balaban index on weighted matrix. Ars Comb. 137: 395-402 (2018) - 2017
- [j8]Bo Deng, An Chang, Haixing Zhao:
Spectral determination of a class of tricyclic graphs. Ars Comb. 131: 123-141 (2017) - 2015
- [j7]Dong-Hong Zhu, Ya-Ping Chang, An Chang:
Effects of free gifts with purchase on online purchase satisfaction: The moderating role of uncertainty. Internet Res. 25(5): 690-706 (2015) - 2014
- [j6]Jianxi Li, Ji-Ming Guo, Wai Chee Shiu, An Chang:
An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications. Discret. Appl. Math. 171: 104-115 (2014) - 2013
- [j5]Jinshan Xie, An Chang:
On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph. Numer. Linear Algebra Appl. 20(6): 1030-1045 (2013) - 2010
- [j4]Jianxi Li, Wai Chee Shiu, An Chang:
The number of spanning trees of a graph. Appl. Math. Lett. 23(3): 286-290 (2010)
2000 – 2009
- 2007
- [j3]Wai Chee Shiu, An Chang:
On the kth Eigenvalues of Trees with Perfect Matchings. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - 2003
- [j2]An Chang:
On the largest eigenvalue of a tree with perfect matchings. Discret. Math. 269(1-3): 45-63 (2003) - 2001
- [j1]Qiongxiang Huang, An Chang:
Circulant digraphs determined by their spectra. Discret. Math. 240(1-3): 261-270 (2001)
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-07-21 21:09 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:
