Anders Claesson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2024

Caylerian polynomialsGiulio Cerbai, Anders Claesson. DM, 347(12):114177, 2024. [doi]

Turning cycle restrictions into mesh patterns via Foata's fundamental transformationAnders Claesson, Henning Úlfarsson. DM, 347(3):113826, March 2024. [doi]

2023

Weak ascent sequences and related combinatorial structuresBeáta Bényi, Anders Claesson, Mark Dukes. ejc, 108:103633, 2023. [doi]

Fishburn treesGiulio Cerbai, Anders Claesson. aam, 151:102592, October 2023. [doi]

Transport of patterns by Burge transposeGiulio Cerbai, Anders Claesson. ejc, 108:103630, 2023. [doi]

Permutations with Few InversionsAnders Claesson, Atli Fannar Franklín, Einar Steingrímsson. combinatorics, 30(4), 2023. [doi]

Counting Pop-Stacked Permutations in Polynomial TimeAnders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone. em, 32(1):97-104, January 2023. [doi]

2020

Stack sorting with restricted stacksGiulio Cerbai, Anders Claesson, Luca Ferrari 0001. jcta, 173:105230, 2020. [doi]

Sorting with Pattern-Avoiding Stacks: The 132-MachineGiulio Cerbai, Anders Claesson, Luca S. Ferrari, Einar Steingrímsson. combinatorics, 27(3):3, 2020. [doi]

2019

k passes through a pop-stackAnders Claesson, Bjarki Ágúst Guðmundsson. aam, 108:79-96, 2019. [doi]

2017

Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3Christian Bean, Henning Úlfarsson, Anders Claesson. jintseq, 20(7), 2017. [doi]

PrefaceAnders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks. bcc 2017: [doi]

2015

Coincidence among families of mesh patternsAnders Claesson, Bridget Eileen Tenner, Henning Úlfarsson. ajc, 63:88-106, 2015. [doi]

An involution on bicubic maps and β(0, 1)-treesAnders Claesson, Sergey Kitaev, Anna de Mier. ajc, 61:1-18, 2015. [doi]

2014

Decomposing Labeled Interval Orders as Pairs of PermutationsAnders Claesson, Stuart A. Hannah. combinatorics, 21(4):4, 2014. [doi]

2013

An involution on β(1, 0)-treesAnders Claesson, Sergey Kitaev, Einar Steingrímsson. aam, 51(2):276-284, 2013. [doi]

2012

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patternsAnders Claesson, Vít Jelínek, Einar Steingrímsson. JCT, 119(8):1680-1691, 2012. [doi]

2011

2010

(2+2)-free posets, ascent sequences and pattern avoiding permutationsMireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev. JCT, 117(7):884-909, 2010. [doi]

Descent polynomials for permutations with bounded drop sizeFan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham. ejc, 31(7):1853-1867, 2010. [doi]

Boolean complexes for Ferrers graphsAnders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner. ajc, 48:159-174, 2010. [doi]

2009

Decompositions and statistics for β(1, 0)-trees and nonseparable permutationsAnders Claesson, Sergey Kitaev, Einar Steingrímsson. aam, 42(3):313-328, 2009. [doi]

2007

Conway's Napkin ProblemAnders Claesson, T. Kyle Petersen. tamm, 114(3):217-231, 2007. [doi]

2005

Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson PatternsAnders Claesson, Toufik Mansour. arscom, 77, 2005.

Counting Segmented Permutations Using Bicoloured Dyck PathsAnders Claesson. combinatorics, 12, 2005. [doi]

2003

A permutation group determined by an ordered setAnders Claesson, Chris D. Godsil, David G. Wagner. DM, 269(1-3):273-279, 2003. [doi]

2002

Catalan continued fractions and increasing subsequences in permutationsPetter Brändén, Anders Claesson, Einar Steingrímsson. DM, 258(1-3):275-287, 2002. [doi]

Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutationsAnders Claesson, Toufik Mansour. aam, 29(2):293-310, 2002. [doi]

2001

Generalized Pattern AvoidanceAnders Claesson. ejc, 22(7):961-971, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL