default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChi Wang 0002
Person information
- affiliation: J. Walter Thompson, New Media Department, Detroit, MI, USA
- affiliation: University of Louisville, Department of Mathematics, KY, USA
- affiliation: Rutgers University, Hill Center, New Brunswick, NJ, USA
Other persons with the same name
- Chi Wang — disambiguation page
- Chi Wang 0001
![[0000-0001-5610-5547]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5610-5547")
— Microsoft Research, Redmond, WA, USA (and 1 more) - Chi Wang 0003 — University of Kentucky, Markey Cancer Center, Lexington, KY, USA (and 1 more)
Other persons with a similar name
- Wang Chi Cheung
- Chi-Wang Shu — Brown University, Division of Applied Mathematics, USA
- Cheng-Chi Wang
- Chi-Hsu Wang
- Chi-Hua Wang
- Chi-Kuei Wang
- Chi-Wei Wang
- Szu-Chi Wang
- Ting-Chi Wang
- Yi-Chi Wang
- show all similar names
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j10]Li Sheng, Chi Wang, Peisen Zhang:
Tagged Probe Interval Graphs. J. Comb. Optim. 5(1): 133-142 (2001)- [j9]Fred R. McMorris, Fred S. Roberts, Chi Wang:
The center function on trees. Networks 38(2): 84-87 (2001) - 2000
- [j8]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang:
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219(1-3): 17-26 (2000)
1990 – 1999
- 1999
- [j7]André E. Kézdy, Chi Wang:
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. Discret. Math. 194(1-3): 261-265 (1999) - [c1]Li Sheng, Chi Wang, Peisen Zhang:
On the perfectness of tagged probe interval graphs. Discrete Mathematical Problems with Medical Applications 1999: 159-163 - 1998
- [j6]Fred R. McMorris, Chi Wang, Peisen Zhang:
On Probe Interval Graphs. Discret. Appl. Math. 88(1-3): 315-324 (1998) - 1996
- [j5]Fred R. McMorris, Chi Wang:
Modular intersection graphs. Graphs Comb. 12(1): 267-281 (1996) - [j4]André E. Kézdy, Hunter S. Snevily, Chi Wang:
Partitioning Permutations into Increasing and Decreasing Subsequences. J. Comb. Theory A 73(2): 353-359 (1996) - 1992
- [j3]Chi Wang, A. C. Williams:
Addendum to the threshold order of a Boolean function. Discret. Appl. Math. 36(2): 207 (1992) - 1991
- [j2]Chi Wang, A. C. Williams:
The threshold order of a Boolean function. Discret. Appl. Math. 31(1): 51-69 (1991) - [j1]Chi Wang, A. C. Williams:
The threshold weight of a graph. J. Graph Theory 15(3): 235-249 (1991)
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 00:31 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:
