default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Brignall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Robert Brignall:
Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes. Electron. J. Comb. 31(2) (2024)- 2023
- [j26]Robert Brignall
, Daniel Cocks:
A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. SIAM J. Discret. Math. 37(4): 2558-2584 (2023) - 2022
- [j25]Robert Brignall, Daniel Cocks:
Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. Electron. J. Comb. 29(1) (2022) - [i3]Robert Brignall, Daniel Cocks:
A framework for minimal hereditary classes of graphs of unbounded clique-width. CoRR abs/2203.15446 (2022) - 2021
- [j24]Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discret. Appl. Math. 295: 57-69 (2021) - 2020
- [j23]David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
A structural characterisation of Av(1324) and new bounds on its growth rate. Eur. J. Comb. 88: 103115 (2020) - [j22]Aistis Atminas, Robert Brignall:
Well-quasi-ordering and finite distinguishing number. J. Graph Theory 95(1): 5-26 (2020)
2010 – 2019
- 2019
- [j21]Robert Brignall, Jakub Sliacan:
Combinatorial Specifications for Juxtapositions of Permutation Classes. Electron. J. Comb. 26(4): 4 (2019) - [j20]Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum:
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. Discret. Appl. Math. 257: 60-66 (2019) - [j19]Michael H. Albert, Robert Brignall, Nik Ruskuc, Vincent Vatter:
Rationality for subclasses of 321-avoiding permutations. Eur. J. Comb. 78: 44-72 (2019) - 2018
- [j18]Robert Brignall, David Marchant:
The Möbius function of permutations with an indecomposable lower bound. Discret. Math. 341(5): 1380-1391 (2018) - [j17]Robert Brignall, Michael Engen, Vincent Vatter:
A Counterexample Regarding Labelled Well-Quasi-Ordering. Graphs Comb. 34(6): 1395-1409 (2018) - [j16]Michael H. Albert, Aistis Atminas, Robert Brignall:
Characterising inflations of monotone grid classes of permutations. J. Comb. Theory A 154: 444-463 (2018) - 2017
- [j15]Robert Brignall, Jakub Sliacan:
Juxtaposing Catalan Permutation Classes with Monotone Ones. Electron. J. Comb. 24(2): 2 (2017) - [j14]David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
Staircases, dominoes, and the growth rate of 1324-avoiders. Electron. Notes Discret. Math. 61: 123-129 (2017) - [j13]Robert Brignall, Nicholas Korpelainen, Vincent Vatter:
Linear Clique-Width for Hereditary Classes of Cographs. J. Graph Theory 84(4): 501-511 (2017) - 2016
- [j12]Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. 199: 16-29 (2016) - [j11]Michael H. Albert, Robert Brignall:
2×2 monotone grid classes are finitely based. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [i2]Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum:
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. CoRR abs/1607.06864 (2016) - 2015
- [j10]Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter:
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22(2): 2 (2015) - [i1]Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR abs/1503.01628 (2015) - 2014
- [j9]Michael H. Albert, Robert Brignall:
Enumerating indices of Schubert varieties defined by inclusions. J. Comb. Theory A 123(1): 154-168 (2014) - 2012
- [j8]Michael H. Albert, Mike D. Atkinson, Robert Brignall:
The Enumeration of Three Pattern Classes using Monotone Grid Classes. Electron. J. Comb. 19(3): 20 (2012) - [j7]Robert Brignall:
Grid classes and partial well order. J. Comb. Theory A 119(1): 99-116 (2012) - 2010
- [j6]Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West:
Growth Rates for Subclasses of Av(321). Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j5]Robert Brignall, Shalosh B. Ekhad, Rebecca Smith, Vincent Vatter:
Almost avoiding permutations. Discret. Math. 309(23-24): 6626-6631 (2009) - 2008
- [j4]Robert Brignall, Sophie Huczynska, Vincent Vatter:
Decomposing simple permutations, with enumerative consequences. Comb. 28(4): 385-400 (2008) - [j3]Robert Brignall, Sophie Huczynska, Vincent Vatter:
Simple permutations and algebraic generating functions. J. Comb. Theory A 115(3): 423-441 (2008) - [j2]Robert Brignall, Nikola Ruskuc, Vincent Vatter:
Simple permutations: Decidability and unavoidable substructures. Theor. Comput. Sci. 391(1-2): 150-163 (2008) - 2007
- [j1]Robert Brignall:
Wreath Products of Permutation Classes. Electron. J. Comb. 14(1) (2007)
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-06-10 21:28 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:
