default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChih-Wen Weng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j21]Yu-Pei Huang, Yeh-jong Pan, Chih-Wen Weng:
Nonexistence of a Class of Distance-Regular Graphs. Electron. J. Comb. 22(2): 2 (2015)- 2014
- [j20]Jun Guo, Kaishun Wang, Chih-Wen Weng:
Pooling semilattices and non-adaptive pooling designs. Discret. Math. 320: 64-72 (2014) - [j19]Yu-Pei Huang, Chih-Wen Weng:
Spectral radius and Average 2-Degree sequence of a Graph. Discret. Math. Algorithms Appl. 6(2) (2014) - 2010
- [j18]Hau-wen Huang, Chih-Wen Weng:
The edge-flipping group of a graph. Eur. J. Comb. 31(3): 932-942 (2010) - [j17]Hau-wen Huang, Chih-Wen Weng:
The flipping puzzle on a graph. Eur. J. Comb. 31(6): 1567-1578 (2010) - [j16]Tayuan Huang, Kaishun Wang, Chih-Wen Weng:
A class of error-correcting pooling designs over complexes. J. Comb. Optim. 19(4): 486-491 (2010) - 2009
- [j15]Yeh-jong Pan, Chih-Wen Weng:
A note on triangle-free distance-regular graphs with a2!=0. J. Comb. Theory B 99(1): 266-270 (2009) - 2008
- [j14]Hau-wen Huang, Yu-Pei Huang, Chih-Wen Weng:
More on pooling spaces. Discret. Math. 308(24): 6330-6338 (2008) - [j13]Tayuan Huang, Kaishun Wang, Chih-Wen Weng:
Pooling spaces associated with finite geometry. Eur. J. Comb. 29(6): 1483-1491 (2008) - [j12]Yeh-jong Pan, Chih-Wen Weng:
3-bounded property in a triangle-free distance-regular graph. Eur. J. Comb. 29(7): 1634-1642 (2008) - 2005
- [j11]Paul M. Terwilliger, Chih-Wen Weng:
An inequality for regular near polygons. Eur. J. Comb. 26(2): 227-235 (2005) - [j10]Arkadii G. D'yachkov, Frank K. Hwang, Anthony J. Macula, Pavel A. Vilenkin, Chih-Wen Weng:
A Construction of Pooling Designs with Some Happy Surprises. J. Comput. Biol. 12(8): 1129-1136 (2005) - 2004
- [j9]Tayuan Huang, Chih-Wen Weng:
Pooling spaces and non-adaptive pooling designs. Discret. Math. 282(1-3): 163-169 (2004) - [j8]Paul M. Terwilliger, Chih-Wen Weng:
Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra. Eur. J. Comb. 25(2): 287-298 (2004) - 2003
- [j7]Tayuan Huang, Chih-Wen Weng:
A Note on Decoding of Superimposed Codes. J. Comb. Optim. 7(4): 381-384 (2003) - 2002
- [j6]Chih-Wen Shih, Chih-Wen Weng:
On the Templates Corresponding to Cycle-Symmetric Connectivity in Cellular Neural Networks. Int. J. Bifurc. Chaos 12(12): 2957-2966 (2002) - 2001
- [j5]Ping-Hong Wei, Chih-Wen Weng:
A typical vertex of a tree. Discret. Math. 226(1-3): 337-345 (2001) - 1998
- [j4]Chih-Wen Weng:
Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs. Graphs Comb. 14(3): 275-304 (1998) - 1997
- [j3]Chih-Wen Weng:
D-bounded Distance-regular Graphs. Eur. J. Comb. 18(2): 211-229 (1997) - [j2]Yuh-jeng Liang, Chih-Wen Weng:
Parallelogram-Free Distance-Regular Graphs. J. Comb. Theory B 71(2): 231-243 (1997) - 1995
- [j1]Chih-Wen Weng:
Kite-freeP- andQ-polynomial schemes. Graphs Comb. 11(2): 201-207 (1995)
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 2025-01-09 12:55 CET 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:
