Toufik Mansour

,

Australas. J Comb., February, 2025

Smooth convex polyiamonds.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2025

Sorting inversion sequences.

[BibT_eX]

[DOI]

,

Howard Skogman

,

Rebecca Smith

Discret. Math. Theor. Comput. Sci., 2025

Wilf classes for weak ascent sequences avoiding a pair or triple of length-3 patterns.

[BibT_eX]

[DOI]

,

Discret. Math., 2025

Counting r×s rectangles in (Catalan) words.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2025

Ascent Sequences Avoiding a Triple of Length-3 Patterns.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2025

An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences.

[BibT_eX]

[DOI]

Ilias S. Kotsireas

,

,

J. Symb. Comput., 2024

Counting of Descents in a Bargraph and Barpolyiamond.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2024

Set partitions avoid a four-letter pattern.

[BibT_eX]

[DOI]

Discret. Math., 2024

Further results on random walk labelings.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2024

On the maximal sum of the entries of a matrix power.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., 2024

Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., 2024

Graph labelings obtainable by random walks.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., August, 2023

Counting inversion sequences by parity successions and runs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., May, 2023

Counting occurrences of subword patterns in non-crossing partitions.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., March, 2023

The length of the initial longest increasing sequence in a permutation.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., February, 2023

Inversion sequences avoiding 021 and another pattern of length four.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2023

Pattern Avoidance in Weak Ascent Sequences.

[BibT_eX]

[DOI]

Beáta Bényi

,

,

José Luis Ramírez

Discret. Math. Theor. Comput. Sci., 2023

Inversion Sequences Avoiding a Triple of Patterns of 3 Letters.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2023

A Decomposition of Column-Convex Polyominoes and Two Vertex Statistics.

[BibT_eX]

[DOI]

Nenad Cakic

,

,

Math. Comput. Sci., 2022

Pattern occurrences in k-ary words revisited: A few new and old observations.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2022

Counting Border Edges in Bargraphs.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2022

Further enumeration results concerning a recent equivalence of restricted inversion sequences.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2022

A maxdrop statistic for standard Young tableaux.

[BibT_eX]

[DOI]

Mark Dukes

,

Discret. Math. Algorithms Appl., 2022

Alternating Eulerian polynomials and left peak polynomials.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Smooth Column Convex Polyominoes.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2022

On the Merrifield-Simmons index of tricyclic graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2022

Alphabetic points in restricted growth functions.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2022

Pushes in words-a primitive sorting algorithm.

[BibT_eX]

[DOI]

,

,

,

,

Contributions Discret. Math., 2022

On a question of Li concerning an uncounted class of circular permutations.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2022

On avoiding 1233.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., 2022

Subregularity in infinitely labeled generating trees of restricted permutations.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., 2022

Avoiding a pair of patterns in multisets and compositions.

[BibT_eX]

[DOI]

,

,

,

Adv. Appl. Math., 2022

Convergence of $$\lambda $$-Bernstein operators via power series summability method.

[BibT_eX]

[DOI]

,

,

,

J. Appl. Math. Comput., February, 2021

A Parametric Generalization of the Baskakov-Schurer-Szász-Stancu Approximation Operators.

[BibT_eX]

[DOI]

Naim L. Braha

,

,

Hari Mohan Srivastava

Symmetry, 2021

Counting Lattice Points on Bargraphs of Catalan Words.

[BibT_eX]

[DOI]

,

José Luis Ramírez

,

Diana A. Toquica

Math. Comput. Sci., 2021

On Column-Convex and Convex Carlitz Polyominoes.

[BibT_eX]

[DOI]

,

,

Math. Comput. Sci., 2021

Statistics on Bargraphs of Catalan Words.

[BibT_eX]

[DOI]

,

,

José Luis Ramírez

J. Autom. Lang. Comb., 2021

Impulse Propagation in Compositions and Words.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Math. Math. Sci., 2021

Enumeration of various animals on the triangular lattice.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2021

Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2021

Fixed points of a random restricted growth sequence.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2021

On conjecture of Merrifield-Simmons index.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2021

Semi-perimeter and inner site-perimeter of k-ary words and bargraphs.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2021

Horizontal visibility graph of a random restricted growth sequence.

[BibT_eX]

[DOI]

,

,

Alexander Roitershtein

Adv. Appl. Math., 2021

On Stanley-Wilf limit of the pattern 1324.

[BibT_eX]

[DOI]

,

Christian Nassau

Adv. Appl. Math., 2021

Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations.

[BibT_eX]

[DOI]

,

,

Alexander Roitershtein

SIAM J. Discret. Math., 2020

The Depth of Compositions.

[BibT_eX]

[DOI]

,

,

,

Math. Comput. Sci., 2020

Restricted Lego Towers.

[BibT_eX]

[DOI]

,

,

J. Autom. Lang. Comb., 2020

Counting Permutations by the Number of Vertical Edges in Their Bargraphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Autom. Lang. Comb., 2020

Staircase patterns in words: Subsequences, subwords, and separation number.

[BibT_eX]

[DOI]

,

,

Alexander Roitershtein

Eur. J. Comb., 2020

Partial duality for ribbon graphs, I: Distributions.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2020

A simple sorting algorithm for compositions.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Algorithms Appl., 2020

Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2020

Permutation Patterns and Cell Decompositions.

[BibT_eX]

[DOI]

,

Math. Comput. Sci., 2019

Cell Patterns in Integer Partitions.

[BibT_eX]

[DOI]

,

,

Daniel Yaqubi

J. Autom. Lang. Comb., 2019

Harary index of bipartite graphs.

[BibT_eX]

[DOI]

Hanyuan Deng

,

Selvaraj Balachandran

,

Suresh Elumalai

,

Electron. J. Graph Theory Appl., 2019

Passing through a stack k times with reversals.

[BibT_eX]

[DOI]

,

Howard Skogman

,

Rebecca Smith

Eur. J. Comb., 2019

Passing through a stack k times.

[BibT_eX]

[DOI]

,

Howard Skogman

,

Rebecca Smith

Discret. Math. Algorithms Appl., 2019

The Perimeter and Site-Perimeter of Set Partitions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Circular bargraphs.

[BibT_eX]

[DOI]

Nenad Cakic

,

,

Appl. Math. Comput., 2019

Protected cells in bargraphs.

[BibT_eX]

[DOI]

,

,

Daniel Yaqubi

Australas. J Comb., 2019

New bounds on the hyper-Zagreb index for the simple connected graphs.

[BibT_eX]

[DOI]

Suresh Elumalai

,

,

Mohammad-Ali Rostami

Electron. J. Graph Theory Appl., 2018

Impulse parameter and a new equivalence between 123- and 132-avoiding permutations.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2018

On the genus distributions of wheels and of related graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2018

Calculating genus polynomials via string operations and matrices.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2018

Interior vertices in set partitions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

A polynomial generalization of some associated sequences related to set partitions.

[BibT_eX]

[DOI]

,

Period. Math. Hung., 2017

The Descent Statistic on Signed Simsun Permutations.

[BibT_eX]

[DOI]

,

,

Haina Wang

J. Autom. Lang. Comb., 2017

Counting triangulations of some classes of subdivided convex polygons.

[BibT_eX]

[DOI]

,

Christian Krattenthaler

,

Eur. J. Comb., 2017

Wilf classification of triples of 4-letter patterns II.

[BibT_eX]

[DOI]

,

,

Discret. Math. Theor. Comput. Sci., 2017

Wilf classification of triples of 4-letter patterns I.

[BibT_eX]

[DOI]

,

,

Discret. Math. Theor. Comput. Sci., 2017

The perimeter of words.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2017

Nine classes of permutations enumerated by binomial transform of Fine's sequence.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2017

Valence-partitioned genus polynomials and their application to generalized dipoles.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2017

Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2016

Counting triangulations of balanced subdivisions of convex polygons.

[BibT_eX]

[DOI]

,

Christian Krattenthaler

,

Electron. Notes Discret. Math., 2016

Combinatorial conjectures that imply local log-concavity of graph genus polynomials.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2016

A statistic related to trees and words on a finite alphabet.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2016

Counting permutations by the number of successions within cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

On a combinatorial problem in botanical epidemiology.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2016

Pattern restricted Stirling k-ary words, the plateau statistic and the kernel method.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2016

Iterated claws have real-rooted genus polynomials.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2016

Degenerate Mittag-Leffler polynomials.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2016

Partitions according to multiplicities and part sizes.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2016

Log-Concavity of Combinations of Sequences and Applications to Genus Distributions.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2015

Log-concavity of the genus polynomials of Ringel Ladders.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Graph Theory Appl., 2015

On avoidance of patterns of the form σ-τ by words over a finite alphabet.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2015

Counting subwords in flattened partitions of sets.

[BibT_eX]

[DOI]

,

,

Stephan G. Wagner

Discret. Math., 2015

The 1/k-Eulerian polynomials and k-Stirling permutations.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

Some results on the avoidance of vincular patterns by multisets.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2015

Some Combinatorial Arrays Related to the Lotka-Volterra System.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2015

Degenerate poly-Cauchy polynomials.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2015

Barnes-type degenerate Euler polynomials.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2015

On the real-rootedness of generalized Touchard polynomials.

[BibT_eX]

[DOI]

Chak-On Chow

,

Appl. Math. Comput., 2015

Set partitions with circular successions.

[BibT_eX]

[DOI]

,

Augustine O. Munagi

Eur. J. Comb., 2014

Log-concavity of genus distributions of ring-like families of graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2014

Congruence successions in compositions.

[BibT_eX]

[DOI]

,

,

Mark C. Wilson

Discret. Math. Theor. Comput. Sci., 2014

Some enumerative results related to ascent sequences.

[BibT_eX]

[DOI]

,

Discret. Math., 2014

Cut equivalence of d-dimensional guillotine partitions.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2014

On the Group of Alternating Colored Permutations.

[BibT_eX]

[DOI]

Eli Bagno

,

David Garber

,

Electron. J. Comb., 2014

Total Embedding Distributions of Circular Ladders.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2013

Efficient generation of restricted growth words.

[BibT_eX]

[DOI]

,

Vincent Vajnovszki

Inf. Process. Lett., 2013

Counting humps and peaks in generalized Motzkin paths.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

A combinatorial approach to a general two-term recurrence.

[BibT_eX]

[DOI]

,

Christopher R. S. Banerji

Discret. Appl. Math., 2013

A notion of graph likelihood and an infinite monkey theorem

[BibT_eX]

[DOI]

,

,

Simone Severini

CoRR, 2013

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations.

[BibT_eX]

[DOI]

,

Gill Barequet

,

Mireille Bousquet-Mélou

,

,

Ron Y. Pinter

Electron. J. Comb., 2013

The generalized Touchard polynomials revisited.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2013

Polynomials whose coefficients are generalized Tribonacci numbers.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2013

On multiple pattern avoiding set partitions.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., 2013

Avoiding Type (1, 2) or (2, 1) Patterns in a Partition of a Set.

[BibT_eX]

[DOI]

,

Integers, 2012

Embedding Distributions and Chebyshev Polynomials.

[BibT_eX]

[DOI]

,

,

Qian Zou

Graphs Comb., 2012

Variation Statistics on Compositions.

[BibT_eX]

[DOI]

,

,

Fundam. Informaticae, 2012

A general two-term recurrence and its solution.

[BibT_eX]

[DOI]

,

Shashikant Mulay

,

Eur. J. Comb., 2012

Catalan numbers and pattern restricted set partitions.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

Genus distributions of star-ladders.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

Record statistics in a random composition.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

On the Stirling numbers associated with the meromorphic Weyl algebra.

[BibT_eX]

[DOI]

,

,

Appl. Math. Lett., 2012

Set partitions as geometric words.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2012

Maximizing a Sum Related to Image Segmentation Evaluation.

[BibT_eX]

[DOI]

Johannes Hatzl

,

,

J. Math. Model. Algorithms, 2011

The q-Calkin-Wilf tree.

[BibT_eX]

[DOI]

Bruce Bates

,

J. Comb. Theory A, 2011

The kernel method and systems of functional equations with several conditions.

[BibT_eX]

[DOI]

Qing-Hu Hou

,

J. Comput. Appl. Math., 2011

Loop-free Gray code algorithm for the e-restricted growth functions.

[BibT_eX]

[DOI]

,

Ghalib Nassar

,

Vincent Vajnovszki

Inf. Process. Lett., 2011

A Recurrence Related to the Bell Numbers.

[BibT_eX]

[DOI]

,

Integers, 2011

Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2011

On a New Family of Generalized Stirling and Bell Numbers.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2011

Pattern-Avoiding Set Partitions and Catalan Numbers.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2011

Protected points in k-ary trees.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Rational combinations for the sums involving inverse binomial coefficients.

[BibT_eX]

[DOI]

Gi-Sang Cheon

,

Appl. Math. Comput., 2011

A Carlitz identity for the wreath product Cr≀Sn.

[BibT_eX]

[DOI]

Chak-On Chow

,

Adv. Appl. Math., 2011

Loop-Free Gray Code Algorithms for the Set of Compositions.

[BibT_eX]

[DOI]

,

Ghalib Nassar

J. Math. Model. Algorithms, 2010

Minimal permutations with d descents.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2010

Block-connected set partitions.

[BibT_eX]

[DOI]

,

Augustine O. Munagi

Eur. J. Comb., 2010

Counting Subwords in a Partition of a Set.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2010

Records in Set Partitions.

[BibT_eX]

[DOI]

,

,

Stephan G. Wagner

Electron. J. Comb., 2010

Matchings and Partial Patterns.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2010

Modified approach to generalized Stirling numbers via differential operators.

[BibT_eX]

[DOI]

B. S. El-Desouky

,

Nenad Cakic

,

Appl. Math. Lett., 2010

Enumeration of Gap-Bounded Set Partitions.

[BibT_eX]

[DOI]

,

Augustine O. Munagi

J. Autom. Lang. Comb., 2009

A Comment on Ryser's Conjecture for Intersecting Hypergraphs.

[BibT_eX]

[DOI]

,

Chunwei Song

,

Raphael Yuster

Graphs Comb., 2009

Enumeration of words by the sum of differences between adjacent letters.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

Identities involving Narayana polynomials and Catalan numbers.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

Partitions of a set satisfying certain set of conditions.

[BibT_eX]

[DOI]

,

Nohad Mbarieky

Discret. Math., 2009

Symmetric Schröder paths and restricted involutions.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

New permutation statistics: Variation and a variant.

[BibT_eX]

[DOI]

,

Chunwei Song

Discret. Appl. Math., 2009

The vertex PI index and Szeged index of bridge graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Restricted k-ary words and functional equations.

[BibT_eX]

[DOI]

Ghassan Firro

,

Discret. Appl. Math., 2009

Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2009

Combinatorial Gray codes for classes of pattern avoiding permutations.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2008

Gray Codes, Loopless Algorithm and Partitions.

[BibT_eX]

[DOI]

,

Ghalib Nassar

J. Math. Model. Algorithms, 2008

On the number of combinations without certain separations.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2008

An identity involving Narayana numbers.

[BibT_eX]

[DOI]

Nelson Y. Li

,

Eur. J. Comb., 2008

Dyck paths with coloured ascents.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2008

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.

[BibT_eX]

[DOI]

,

,

Jeffrey B. Remmel

Discret. Math. Theor. Comput. Sci., 2008

Enumeration of (k, 2)-noncrossing partitions.

[BibT_eX]

[DOI]

,

Simone Severini

Discret. Math., 2008

Staircase tilings and k-Catalan structures.

[BibT_eX]

[DOI]

Silvia Heubach

,

Nelson Y. Li

,

Discret. Math., 2008

2-Binary trees: Bijections and related issues.

[BibT_eX]

[DOI]

Nancy S. S. Gu

,

Nelson Y. Li

,

Discret. Math., 2008

Wilf classification of three and four letter signed patterns.

[BibT_eX]

[DOI]

W. M. B. Dukes

,

,

Astrid Reifegerste

Discret. Math., 2008

Bell polynomials and k-generalized Dyck paths.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2008

Longest alternating subsequences of k-ary words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Three Hoppy path problems and ternary paths.

[BibT_eX]

[DOI]

Eva Yu-Ping Deng

,

Discret. Appl. Math., 2008

On Pattern-Avoiding Partitions.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2008

Dyck paths and partial Bell polynomials.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2008

Restricted 123-avoiding Baxter permutations and the Padovan numbers.

[BibT_eX]

[DOI]

,

Vincent Vajnovszki

Discret. Appl. Math., 2007

Longest Alternating Subsequences in Pattern-Restricted Permutations.

[BibT_eX]

[DOI]

Ghassan Firro

,

,

Mark C. Wilson

Electron. J. Comb., 2007

Norms of circulant and semicirculant matrices and Horadams sequence.

[BibT_eX]

E. Gokcen Alptekin

