default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei-Tian Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu
, Zhishi Pan:
On k-shifted antimagic spider forests. Discret. Appl. Math. 358: 468-476 (2024)- [j13]Hong-Bin Chen, Wei-Han Chen, Yen-Jen Cheng, Wei-Tian Li, Chia-An Liu:
Ramsey properties for V-shaped posets in the Boolean lattice. Discret. Math. 347(7): 114045 (2024) - 2022
- [j12]Eranda Dhananjaya, Wei-Tian Li:
Antimagic labeling of forests with sets of consecutive integers. Discret. Appl. Math. 309: 75-84 (2022) - [j11]Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Rainbow Ramsey Problems for the Boolean Lattice. Order 39(3): 453-463 (2022) - 2021
- [j10]Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li, Zhishi Pan:
Shifted-Antimagic Labelings for Graphs. Graphs Comb. 37(3): 1065-1082 (2021) - 2020
- [j9]Hong-Bin Chen, Yen-Jen Cheng, Wei-Tian Li, Chia-An Liu:
The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains. Electron. J. Comb. 27(4): 4 (2020) - 2019
- [j8]Yu-Lun Chang, Wei-Tian Li:
Some Remarks on Nestings in the Normalized Matching Posets of Rank 3. Order 36(3): 501-505 (2019) - 2018
- [j7]Jun-Yi Guo, Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li:
Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices. Order 35(2): 349-362 (2018) - 2015
- [j6]Jerrold R. Griggs, Wei-Tian Li:
Poset-free families and Lubell-boundedness. J. Comb. Theory A 134: 166-187 (2015) - 2014
- [j5]Hong-Bin Chen, Wei-Tian Li:
A Note on the Largest Size of Families of Sets with a Forbidden Poset. Order 31(1): 137-142 (2014) - 2013
- [j4]Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih:
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. Electron. J. Comb. 20(3): 38 (2013) - [j3]Jerrold R. Griggs, Wei-Tian Li:
The partition method for poset-free families. J. Comb. Optim. 25(4): 587-596 (2013) - 2012
- [j2]Jerrold R. Griggs, Wei-Tian Li, Linyuan Lu:
Diamond-free families. J. Comb. Theory A 119(2): 310-322 (2012) - 2010
- [j1]Wei-Tian Li, Linyuan Lu, Yiting Yang:
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes. SIAM J. Discret. Math. 24(4): 1482-1494 (2010)
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-09-10 01:12 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:
