Toufik Mansour

According to our database1, Toufik Mansour authored at least 161 papers between 2000 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations.
SIAM J. Discret. Math., 2020

The Depth of Compositions.
Math. Comput. Sci., 2020

Restricted Lego Towers.
J. Autom. Lang. Comb., 2020

Staircase patterns in words: Subsequences, subwords, and separation number.
Eur. J. Comb., 2020

Partial duality for ribbon graphs, I: Distributions.
Eur. J. Comb., 2020

Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences.
Adv. Appl. Math., 2020

Permutation Patterns and Cell Decompositions.
Math. Comput. Sci., 2019

Cell Patterns in Integer Partitions.
J. Autom. Lang. Comb., 2019

Harary index of bipartite graphs.
Electron. J. Graph Theory Appl., 2019

Passing through a stack k times with reversals.
Eur. J. Comb., 2019

Passing through a stack k times.
Discret. Math. Algorithms Appl., 2019

The Perimeter and Site-Perimeter of Set Partitions.
Electron. J. Comb., 2019

Circular bargraphs.
Appl. Math. Comput., 2019

New bounds on the hyper-Zagreb index for the simple connected graphs.
Electron. J. Graph Theory Appl., 2018

Impulse parameter and a new equivalence between 123- and 132-avoiding permutations.
Discret. Math. Algorithms Appl., 2018

On the genus distributions of wheels and of related graphs.
Discret. Math., 2018

Calculating genus polynomials via string operations and matrices.
Ars Math. Contemp., 2018

Interior vertices in set partitions.
Adv. Appl. Math., 2018

A polynomial generalization of some associated sequences related to set partitions.
Period. Math. Hung., 2017

The Descent Statistic on Signed Simsun Permutations.
J. Autom. Lang. Comb., 2017

Counting triangulations of some classes of subdivided convex polygons.
Eur. J. Comb., 2017

Wilf classification of triples of 4-letter patterns II.
Discret. Math. Theor. Comput. Sci., 2017

Wilf classification of triples of 4-letter patterns I.
Discret. Math. Theor. Comput. Sci., 2017

The perimeter of words.
Discret. Math., 2017

Nine classes of permutations enumerated by binomial transform of Fine's sequence.
Discret. Appl. Math., 2017

Valence-partitioned genus polynomials and their application to generalized dipoles.
Australas. J Comb., 2017

Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word.
J. Autom. Lang. Comb., 2016

Counting triangulations of balanced subdivisions of convex polygons.
Electron. Notes Discret. Math., 2016

Combinatorial conjectures that imply local log-concavity of graph genus polynomials.
Eur. J. Comb., 2016

A statistic related to trees and words on a finite alphabet.
Discret. Math. Algorithms Appl., 2016

Counting permutations by the number of successions within cycles.
Discret. Math., 2016

On a combinatorial problem in botanical epidemiology.
Discret. Appl. Math., 2016

Pattern restricted Stirling k-ary words, the plateau statistic and the kernel method.
Discret. Appl. Math., 2016

Iterated claws have real-rooted genus polynomials.
Ars Math. Contemp., 2016

Degenerate Mittag-Leffler polynomials.
Appl. Math. Comput., 2016

Partitions according to multiplicities and part sizes.
Australas. J Comb., 2016

Log-Concavity of Combinations of Sequences and Applications to Genus Distributions.
SIAM J. Discret. Math., 2015

Log-concavity of the genus polynomials of Ringel Ladders.
Electron. J. Graph Theory Appl., 2015

On avoidance of patterns of the form σ-τ by words over a finite alphabet.
Discret. Math. Theor. Comput. Sci., 2015

Counting subwords in flattened partitions of sets.
Discret. Math., 2015

The 1/k-Eulerian polynomials and k-Stirling permutations.
Discret. Math., 2015

Some results on the avoidance of vincular patterns by multisets.
Discret. Appl. Math., 2015

Some Combinatorial Arrays Related to the Lotka-Volterra System.
Electron. J. Comb., 2015

Degenerate poly-Cauchy polynomials.
Appl. Math. Comput., 2015

Barnes-type degenerate Euler polynomials.
Appl. Math. Comput., 2015

On the real-rootedness of generalized Touchard polynomials.
Appl. Math. Comput., 2015

Set partitions with circular successions.
Eur. J. Comb., 2014

Log-concavity of genus distributions of ring-like families of graphs.
Eur. J. Comb., 2014

Congruence successions in compositions.
Discret. Math. Theor. Comput. Sci., 2014

Some enumerative results related to ascent sequences.
Discret. Math., 2014

Cut equivalence of d-dimensional guillotine partitions.
Discret. Math., 2014

On the Group of Alternating Colored Permutations.
Electron. J. Comb., 2014

Total Embedding Distributions of Circular Ladders.
J. Graph Theory, 2013

Efficient generation of restricted growth words.
Inf. Process. Lett., 2013

Counting humps and peaks in generalized Motzkin paths.
Discret. Appl. Math., 2013

A combinatorial approach to a general two-term recurrence.
Discret. Appl. Math., 2013

A notion of graph likelihood and an infinite monkey theorem
CoRR, 2013

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

The generalized Touchard polynomials revisited.
Appl. Math. Comput., 2013

Polynomials whose coefficients are generalized Tribonacci numbers.
Appl. Math. Comput., 2013

On multiple pattern avoiding set partitions.
Adv. Appl. Math., 2013

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

Embedding Distributions and Chebyshev Polynomials.
Graphs Comb., 2012

Variation Statistics on Compositions.
Fundam. Informaticae, 2012

A general two-term recurrence and its solution.
Eur. J. Comb., 2012

Catalan numbers and pattern restricted set partitions.
Discret. Math., 2012

Genus distributions of star-ladders.
Discret. Math., 2012

Record statistics in a random composition.
Discret. Appl. Math., 2012

On the Stirling numbers associated with the meromorphic Weyl algebra.
Appl. Math. Lett., 2012

Set partitions as geometric words.
Australas. J Comb., 2012

Maximizing a Sum Related to Image Segmentation Evaluation.
J. Math. Model. Algorithms, 2011

The q-Calkin-Wilf tree.
J. Comb. Theory, Ser. A, 2011

The kernel method and systems of functional equations with several conditions.
J. Comput. Appl. Math., 2011

Loop-free Gray code algorithm for the e-restricted growth functions.
Inf. Process. Lett., 2011

A Recurrence Related to the Bell Numbers.
Integers, 2011

Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials.
Discret. Math., 2011

On a New Family of Generalized Stirling and Bell Numbers.
Electron. J. Comb., 2011

Pattern-Avoiding Set Partitions and Catalan Numbers.
Electron. J. Comb., 2011

Protected points in k-ary trees.
Appl. Math. Lett., 2011

Rational combinations for the sums involving inverse binomial coefficients.
Appl. Math. Comput., 2011

A Carlitz identity for the wreath product Cr≀Sn.
Adv. Appl. Math., 2011

Loop-Free Gray Code Algorithms for the Set of Compositions.
J. Math. Model. Algorithms, 2010

Minimal permutations with d descents.
Eur. J. Comb., 2010

Block-connected set partitions.
Eur. J. Comb., 2010

Counting Subwords in a Partition of a Set.
Electron. J. Comb., 2010

Records in Set Partitions.
Electron. J. Comb., 2010

Matchings and Partial Patterns.
Electron. J. Comb., 2010

Modified approach to generalized Stirling numbers via differential operators.
Appl. Math. Lett., 2010

Enumeration of Gap-Bounded Set Partitions.
J. Autom. Lang. Comb., 2009

A Comment on Ryser's Conjecture for Intersecting Hypergraphs.
Graphs Comb., 2009

Enumeration of words by the sum of differences between adjacent letters.
Discret. Math. Theor. Comput. Sci., 2009

Identities involving Narayana polynomials and Catalan numbers.
Discret. Math., 2009

Partitions of a set satisfying certain set of conditions.
Discret. Math., 2009

Symmetric Schröder paths and restricted involutions.
Discret. Math., 2009

New permutation statistics: Variation and a variant.
Discret. Appl. Math., 2009

The vertex PI index and Szeged index of bridge graphs.
Discret. Appl. Math., 2009

Restricted k-ary words and functional equations.
Discret. Appl. Math., 2009

Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions.
Electron. J. Comb., 2009

Combinatorial Gray codes for classes of pattern avoiding permutations.
Theor. Comput. Sci., 2008

Gray Codes, Loopless Algorithm and Partitions.
J. Math. Model. Algorithms, 2008

On the number of combinations without certain separations.
Eur. J. Comb., 2008

An identity involving Narayana numbers.
Eur. J. Comb., 2008

Dyck paths with coloured ascents.
Eur. J. Comb., 2008

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.
Discret. Math. Theor. Comput. Sci., 2008

Enumeration of (k, 2)-noncrossing partitions.
Discret. Math., 2008

Staircase tilings and k-Catalan structures.
Discret. Math., 2008

2-Binary trees: Bijections and related issues.
Discret. Math., 2008

Wilf classification of three and four letter signed patterns.
Discret. Math., 2008

Bell polynomials and k-generalized Dyck paths.
Discret. Appl. Math., 2008

Longest alternating subsequences of k-ary words.
Discret. Appl. Math., 2008

Three Hoppy path problems and ternary paths.
Discret. Appl. Math., 2008

On Pattern-Avoiding Partitions.
Electron. J. Comb., 2008

Dyck paths and partial Bell polynomials.
Australas. J Comb., 2008

Counting Ordered Patterns in Words Generated by Morphisms.
Proceedings of the Language and Automata Theory and Applications, 2008

Restricted 123-avoiding Baxter permutations and the Padovan numbers.
Discret. Appl. Math., 2007

Longest Alternating Subsequences in Pattern-Restricted Permutations.
Electron. J. Comb., 2007

Norms of circulant and semicirculant matrices and Horadams sequence.
Ars Comb., 2007

Counting l-letter subwords in compositions.
Discret. Math. Theor. Comput. Sci., 2006

Counting occurrences of 231 in an involution.
Discret. Math., 2006

Restricted even permutations and Chebyshev polynomials.
Discret. Math., 2006

Restricted Dumont permutations, Dyck paths, and noncrossing partitions.
Discret. Math., 2006

Dyck paths and restricted permutations.
Discret. Appl. Math., 2006

Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials.
Discret. Appl. Math., 2006

Matchings Avoiding Partial Patterns and Lattice Paths.
Electron. J. Comb., 2006

Three-Letter-Pattern-Avoiding Permutations and Functional Equations.
Electron. J. Comb., 2006

Matchings Avoiding Partial Patterns.
Electron. J. Comb., 2006

The enumeration of permutations whose posets have a maximum element.
Adv. Appl. Math., 2006

Restricted 132-avoiding <i>k</i>-ary words, Chebyshev polynomials, and continued fractions.
Adv. Appl. Math., 2006

Avoiding patterns of length three in compositions and multiset permutations.
Adv. Appl. Math., 2006

Bivariate generating functions for involutions restricted by 3412.
Adv. Appl. Math., 2006

Finite automata and pattern avoidance in words.
J. Comb. Theory, Ser. A, 2005

On the X-rays of permutations.
Electron. Notes Discret. Math., 2005

Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials.
Discret. Math., 2005

On multi-avoidance of generalized patterns.
Ars Comb., 2005

Simultaneous Avoidance Of Generalized Patterns.
Ars Comb., 2005

Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns.
Ars Comb., 2005

Squaring the terms of an ℓ<sup>th</sup> order linear recurrence.
Australas. J Comb., 2005

Generating the Peano Curve and Counting Occurrences of some Patterns.
J. Autom. Lang. Comb., 2004

Counting occurrences of 132 in an even permutation.
Int. J. Math. Math. Sci., 2004

On an open problem of Green and Losonczy: exact enumeration of freely braided permutations.
Discret. Math. Theor. Comput. Sci., 2004

132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers.
Discret. Appl. Math., 2004

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

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

Continued Fractions, Statistics, And Generalized Patterns.
Ars Comb., 2004

A formula for the generating functions of powers of Horadam's sequence.
Australas. J Comb., 2004

Restricted 132-Dumont permutations.
Australas. J Comb., 2004

231-Avoiding involutions and Fibonacci numbers.
Australas. J Comb., 2004

Average norms of polynomials.
Adv. Appl. Math., 2004

Counting occurrences of some subword patterns.
Discret. Math. Theor. Comput. Sci., 2003

Continued Fractions and Generalized Patterns.
Eur. J. Comb., 2002

321-Polygon-Avoiding Permutations and Chebyshev Polynomials.
Electron. J. Comb., 2002

Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials.
Electron. J. Comb., 2002

Words Restricted by Patterns with at Most 2 Distinct Letters.
Electron. J. Comb., 2002

Packing Patterns into Words.
Electron. J. Comb., 2002

Permutations avoiding a pattern from Sk and at least two patterns from S3.
Ars Comb., 2002

Counting Occurrences of 132 in a Permutation.
Adv. Appl. Math., 2002

Combinatorial Identities and Inverse Binomial Coefficients.
Adv. Appl. Math., 2002

Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations.
Adv. Appl. Math., 2002

Restricted 132-Avoiding Permutations.
Adv. Appl. Math., 2001

Avoiding maximal parabolic subgroups of S<sub>k</sub>.
Discret. Math. Theor. Comput. Sci., 2000

Restricted Permutations, Continued Fractions, and Chebyshev Polynomials.
Electron. J. Comb., 2000