default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEinar Steingrímsson
Person information
- affiliation: University of Strathclyde, Glasgow, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson:
Permutations with Few Inversions. Electron. J. Comb. 30(4) (2023)- 2021
- [j25]Antonio Bernini, Matteo Cervetti, Luca Ferrari
, Einar Steingrímsson:
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset. Order 38(3): 473-487 (2021) - 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)
2010 – 2019
- 2019
- [j23]Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrímsson:
Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees. Electron. J. Comb. 26(3): 3 (2019) - [j22]Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrímsson:
The Abelian sandpile model on Ferrers graphs - A classification of recurrent configurations. Eur. J. Comb. 81: 221-241 (2019) - [j21]William Dugan, Sam Glennon, Paul E. Gunnells, Einar Steingrímsson:
Tiered trees, weights, and q-Eulerian numbers. J. Comb. Theory A 164: 24-49 (2019) - 2018
- [j20]Thomas Selig, Jason P. Smith, Einar Steingrímsson:
EW-Tableaux, Le-Tableaux, Tree-Like Tableaux and the Abelian Sandpile Model. Electron. J. Comb. 25(3): 3 (2018) - 2016
- [i1]Michael Albert, Miklós Bóna, István Miklós, Einar Steingrímsson:
Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071). Dagstuhl Reports 6(2): 65-77 (2016) - 2015
- [j19]Richard Ehrenborg, Sergey Kitaev, Einar Steingrímsson:
Number of cycles in the graph of 312-avoiding permutations. J. Comb. Theory A 129: 1-18 (2015) - [j18]Peter R. W. McNamara, Einar Steingrímsson:
On the topology of the permutation pattern poset. J. Comb. Theory A 134: 1-35 (2015) - 2013
- [j17]Anders Claesson, Sergey Kitaev, Einar Steingrímsson:
An involution on β(1, 0)-trees. Adv. Appl. Math. 51(2): 276-284 (2013) - [j16]Mark Dukes, Einan Gardi, Einar Steingrímsson, Chris D. White:
Web worlds, web-colouring matrices, and web-mixing matrices. J. Comb. Theory A 120(5): 1012-1037 (2013) - [p1]Einar Steingrímsson:
Some open problems on permutation patterns. Surveys in Combinatorics 2013: 239-264 - 2012
- [j15]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) - 2011
- [j14]Antonio Bernini, Luca Ferrari, Einar Steingrímsson:
The Möbius Function of the Consecutive Pattern Poset. Electron. J. Comb. 18(1) (2011) - [j13]Paul Duncan, Einar Steingrímsson:
Pattern Avoidance in Ascent Sequences. Electron. J. Comb. 18(1) (2011) - [j12]Alexander Burstein, Vít Jelínek, Eva Jelínková, Einar Steingrímsson:
The Möbius function of separable and decomposable permutations. J. Comb. Theory A 118(8): 2346-2364 (2011)
2000 – 2009
- 2009
- [j11]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
- [j10]Einar Steingrímsson, Lauren K. Williams:
Permutation tableaux and permutation patterns. J. Comb. Theory A 114(2): 211-234 (2007) - 2002
- [j9]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) - 2000
- [j8]Richard Ehrenborg, Einar Steingrímsson:
The Excedance Set of a Permutation. Adv. Appl. Math. 24(3): 284-299 (2000) - [j7]Richard Ehrenborg, Einar Steingrímsson:
Yet Another Triangle for the Genocchi Numbers. Eur. J. Comb. 21(5): 593-600 (2000)
1990 – 1999
- 1998
- [j6]Einar Steingrímsson:
A chromatic partition polynomial. Discret. Math. 180(1-3): 357-368 (1998) - [j5]Richard Ehrenborg, Margaret A. Readdy, Einar Steingrímsson:
Mixed Volumes and Slices of the Cube. J. Comb. Theory A 81(1): 121-126 (1998) - 1997
- [j4]Chun-Wa Ko, Jon Lee, Einar Steingrímsson:
The volume of relaxed Boolean-quadric and cut polytopes. Discret. Math. 163(1-3): 293-298 (1997) - [j3]Robert J. Clarke, Einar Steingrímsson, Jiang Zeng:
Thek-Extensions of some New Mahonian Statistics. Eur. J. Comb. 18(2): 143-154 (1997) - 1996
- [j2]Richard Ehrenborg, Einar Steingrímsson:
Playing Nim on a Simplicial Complex. Electron. J. Comb. 3(1) (1996) - 1994
- [j1]Einar Steingrímsson:
Permutation Statistics of Indexed Permutations. Eur. J. Comb. 15(2): 187-205 (1994)
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-10-07 21:25 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:
