According to our database
1,
William Y. C. Chen
authored at least 121 papers
between 1991 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
The Gessel correspondence and the partial γ-positivity of the Eulerian polynomials on multiset Stirling permutations.
Eur. J. Comb., 2023
2022
Exploring planet geology through force-feedback telemanipulation from orbit.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
Sci. Robotics, 2022
A context-free grammar for the <i>e</i>-positivity of the trivariate second-order Eulerian polynomials.
Discret. Math., 2022
2021
A context-free grammar for the Ramanujan-Shor polynomials.
Adv. Appl. Math., 2021
2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
2018
Stanley's Lemma and Multiple Theta Functions.
SIAM J. Discret. Math., 2018
2017
Context-free grammars for permutations and increasing trees.
Adv. Appl. Math., 2017
The spt-function of Andrews.
Proceedings of the Surveys in Combinatorics, 2017
2016
s-Inversion Sequences and P-Partitions of Type B.
SIAM J. Discret. Math., 2016
Finite differences of the logarithm of the partition function.
Math. Comput., 2016
On permutations with bounded drop size.
Eur. J. Comb., 2016
2014
Detecting Community Structures in Networks Using a Linear-Programming Based Approach: a Review.
Proceedings of the Social Networks: A Framework of Computational Intelligence, 2014
Zigzag Stacks and <i>m</i>-Regular Linear Stacks.
J. Comput. Biol., 2014
Disposition polynomials and plane trees.
Eur. J. Comb., 2014
Ordered partitions avoiding a permutation pattern of length 3.
Eur. J. Comb., 2014
On pattern avoiding alternating permutations.
Eur. J. Comb., 2014
Equivalence Classes of Full-Dimensional 0/1 -Polytopes with Many Vertices.
Discret. Comput. Geom., 2014
On the Positive Moments of Ranks of Partitions.
Electron. J. Comb., 2014
Infinitely log-monotonic combinatorial sequences.
Adv. Appl. Math., 2014
2013
Proof of a positivity conjecture on Schur functions.
J. Comb. Theory, Ser. A, 2013
Proof of Moll's minimum conjecture.
Eur. J. Comb., 2013
Decomposition of Triply Rooted Trees.
Electron. J. Comb., 2013
Linked Partitions and Permutation Tableaux.
Electron. J. Comb., 2013
On 021-Avoiding Ascent Sequences.
Electron. J. Comb., 2013
The sorting index and permutation codes.
Adv. Appl. Math., 2013
<i>q</i>-Hook length formulas for signed labeled forests.
Adv. Appl. Math., 2013
2012
The generating function for the Dirichlet series L<sub>m</sub>(s).
Math. Comput., 2012
The extended Zeilberger algorithm with parameters.
J. Symb. Comput., 2012
Partitions and partial matchings avoiding neighbor patterns.
Eur. J. Comb., 2012
Combinatorial telescoping for an identity of Andrews on parity in partitions.
Eur. J. Comb., 2012
Noncrossing linked partitions and large (3, 2)-Motzkin paths.
Discret. Math., 2012
Euler's Partition Theorem with Upper Bounds on Multiplicities.
Electron. J. Comb., 2012
A Franklin type involution for squares.
Adv. Appl. Math., 2012
Oscillating rim hook tableaux and colored matchings.
Adv. Appl. Math., 2012
2011
Labeled Ballot Paths and the Springer Numbers.
SIAM J. Discret. Math., 2011
Anti-lecture hall compositions and overpartitions.
J. Comb. Theory, Ser. A, 2011
The method of combinatorial telescoping.
J. Comb. Theory, Ser. A, 2011
Han's bijection via permutation codes.
Eur. J. Comb., 2011
The ratio monotonicity of the q-derangement numbers.
Discret. Math., 2011
Singletons and adjacencies of set partitions of type B.
Discret. Math., 2011
Higher order log-concavity in Euler's difference table.
Discret. Math., 2011
Identities Derived from Noncrossing Partitions of Type B.
Electron. J. Comb., 2011
A Bijection between Atomic Partitions and Unsplitable Partitions.
Electron. J. Comb., 2011
Permutation Tableaux and the Dashed Permutation Pattern 32-1.
Electron. J. Comb., 2011
The Abel-Zeilberger Algorithm.
Electron. J. Comb., 2011
On Han's Hook Length Formulas for Trees.
Electron. J. Comb., 2011
Minimal permutations and 2-regular skew tableaux.
Adv. Appl. Math., 2011
2010
Mixed Statistics on 01-Fillings of Moon Polyominoes.
SIAM J. Discret. Math., 2010
Major index for 01-fillings of moon polyominoes.
J. Comb. Theory, Ser. A, 2010
The limiting distribution of the q-derangement numbers.
Eur. J. Comb., 2010
Ratio Monotonicity of Polynomials Derived from Nondecreasing Sequences.
Electron. J. Comb., 2010
Minimally Intersecting Set Partitions of Type B.
Electron. J. Comb., 2010
On Stanley's Partition Function.
Electron. J. Comb., 2010
The <i>q</i>-log-convexity of the Narayana polynomials of type <i>B</i>.
Adv. Appl. Math., 2010
2009
Families of Sets with Intersecting Clusters.
SIAM J. Discret. Math., 2009
The ratio monotonicity of the Boros-Moll polynomials.
Math. Comput., 2009
The q-WZ method for infinite series.
J. Symb. Comput., 2009
Set systems with <i>I</i>-intersections modulo a prime number.
J. Comb. Theory, Ser. A, 2009
Partitions of Z<sub>n</sub> into arithmetic progressions.
Eur. J. Comb., 2009
Pairs of noncrossing free Dyck paths and noncrossing partitions.
Discret. Math., 2009
On the combinatorics of the Pfaff identity.
Discret. Math., 2009
Labeled partitions with colored permutations.
Discret. Math., 2009
Faulhaber's theorem on power sums.
Discret. Math., 2009
Derangement Polynomials and Excedances of Type B.
Electron. J. Comb., 2009
Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams.
Electron. J. Comb., 2009
Hook Length Formulas for Trees by Han's Expansion.
Electron. J. Comb., 2009
2008
Labeled Partitions and the q-Derangement Numbers.
SIAM J. Discret. Math., 2008
The Abel Lemma and the <i>q</i>-Gosper Algorithm.
Math. Comput., 2008
Community Structures of Networks.
Math. Comput. Sci., 2008
A major index for matchings and set partitions.
J. Comb. Theory, Ser. A, 2008
On Postnikov's hook length formula for binary trees.
Eur. J. Comb., 2008
Linked partitions and linked cycles.
Eur. J. Comb., 2008
Riordan paths and derangements.
Discret. Math., 2008
Crossings and Nestings in Tangled Diagrams.
Electron. J. Comb., 2008
The q-WZ method for infinite sums (abstract only).
ACM Commun. Comput. Algebra, 2008
Identities from weighted Motzkin paths.
Adv. Appl. Math., 2008
Converging to Gosper's algorithm.
Adv. Appl. Math., 2008
2007
Weighted forms of Euler's theorem.
J. Comb. Theory, Ser. A, 2007
Matrix identities on weighted partial Motzkin paths.
Eur. J. Comb., 2007
The butterfly decomposition of plane trees.
Discret. Appl. Math., 2007
The Skew and Relative Derangements of Type B.
Electron. J. Comb., 2007
2006
Finite form of the quintuple product identity.
J. Comb. Theory, Ser. A, 2006
Parity reversing involutions on plane trees and 2-Motzkin paths.
Eur. J. Comb., 2006
Old and young leaves on plane trees.
Eur. J. Comb., 2006
Factors of the Gaussian coefficients.
Discret. Math., 2006
Noncrossing Trees and Noncrossing Graphs.
Electron. J. Comb., 2006
Matchings Avoiding Partial Patterns.
Electron. J. Comb., 2006
2005
On the Gosper-Petkovs(ek representation of rational functions.
J. Symb. Comput., 2005
Applicability of the q-analogue of Zeilberger's algorithm.
J. Symb. Comput., 2005
The Flagged Cauchy Determinant.
Graphs Comb., 2005
Reduction of m-regular noncrossing partitions.
Eur. J. Comb., 2005
The Gaussian coefficients and overpartitions.
Discret. Math., 2005
Equivalence classes of matchings and lattice-square designs.
Discret. Appl. Math., 2005
Stable Equivalence over Symmetric Functions.
Electron. J. Comb., 2005
Matrix method for linear sequential dynamical systems on digraphs.
Appl. Math. Comput., 2005
2004
The Minimum All-Ones Problem for Trees.
SIAM J. Comput., 2004
Discrete dynamical systems on graphs and Boolean functions.
Math. Comput. Simul., 2004
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs.
Electron. Notes Discret. Math., 2004
The skew Schubert polynomials.
Eur. J. Comb., 2004
2003
An involution for the Gauss identity.
J. Comb. Theory, Ser. A, 2003
The homogeneous <i>q</i>-difference operator.
Adv. Appl. Math., 2003
2002
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns.
Electron. J. Comb., 2002
2001
Bijections behind the Ramanujan Polynomials.
Adv. Appl. Math., 2001
2000
Adjacency and Parity Relations of Words in Discrete Dynamical Systems.
J. Comb. Theory, Ser. A, 2000
1999
Enumeration of Cubic Graphs by Inclusion-Exclusion.
J. Comb. Theory, Ser. A, 1999
1998
The Pessimistic Search and the Straightening Involution for Trees.
Eur. J. Comb., 1998
1997
Parameter Augmentation for Basic Hypergeometric Series, II.
J. Comb. Theory, Ser. A, 1997
1996
The skew, relative, and classical derangements.
Discret. Math., 1996
1994
A Bijection for Enriched Trees.
Eur. J. Comb., 1994
Restricted routing and wide diameter of the cycle prefix network.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
Context-Free Grammars, Differential Operators and Formal Power Series.
Theor. Comput. Sci., 1993
Induced Cycle Structures of the Hyperoctahedral Group.
SIAM J. Discret. Math., 1993
Cycle prefix digraphs for symmetric interconnection networks.
Networks, 1993
A Coding Algorithm for Rényi Trees.
J. Comb. Theory, Ser. A, 1993
J. Comb. Theory, Ser. A, 1993
Derangements on the n-cube.
Discret. Math., 1993
The theory of compositionals.
Discret. Math., 1993
1992
Integral Matrices with Given Row and Column Sums.
J. Comb. Theory, Ser. A, 1992
q-Analogs of the inclusion- exclusion principle and permutations with restricted position.
Discret. Math., 1992
1991
Maximum (g, f)-factors of a general graph.
Discret. Math., 1991