,

,

Naim Tuglu

Ars Comb., 2007

Counting l-letter subwords in compositions.

[BibT_eX]

[DOI]

,

Basel Sirhan

Discret. Math. Theor. Comput. Sci., 2006

Counting occurrences of 231 in an involution.

[BibT_eX]

[DOI]

,

,

Laura L. M. Yang

Discret. Math., 2006

Restricted even permutations and Chebyshev polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2006

Restricted Dumont permutations, Dyck paths, and noncrossing partitions.

[BibT_eX]

[DOI]

,

Sergi Elizalde

,

Discret. Math., 2006

Dyck paths and restricted permutations.

[BibT_eX]

[DOI]

,

Eva Yu-Ping Deng

,

Rosena R. X. Du

Discret. Appl. Math., 2006

Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials.

[BibT_eX]

[DOI]

Qing-Hu Hou

,

Discret. Appl. Math., 2006

Matchings Avoiding Partial Patterns and Lattice Paths.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2006

Three-Letter-Pattern-Avoiding Permutations and Functional Equations.

[BibT_eX]

[DOI]

Ghassan Firro

,

Electron. J. Comb., 2006

Matchings Avoiding Partial Patterns.

[BibT_eX]

[DOI]

William Y. C. Chen

,

,

Electron. J. Comb., 2006

The enumeration of permutations whose posets have a maximum element.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2006

Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2006

Avoiding patterns of length three in compositions and multiset permutations.

[BibT_eX]

[DOI]

Silvia Heubach

,

Adv. Appl. Math., 2006

Bivariate generating functions for involutions restricted by 3412.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2006

Finite automata and pattern avoidance in words.

[BibT_eX]

[DOI]

Petter Brändén

,

J. Comb. Theory A, 2005

On the X-rays of permutations.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2005

Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials.

[BibT_eX]

[DOI]

Sergi Elizalde

,

Discret. Math., 2005

On multi-avoidance of generalized patterns.

[BibT_eX]

,

Ars Comb., 2005

Simultaneous Avoidance Of Generalized Patterns.

[BibT_eX]

,

Ars Comb., 2005

Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns.

[BibT_eX]

Anders Claesson

,

Ars Comb., 2005

Squaring the terms of an ℓth order linear recurrence.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

Generating the Peano Curve and Counting Occurrences of some Patterns.

[BibT_eX]

[DOI]

,

,

Patrice Séébold

J. Autom. Lang. Comb., 2004

Counting occurrences of 132 in an even permutation.

[BibT_eX]

[DOI]

Int. J. Math. Math. Sci., 2004

On an open problem of Green and Losonczy: exact enumeration of freely braided permutations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2004

Permutations Containing A Pattern Exactly Once And Avoiding At Least Two Patterns Of Three Letters.

[BibT_eX]

Ars Comb., 2004

Permutations Restricted By Patterns Of Type (2, 1).

[BibT_eX]

Ars Comb., 2004

Continued Fractions, Statistics, And Generalized Patterns.

[BibT_eX]

Ars Comb., 2004

A formula for the generating functions of powers of Horadam's sequence.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

Restricted 132-Dumont permutations.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

231-Avoiding involutions and Fibonacci numbers.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2004

Average norms of polynomials.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

Counting occurrences of some subword patterns.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2003

Continued Fractions and Generalized Patterns.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

321-Polygon-Avoiding Permutations and Chebyshev Polynomials.

[BibT_eX]

[DOI]

,

Zvezdelina Stankova

Electron. J. Comb., 2002

Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2002

Words Restricted by Patterns with at Most 2 Distinct Letters.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2002

Packing Patterns into Words.

[BibT_eX]

[DOI]

,

Peter A. Hästö

,

Electron. J. Comb., 2002

Permutations avoiding a pattern from Sk and at least two patterns from S3.

[BibT_eX]

Ars Comb., 2002

Counting Occurrences of 132 in a Permutation.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2002

Combinatorial Identities and Inverse Binomial Coefficients.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations.

[BibT_eX]

[DOI]

Anders Claesson

,

Adv. Appl. Math., 2002

Restricted 132-Avoiding Permutations.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2001

Avoiding maximal parabolic subgroups of Sk.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2000

Restricted Permutations, Continued Fractions, and Chebyshev Polynomials.

[BibT_eX]

[DOI]

,