default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanting Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Zhihe Zhao, Siyao Du, Zeyan Xu, Zhi Yin, Xiaomei Huang, Xin Huang, Chinting Wong, Yanting Liang, Jing Shen, Jianlin Wu, Jinrong Qu, Lina Zhang, Yanfen Cui, Ying Wang, Leonard Wee
, Andre Dekker, Chu Han, Zaiyi Liu, Zhenwei Shi, Changhong Liang:
SwinHR: Hemodynamic-powered hierarchical vision transformer for breast tumor segmentation. Comput. Biol. Medicine 169: 107939 (2024)- 2022
- [c3]Lisha Yao, Yingda Xia, Haochen Zhang, Jiawen Yao, Dakai Jin, Bingjiang Qiu, Yuan Zhang, Suyun Li, Yanting Liang, Xian-Sheng Hua, Le Lu, Xin Chen, Zaiyi Liu, Ling Zhang:
DeepCRC: Colorectum and Colorectal Cancer Segmentation in CT Scans via Deep Colorectal Coordinate Transform. MICCAI (3) 2022: 564-573
2010 – 2019
- 2019
- [j12]Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang:
Collapsible subgraphs of a 4-edge-connected graph. Discret. Appl. Math. 260: 272-277 (2019) - 2017
- [c2]Zachary M. Blasczyk, Yanting Liang, Keith Ecker, Saleh M. Alnaeli, Mark Hall:
On the prevalence of indirect function calls in middleware software systems. EIT 2017: 86-91 - 2016
- [j11]Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu:
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations. Graphs Comb. 32(3): 1065-1075 (2016) - 2014
- [j10]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j9]Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu:
On minimum balanced bipartitions of triangle-free graphs. J. Comb. Optim. 27(3): 557-566 (2014) - 2012
- [j8]Xiaofeng Gu, Hong-Jian Lai, Yanting Liang:
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. Appl. Math. Lett. 25(10): 1426-1429 (2012) - [j7]Ping Li, Hong-Jian Lai, Yanting Liang:
Characterization of removable elements with respect to having k disjoint bases in a matroid. Discret. Appl. Math. 160(16-17): 2445-2451 (2012) - 2011
- [j6]Hong-Jian Lai, Yanting Liang:
Supereulerian graphs in the graph family C2(6, k). Discret. Appl. Math. 159(6): 467-477 (2011) - [j5]Hong-Jian Lai, Yanting Liang, Ping Li, Jinquan Xu:
Degree sequences and graphs with disjoint spanning trees. Discret. Appl. Math. 159(14): 1447-1452 (2011) - [j4]Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao:
Group connectivity in line graphs. Discret. Math. 311(20): 2295-2307 (2011) - [j3]Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao:
Mod (2p+1)-orientations in line graphs. Inf. Process. Lett. 111(23-24): 1085-1088 (2011) - 2010
- [c1]Ádám M. Halász, Yanting Liang, M. Ani Hsieh, Hong-Jian Lai:
Emergence of Specialization in a Swarm of Robots. DARS 2010: 403-416
2000 – 2009
- 2009
- [j2]Yanting Liang, Bolian Liu:
Semi-regular harmonic graph and equi-bipartite harmonic graph. Ars Comb. 93 (2009) - 2008
- [j1]Hong-Jian Lai, Yanting Liang, Yehong Shao:
On s-hamiltonian-connected line graphs. Discret. Math. 308(18): 4293-4297 (2008)
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-06-10 21:25 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:
