The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Toufik Mansour: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anders Claesson, Toufik Mansour
    Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  2. Sergey Kitaev, Toufik Mansour
    Simultaneous Avoidance Of Generalized Patterns. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  3. Sergey Kitaev, Toufik Mansour
    On multi-avoidance of generalized patterns. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  4. Toufik Mansour
    Permutations avoiding a pattern from Sk and at least two patterns from S3. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:62, n:, pp:- [Journal]
  5. Toufik Mansour
    Continued Fractions, Statistics, And Generalized Patterns. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  6. Toufik Mansour
    Permutations Restricted By Patterns Of Type (2, 1). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  7. Toufik Mansour
    Permutations Containing A Pattern Exactly Once And Avoiding At Least Two Patterns Of Three Letters. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  8. Alexander Burstein, Peter Hästö, Toufik Mansour
    Packing Patterns into Words. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  9. Alexander Burstein, Toufik Mansour
    Words Restricted by Patterns with at Most 2 Distinct Letters. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  10. Eric S. Egge, Toufik Mansour
    Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  11. Toufik Mansour, Zvezdelina Stankova
    321-Polygon-Avoiding Permutations and Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  12. Toufik Mansour, Alek Vainshtein
    Restricted Permutations, Continued Fractions, and Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  13. Eric S. Egge, Toufik Mansour
    132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:72-83 [Journal]
  14. Qing-Hu Hou, Toufik Mansour
    Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1183-1197 [Journal]
  15. Toufik Mansour, Eva Yu-Ping Deng, Rosena R. X. Du
    Dyck paths and restricted permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:11, pp:1593-1605 [Journal]
  16. Sergi Elizalde, Toufik Mansour
    Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:170-189 [Journal]
  17. Toufik Mansour
    Restricted even permutations and Chebyshev polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1161-1176 [Journal]
  18. Toufik Mansour, Sherry H. F. Yan, Laura L. M. Yang
    Counting occurrences of 231 in an involution. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:564-572 [Journal]
  19. Alexander Burstein, Sergi Elizalde, Toufik Mansour
    Restricted Dumont permutations, Dyck paths, and noncrossing partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2851-2869 [Journal]
  20. Toufik Mansour, Alek Vainshtein
    Avoiding maximal parabolic subgroups of Sk. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2000, v:4, n:1, pp:81-90 [Journal]
  21. Alexander Burstein, Toufik Mansour
    Counting occurrences of some subword patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:1-12 [Journal]
  22. Toufik Mansour
    Continued Fractions and Generalized Patterns. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:3, pp:329-344 [Journal]
  23. Petter Brändén, Toufik Mansour
    Finite automata and pattern avoidance in words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:110, n:1, pp:127-145 [Journal]
  24. Toufik Mansour, Vincent Vajnovszki
    Restricted 123-avoiding Baxter permutations and the Padovan numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1430-1440 [Journal]
  25. Toufik Mansour
    On an open problem of Green and Losonczy: exact enumeration of freely braided permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:461-470 [Journal]
  26. Toufik Mansour, Basel Sirhan
    Counting l-letter subwords in compositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:285-298 [Journal]

  27. Counting Ordered Patterns in Words Generated by Morphisms. [Citation Graph (, )][DBLP]


  28. Modified approach to generalized Stirling numbers via differential operators. [Citation Graph (, )][DBLP]


  29. Norms of circulant and semicirculant matrices and Horadams sequence. [Citation Graph (, )][DBLP]


  30. Matchings Avoiding Partial Patterns and Lattice Paths. [Citation Graph (, )][DBLP]


  31. Matchings Avoiding Partial Patterns. [Citation Graph (, )][DBLP]


  32. Three-Letter-Pattern-Avoiding Permutations and Functional Equations. [Citation Graph (, )][DBLP]


  33. Longest Alternating Subsequences in Pattern-Restricted Permutations. [Citation Graph (, )][DBLP]


  34. Longest alternating subsequences of k-ary words. [Citation Graph (, )][DBLP]


  35. Three Hoppy path problems and ternary paths. [Citation Graph (, )][DBLP]


  36. Bell polynomials and k-generalized Dyck paths. [Citation Graph (, )][DBLP]


  37. New permutation statistics: Variation and a variant. [Citation Graph (, )][DBLP]


  38. Restricted k-ary words and functional equations. [Citation Graph (, )][DBLP]


  39. The vertex PI index and Szeged index of bridge graphs. [Citation Graph (, )][DBLP]


  40. 2-Binary trees: Bijections and related issues. [Citation Graph (, )][DBLP]


  41. Staircase tilings and k-Catalan structures. [Citation Graph (, )][DBLP]


  42. Enumeration of (k, 2)-noncrossing partitions. [Citation Graph (, )][DBLP]


  43. Wilf classification of three and four letter signed patterns. [Citation Graph (, )][DBLP]


  44. Symmetric Schröder paths and restricted involutions. [Citation Graph (, )][DBLP]


  45. Identities involving Narayana polynomials and Catalan numbers. [Citation Graph (, )][DBLP]


  46. Partitions of a set satisfying certain set of conditions. [Citation Graph (, )][DBLP]


  47. Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. [Citation Graph (, )][DBLP]


  48. Dyck paths with coloured ascents. [Citation Graph (, )][DBLP]


  49. On the number of combinations without certain separations. [Citation Graph (, )][DBLP]


  50. An identity involving Narayana numbers. [Citation Graph (, )][DBLP]


  51. Minimal permutations with d descents. [Citation Graph (, )][DBLP]


  52. Block-connected set partitions. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002