Anders Claesson, Mark Dukes, Einar Steingrímsson

Permutations sortable by n-4 passes through a stack

Annals of Combinatorics 14 (2010) 45–51

Fan Chung, Anders Claesson, Mark Dukes, Ronald Graham

Descent polynomials for permutations with bounded drop size

European Journal of Combinatorics, to appear (2010)

Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev

(2+2)-free posets, ascent sequences and pattern avoiding permutations

Journal of Combinatorial Theory Series A, to appear (2010)

Also appeared at FPSAC 2009

Anders Claesson, Sergey Kitaev, Einar Steingrímsson

Decompositions and statistics for β(1,0)-trees and nonseparable permutations

Advances in Applied Mathematics 42 (2009) 313–328

doi:10.1016/j.aam.2008.09.001

Anders Claesson, Mark Dukes, Sergey Kitaev

A direct encoding of Stoimenow's matchings as ascent sequences

Preprint (2009)

Anders Claesson, Sergey Kitaev

Classification of bijections between 321- and 132-avoiding permutations

Séminaire Lotharingien de Combinatoire B60d (2008) 30pp

Also appeared at FPSAC 2008

Anders Claesson, Sergey Kitaev, Kari Ragnarsson, Bridget Eileen Tenner

Boolean complexes for Ferrers graphs

Preprint (2008)

Anders Claesson, T. Kyle Petersen

Conway's napkin problem

American Mathematical Monthly 114 (2007) 217–231

Anders Claesson

Counting segmented permutations using bicoloured Dyck paths

The Electronic Journal of Combinatorics 12 (2005)

Anders Claesson, Toufik Mansour

Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns

Ars Combinatoria 77 (2005) 17–31

Anders Claesson, Chris D. Godsil, David G. Wagner

A Permutation Group Determined by an Ordered Set

Discrete Mathematics 269 (2003) 273–279

Anders Claesson, Toufik Mansour

Counting Occurrences of a Pattern of Type (1,2) or (2,1) in Permutations

Advances in Applied Mathematics 29 (2002) 293–310

Petter Brändén, Anders Claesson, Einar Steingrímsson

Catalan Continued Fractions and Increasing Subsequences in Permutations

Discrete Mathematics 258 (2002) 275–287

Anders Claesson

Generalized Pattern Avoidance

European Journal of Combinatorics 22 (2001) 961–971