Follow
Robert Brignall
Robert Brignall
Senior Lecturer, The Open University
Verified email at open.ac.uk
Title
Cited by
Cited by
Year
Simple permutations: decidability and unavoidable substructures
R Brignall, N Ruškuc, V Vatter
Theoretical Computer Science 391 (1-2), 150-163, 2008
632008
A survey of simple permutations
R Brignall
Permutation patterns 376, 41-65, 2010
60*2010
Simple permutations and algebraic generating functions
R Brignall, S Huczynska, V Vatter
Journal of Combinatorial Theory, Series A 115 (3), 423-441, 2008
552008
Decomposing simple permutations, with enumerative consequences
R Brignall, S Huczynska, V Vatter
Combinatorica 28 (4), 385-400, 2008
462008
Permutation classes of polynomial growth
MH Albert, MD Atkinson, R Brignall
Annals of Combinatorics 11 (3), 249-264, 2007
312007
The enumeration of permutations avoiding 2143 and 4231
M Albert, MD Atkinson, R Brignall
arXiv preprint arXiv:1108.0989, 2011
272011
Grid classes and partial well order
R Brignall
Journal of Combinatorial Theory, Series A 119 (1), 99-116, 2012
252012
The enumeration of three pattern classes using monotone grid classes
MH Albert, MD Atkinson, R Brignall
Electronic Journal of Combinatorics 19 (3), P20, 2012
242012
A structural characterisation of Av (1324) and new bounds on its growth rate
D Bevan, R Brignall, AE Price, J Pantone
European Journal of Combinatorics 88, 103115, 2020
212020
Growth rates for subclasses of Av (321)
MH Albert, MD Atkinson, R Brignall, N Ruškuc, R Smith, J West
the electronic journal of combinatorics 17 (R141), 1, 2010
192010
Enumerating indices of Schubert varieties defined by inclusions
MH Albert, R Brignall
Journal of Combinatorial Theory, Series A 123 (1), 154-168, 2014
162014
A counterexample regarding labelled well-quasi-ordering
R Brignall, M Engen, V Vatter
Graphs and Combinatorics 34, 1395-1409, 2018
142018
Labelled well-quasi-order for permutation classes
R Brignall, V Vatter
arXiv preprint arXiv:2103.08243, 2021
122021
Wreath products of permutation classes
R Brignall
arXiv preprint math/0609788, 2006
122006
Linear Clique‐Width for Hereditary Classes of Cographs
R Brignall, N Korpelainen, V Vatter
Journal of Graph Theory 84 (4), 501-511, 2017
112017
Simplicity in relational structures and its application to permutation classes
R Brignall
University of St Andrews, 2007
112007
Rationality for subclasses of 321-avoiding permutations
M Albert, R Brignall, N Ruškuc, V Vatter
European Journal of Combinatorics 78, 44-72, 2019
102019
Staircases, dominoes, and the growth rate of 1324-avoiders
D Bevan, R Brignall, AE Price, J Pantone
Electronic Notes in Discrete Mathematics 61, 123-129, 2017
102017
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
A Atminas, R Brignall, V Lozin, J Stacho
Discrete Applied Mathematics 295, 57-69, 2021
9*2021
monotone grid classes are finitely based
M Albert, R Brignall
Discrete Mathematics & Theoretical Computer Science 18 (Permutation Patterns), 2016
92016
The system can't perform the operation now. Try again later.
Articles 1–20