Picture of laptop keyboard

Open Access research that explores socio-technical phenomena & evolving information systems & behaviours...

Strathprints makes available scholarly Open Access content by researchers within the Department of Computer & Information Sciences working as part of the Strathclyde iSchool Research Group (SiRG). The SiRG specialises in understanding how people search for information and explores interactive search tools that support their information seeking and retrieval tasks. This research work also includes investigations into information behaviour, how users engage with information and the legal and ethical issues arising from information use.

Explore the Open Access research by the SiRG, or theDepartment of Computer & Information Sciences more generally. Or explore all of Strathclyde's Open Access research...

Browse by Journal or other publication

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Publication Date | Item type | No Grouping
Jump to: 2019 | 2018 | 2016 | 2015 | 2014 | 2011 | 2010 | 2009 | 2006 | 2005
Number of items: 17.

2019

Gao, Alice L.L. and Kitaev, Sergey (2019) On partially ordered patterns of length 4 and 5 in permutations. The Electronic Journal of Combinatorics, 26 (3). P3.26. ISSN 1077-8926

Dukes, Mark and Selig, Thomas and Smith, Jason P. and Steingrímsson, Einar (2019) Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees. The Electronic Journal of Combinatorics, 26 (3). P3.29. ISSN 1077-8926

2018

Selig, Thomas and Smith, Jason P. and Steingrímsson, Einar (2018) EW-tableaux, Le-tableaux, tree-like tableaux and the Abelian sandpile model. The Electronic Journal of Combinatorics, 25 (3). pp. 1-32. ISSN 1077-8926

2016

Dukes, Mark and White, Chris D (2016) Web matrices : structural properties and generating combinatorial identities. The Electronic Journal of Combinatorics, 23 (1). P1.45. ISSN 1077-8926

2015

Jones, Miles and Kitaev, Sergey and Pyatkin, Artem and Remmel, Jeffrey (2015) Representing graphs via pattern avoiding words. The Electronic Journal of Combinatorics, 22 (2). P2.53. ISSN 1077-8926

2014

Bevan, David (2014) Growth rates of geometric grid classes of permutations. The Electronic Journal of Combinatorics, 21 (4). pp. 1-17. ISSN 1077-8926

Claesson, Anders and Hannah, Stuart Alexander (2014) Decomposing labeled interval orders as pairs of permutations. The Electronic Journal of Combinatorics, 21 (4). P4.16. ISSN 1077-8926

Dukes, Mark (2014) Revstack sort, zigzag patterns, descent polynomials of t-revstack sortable permutations, and Steingrímsson's sorting conjecture. The Electronic Journal of Combinatorics, 21 (2). P2.2. ISSN 1077-8926

2011

Duncan, Paul and Steingrimsson, Einar (2011) Pattern avoidance in ascent sequences. The Electronic Journal of Combinatorics, 18 (1). P226. ISSN 1077-8926

Brändén, Petter and Claesson, Anders (2011) Mesh patterns and the expansion of permutation statistics as sums of permutation patterns. The Electronic Journal of Combinatorics, 18 (2). P5.

Bernini, A. and Ferrari, L. and Steingrimsson, E. (2011) The Möbius function of the consecutive pattern poset. The Electronic Journal of Combinatorics, 18 (1). P146.

Dukes, Mark and Jelínek, Vit and Kubitzke, Martina (2011) Composition matrices, (2+2)-free posets and their specializations. The Electronic Journal of Combinatorics, 18 (1). P44.

Claesson, A. and Jelinek, V. and Jelinkova, E. and Kitaev, S. (2011) Pattern avoidance in partial permutations. The Electronic Journal of Combinatorics, 18 (1). ISSN 1077-8926

2010

Dukes, Mark and Parviainen, Robert (2010) Ascent sequences and upper triangular matrices containing non-negative integers. The Electronic Journal of Combinatorics, 17. R53.

2009

Kitaev, Sergey and Liese, Jeff and Remmel, Jeffrey and Sagan, Bruce (2009) Rationality, irrationality, and Wilf equivalence in generalized factor order. The Electronic Journal of Combinatorics, 16 (2). R22. ISSN 1077-8926

2006

Bevan, David (2006) Sets of points determining only acute angles and some related colouring problems. The Electronic Journal of Combinatorics, 13 (1). R12. ISSN 1077-8926

2005

Claesson, Anders (2005) Counting segmented permutations using bicoloured Dyck paths. The Electronic Journal of Combinatorics, 12. R39. ISSN 1077-8926

This list was generated on Sun Feb 23 09:05:52 2020 GMT.