Anders Claesson

According to our database, Anders Claesson authored at least 32 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Turning cycle restrictions into mesh patterns via Foata's fundamental transformation.

Anders Claesson, Henning Úlfarsson

Discret. Math., March, 2024

2023

Fishburn trees.

Giulio Cerbai, Anders Claesson

Adv. Appl. Math., October, 2023

Counting Pop-Stacked Permutations in Polynomial Time.

Anders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone

Exp. Math., January, 2023

Transport of patterns by Burge transpose.

Giulio Cerbai, Anders Claesson

Eur. J. Comb., 2023

Weak ascent sequences and related combinatorial structures.

Beáta Bényi, Anders Claesson, Mark Dukes

Eur. J. Comb., 2023

Permutations with Few Inversions.

Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson

Electron. J. Comb., 2023

2020

Stack sorting with restricted stacks.

Giulio Cerbai, Anders Claesson, Luca Ferrari

J. Comb. Theory, Ser. A, 2020

Sorting with Pattern-Avoiding Stacks: The 132-Machine.

Giulio Cerbai, Anders Claesson, Luca S. Ferrari, Einar Steingrímsson

Electron. J. Comb., 2020

2019

Enumerating permutations sortable by <i>k</i> passes through a pop-stack.

Anders Claesson, Bjarki Ágúst Guðmundsson

Adv. Appl. Math., 2019

2017

Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3.

Christian Bean, Henning Úlfarsson, Anders Claesson

J. Integer Seq., 2017

Preface.

Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks

Proceedings of the Surveys in Combinatorics, 2017

2015

Coincidence among families of mesh patterns.

Anders Claesson, Bridget Eileen Tenner, Henning Úlfarsson

Australas. J Comb., 2015

An involution on bicubic maps and β(0, 1)-trees.

Anders Claesson, Sergey Kitaev, Anna de Mier

Australas. J Comb., 2015

2014

Decomposing Labeled Interval Orders as Pairs of Permutations.

Anders Claesson, Stuart A. Hannah

Electron. J. Comb., 2014

2013

An involution on β(1, 0)-trees.

Anders Claesson, Sergey Kitaev, Einar Steingrímsson

Adv. Appl. Math., 2013

2012

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns.

Anders Claesson, Vít Jelínek, Einar Steingrímsson

J. Comb. Theory, Ser. A, 2012

Sorting and preimages of pattern classes

Anders Claesson, Henning Úlfarsson

CoRR, 2012

2011

Partition and composition matrices.

Anders Claesson, Mark Dukes, Martina Kubitzke

J. Comb. Theory, Ser. A, 2011

Pattern Avoidance in Partial Permutations.

Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev

Electron. J. Comb., 2011

Mesh Patterns and the Expansion of Permutation Statistics as Sums of Permutation Patterns.

Petter Brändén, Anders Claesson

Electron. J. Comb., 2011

A direct encoding of Stoimenows matchings as ascent sequences.

Anders Claesson, Mark Dukes, Sergey Kitaev

Australas. J Comb., 2011

2010

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

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

J. Comb. Theory, Ser. A, 2010

Descent polynomials for permutations with bounded drop size.

Fan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham

Eur. J. Comb., 2010

Boolean complexes for Ferrers graphs.

Anders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner

Australas. J Comb., 2010

2009

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

Anders Claesson, Sergey Kitaev, Einar Steingrímsson

Adv. Appl. Math., 2009

2007

Conway's Napkin Problem.

Anders Claesson, T. Kyle Petersen

Am. Math. Mon., 2007

2005

Counting Segmented Permutations Using Bicoloured Dyck Paths.

Anders Claesson

Electron. J. Comb., 2005

Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns.

Anders Claesson, Toufik Mansour

Ars Comb., 2005

2003

A permutation group determined by an ordered set.

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

Discret. Math., 2003

2002

Catalan continued fractions and increasing subsequences in permutations.

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

Discret. Math., 2002

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

Anders Claesson, Toufik Mansour

Adv. Appl. Math., 2002

2001

Generalized Pattern Avoidance.

Anders Claesson

Eur. J. Comb., 2001