default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Claesson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Anders Claesson
, Henning Úlfarsson:
Turning cycle restrictions into mesh patterns via Foata's fundamental transformation. Discret. Math. 347(3): 113826 (2024)- [j30]Giulio Cerbai, Anders Claesson:
Caylerian polynomials. Discret. Math. 347(12): 114177 (2024) - [c2]Atli Fannar Franklín, Anders Claesson, Christian Bean, Henning Úlfarsson, Jay Pantone:
Restricted Permutations Enumerated by Inversions. GASCom 2024: 96-100 - 2023
- [j29]Giulio Cerbai, Anders Claesson:
Fishburn trees. Adv. Appl. Math. 151: 102592 (2023) - [j28]Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson:
Permutations with Few Inversions. Electron. J. Comb. 30(4) (2023) - [j27]Giulio Cerbai, Anders Claesson:
Transport of patterns by Burge transpose. Eur. J. Comb. 108: 103630 (2023) - [j26]Beáta Bényi, Anders Claesson, Mark Dukes:
Weak ascent sequences and related combinatorial structures. Eur. J. Comb. 108: 103633 (2023) - [j25]Anders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone:
Counting Pop-Stacked Permutations in Polynomial Time. Exp. Math. 32(1): 97-104 (2023) - 2020
- [j24]Giulio Cerbai, Anders Claesson, Luca S. Ferrari, Einar Steingrímsson:
Sorting with Pattern-Avoiding Stacks: The 132-Machine. Electron. J. Comb. 27(3): 3 (2020) - [j23]Giulio Cerbai, Anders Claesson, Luca Ferrari:
Stack sorting with restricted stacks. J. Comb. Theory A 173: 105230 (2020)
2010 – 2019
- 2019
- [j22]Anders Claesson, Bjarki Ágúst Guðmundsson:
Enumerating permutations sortable by k passes through a pop-stack. Adv. Appl. Math. 108: 79-96 (2019) - [i3]Giulio Cerbai, Anders Claesson, Luca Ferrari:
Stack sorting with restricted stacks. CoRR abs/1907.08142 (2019) - 2017
- [j21]Christian Bean, Henning Úlfarsson, Anders Claesson:
Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3. J. Integer Seq. 20(7): 17.7.6 (2017) - [c1]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Preface. BCC 2017: vii-viii - [e1]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Surveys in Combinatorics, 2017: Invited lectures from the 26th British Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017. Cambridge University Press 2017, ISBN 978-1-108-41313-8 [contents] - 2015
- [j20]Anders Claesson, Sergey Kitaev, Anna de Mier:
An involution on bicubic maps and β(0, 1)-trees. Australas. J Comb. 61: 1-18 (2015) - [j19]Anders Claesson, Bridget Eileen Tenner, Henning Úlfarsson:
Coincidence among families of mesh patterns. Australas. J Comb. 63: 88-106 (2015) - 2014
- [j18]Anders Claesson, Stuart A. Hannah:
Decomposing Labeled Interval Orders as Pairs of Permutations. Electron. J. Comb. 21(4): 4 (2014) - [i2]Anders Claesson, Bridget Eileen Tenner, Henning Úlfarsson:
Coincidence among families of mesh patterns. CoRR abs/1412.0703 (2014) - 2013
- [j17]Anders Claesson, Sergey Kitaev, Einar Steingrímsson:
An involution on β(1, 0)-trees. Adv. Appl. Math. 51(2): 276-284 (2013) - 2012
- [j16]Anders Claesson, Vít Jelínek, Einar Steingrímsson:
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns. J. Comb. Theory A 119(8): 1680-1691 (2012) - [i1]Anders Claesson, Henning Úlfarsson:
Sorting and preimages of pattern classes. CoRR abs/1203.2437 (2012) - 2011
- [j15]Anders Claesson, Mark Dukes, Sergey Kitaev:
A direct encoding of Stoimenows matchings as ascent sequences. Australas. J Comb. 49: 47-60 (2011) - [j14]Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev:
Pattern Avoidance in Partial Permutations. Electron. J. Comb. 18(1) (2011) - [j13]Petter Brändén, Anders Claesson:
Mesh Patterns and the Expansion of Permutation Statistics as Sums of Permutation Patterns. Electron. J. Comb. 18(2) (2011) - [j12]Anders Claesson, Mark Dukes, Martina Kubitzke:
Partition and composition matrices. J. Comb. Theory A 118(5): 1624-1637 (2011) - 2010
- [j11]Anders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner:
Boolean complexes for Ferrers graphs. Australas. J Comb. 48: 159-174 (2010) - [j10]Fan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham:
Descent polynomials for permutations with bounded drop size. Eur. J. Comb. 31(7): 1853-1867 (2010) - [j9]Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev:
(2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory A 117(7): 884-909 (2010)
2000 – 2009
- 2009
- [j8]Anders Claesson, Sergey Kitaev, Einar Steingrímsson:
Decompositions and statistics for β(1, 0)-trees and nonseparable permutations. Adv. Appl. Math. 42(3): 313-328 (2009) - 2007
- [j7]Anders Claesson, T. Kyle Petersen:
Conway's Napkin Problem. Am. Math. Mon. 114(3): 217-231 (2007) - 2005
- [j6]Anders Claesson, Toufik Mansour:
Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns. Ars Comb. 77 (2005) - [j5]Anders Claesson:
Counting Segmented Permutations Using Bicoloured Dyck Paths. Electron. J. Comb. 12 (2005) - 2003
- [j4]Anders Claesson, Chris D. Godsil, David G. Wagner:
A permutation group determined by an ordered set. Discret. Math. 269(1-3): 273-279 (2003) - 2002
- [j3]Anders Claesson, Toufik Mansour:
Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations. Adv. Appl. Math. 29(2): 293-310 (2002) - [j2]Petter Brändén, Anders Claesson, Einar Steingrímsson:
Catalan continued fractions and increasing subsequences in permutations. Discret. Math. 258(1-3): 275-287 (2002) - 2001
- [j1]Anders Claesson:
Generalized Pattern Avoidance. Eur. J. Comb. 22(7): 961-971 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
