Volgen
Anders Claesson
Anders Claesson
Professor, University of Iceland
Geverifieerd e-mailadres voor hi.is - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Generalized pattern avoidance
A Claesson
European Journal of Combinatorics 22 (7), 961-971, 2001
2162001
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
P Brändén, A Claesson
arXiv preprint arXiv:1102.4226, 2011
1362011
Classification of bijections between 321-and 132-avoiding permutations
A Claesson, S Kitaev
Discrete Mathematics & Theoretical Computer Science, 2008
982008
Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns
A Claesson, T Mansour
Arxiv preprint math/0107044, 2001
69*2001
Upper bounds for the Stanley–Wilf limit of 1324 and other layered patterns
A Claesson, V Jelínek, E Steingrímsson
Journal of Combinatorial Theory, Series A 119 (8), 1680-1691, 2012
642012
(2+2)-free posets, ascent sequences and pattern avoiding permutations
M Bousquet-Mélou, A Claesson, M Dukes, S Kitaev
Journal of Combinatorial Theory, Series A 117 (7), 884-909, 2010
642010
Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
A Claesson, T Mansour
Advances in Applied Mathematics 29 (2), 293-310, 2002
562002
Catalan continued fractions and increasing subsequences in permutations
P Branden, A Claesson, E Steingrimsson
Discrete Mathematics 258 (1-3), 275-288, 2003
39*2003
Descent polynomials for permutations with bounded drop size
F Chung, A Claesson, M Dukes, R Graham
European Journal of Combinatorics 31 (7), 1853-1867, 2010
262010
Decompositions and statistics for [beta](1, 0)-trees and nonseparable permutations
A Claesson, S Kitaev, E Steingrímsson
Advances in Applied Mathematics 42 (3), 313-328, 2009
26*2009
Enumerating permutations sortable by k passes through a pop-stack
A Claesson, BÁ Guðmundsson
Advances in Applied Mathematics 108, 79-96, 2019
252019
Boolean complexes for Ferrers graphs
A Claesson, S Kitaev, K Ragnarsson, BE Tenner
arXiv preprint arXiv:0808.2307, 2008
242008
Stack sorting with restricted stacks
G Cerbai, A Claesson, L Ferrari
Journal of Combinatorial Theory, Series A 173, 105230, 2020
222020
A direct encoding of Stoimenow's matchings as ascent sequences
A Claesson, M Dukes, S Kitaev
arXiv preprint arXiv:0910.1619, 2009
192009
Sorting and preimages of pattern classes
A Claesson, H Ulfarsson
Discrete Mathematics & Theoretical Computer Science, 2012
182012
On the inverse image of pattern classes under bubble sort
MH Albert, MD Atkinson, M Bouvel, A Claesson, M Dukes
Journal of Combinatorics 2 (2), 231-243, 2011
182011
Permutations sortable by n–4 passes through a stack
A Claesson, M Dukes, E Steingrímsson
Annals of Combinatorics 14 (1), 45-51, 2010
142010
Partition and composition matrices
A Claesson, M Dukes, M Kubitzke
Journal of Combinatorial Theory, Series A 118 (5), 1624-1637, 2011
132011
Counting pop-stacked permutations in polynomial time
A Claesson, BÁ Guðmundsson, J Pantone
Experimental Mathematics 32 (1), 97-104, 2023
122023
Sorting with pattern-avoiding stacks: the -machine
G Cerbai, A Claesson, L Ferrari, E Steingrímsson
arXiv preprint arXiv:2006.05692, 2020
112020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20