default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip B. Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Sergey Kitaev
, Philip B. Zhang:
Non-overlapping descents and ascents in stack-sortable permutations. Discret. Appl. Math. 344: 112-119 (2024)- [j20]Joanna N. Chen, Sergey Kitaev, Philip B. Zhang:
Distributions of statistics on separable permutations. Discret. Appl. Math. 355: 169-179 (2024) - [j19]Yujie Du, Philip B. Zhang:
On enumeration of pattern-avoiding Fishburn permutations. Discret. Math. 347(6): 113952 (2024) - 2023
- [j18]Siyi Wu, Philip B. Zhang:
The log-concavity of Kazhdan-Lusztig polynomials of thagomizer matroids. Discret. Math. 346(7): 113381 (2023) - [j17]Matthew H. Y. Xie, Philip B. Zhang:
The Log-Concavity of Kazhdan-Lusztig Polynomials of Uniform Matroids. J. Syst. Sci. Complex. 36(1): 117-128 (2023) - 2021
- [j16]Alice L. L. Gao, Linyuan Lu, Matthew H. Y. Xie, Arthur L. B. Yang, Philip B. Zhang:
The Kazhdan-Lusztig polynomials of uniform matroids. Adv. Appl. Math. 122: 102117 (2021) - [j15]Zhicong Lin, Jun Ma, Philip B. Zhang:
Statistics on multipermutations and partial γ-positivity. J. Comb. Theory A 183: 105488 (2021) - 2020
- [j14]Sergey Kitaev, Philip B. Zhang, Xutong Zhang:
Distributions of several infinite families of mesh patterns. Appl. Math. Comput. 372 (2020)
2010 – 2019
- 2019
- [j13]James Haglund, Philip B. Zhang:
Real-rootedness of variations of Eulerian polynomials. Adv. Appl. Math. 109: 38-54 (2019) - [j12]Sergey Kitaev, Philip B. Zhang:
Distributions of mesh patterns of short lengths. Adv. Appl. Math. 110: 1-32 (2019) - [j11]Philip B. Zhang:
On the Real-Rootedness of the Local h-Polynomials of Edgewise Subdivisions. Electron. J. Comb. 26(1): 1 (2019) - [j10]Philip B. Zhang, Xutong Zhang:
Multivariate stable Eulerian polynomials on segmented permutations. Eur. J. Comb. 78: 155-162 (2019) - [j9]Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner, Philip B. Zhang:
On a Greedy Algorithm to Construct Universal Cycles for Permutations. Int. J. Found. Comput. Sci. 30(1): 61-72 (2019) - 2018
- [j8]Herman Z. Q. Chen, Arthur L. B. Yang, Philip B. Zhang:
Kirillov's Unimodality Conjecture for the Rectangular Narayana Polynomials. Electron. J. Comb. 25(1): 1 (2018) - [j7]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
On Pattern Avoiding Indecomposable Permutations. Integers 18: A2 (2018) - [j6]Chunmei Luo, Liancui Zuo, Philip B. Zhang:
The Wiener index of Sierpiński-like graphs. J. Comb. Optim. 35(3): 814-841 (2018) - 2017
- [j5]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
On 132-representable graphs. Australas. J Comb. 69: 105-118 (2017) - [j4]Arthur L. B. Yang, Philip B. Zhang:
Brenti's Open Problem on the Real-Rootedness of q-Eulerian Polynomials of Type D. SIAM J. Discret. Math. 31(2): 918-926 (2017) - 2016
- [j3]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
Pattern-avoiding alternating words. Discret. Appl. Math. 207: 56-66 (2016) - [j2]Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
Avoiding vincular patterns on alternating words. Discret. Math. 339(8): 2079-2093 (2016) - 2015
- [j1]Philip B. Zhang:
On the Real-Rootedness of the Descent Polynomials of (n-2)-Stack Sortable Permutations. Electron. J. Comb. 22(4): 4 (2015)
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-08-05 21:10 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:
