| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6072056 | 2023-11-29 | Paper |
| On Erdős’s Proof of the Existence of Cages | 2023-11-23 | Paper |
| Bounds on the lettericity of graphs | 2023-05-04 | Paper |
| Labelled well-quasi-order for permutation classes | 2022-11-23 | Paper |
| Uncountably many enumerations of well-quasi-ordered permutation classes | 2022-11-22 | Paper |
| Letter Graphs and Geometric Grid Classes of Permutations | 2022-11-15 | Paper |
| Letter graphs and modular decomposition | 2022-01-13 | Paper |
| Counting parity palindrome compositions | 2021-09-27 | Paper |
| Bijective Proofs of Proper Coloring Theorems | 2021-06-03 | Paper |
| Containing All Permutations | 2021-01-18 | Paper |
| How many pop-stacks does it take to sort a permutation? | 2020-12-09 | Paper |
| A probabilistic proof of a lemma that is not Burnside's | 2020-07-29 | Paper |
| Growth rates of permutation classes: categorization up to the uncountability threshold | 2020-05-20 | Paper |
| A Probabilistic Proof of a Lemma That Is Not Burnside’s | 2020-01-02 | Paper |
| Growth rates of permutation classes: from countable to uncountable | 2019-11-28 | Paper |
| An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations | 2019-10-16 | Paper |
| On the dimension of downsets of integer partitions and compositions | 2019-09-19 | Paper |
| On the growth of merges and staircases of permutation classes | 2019-07-12 | Paper |
| Rationality for subclasses of 321-avoiding permutations | 2019-06-18 | Paper |
| A counterexample regarding labelled well-quasi-ordering | 2019-01-11 | Paper |
| The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations | 2018-11-28 | Paper |
| On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$ | 2018-08-29 | Paper |
| Universal layered permutations | 2018-08-15 | Paper |
| Generating permutations with restricted containers | 2018-04-27 | Paper |
| Linear Clique‐Width for Hereditary Classes of Cographs | 2017-04-21 | Paper |
| An Erd\H{o}s--Hajnal analogue for permutation classes | 2016-11-03 | Paper |
| Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration | 2016-04-18 | Paper |
| On the effective and automatic enumeration of polynomial permutation classes | 2016-02-19 | Paper |
| Permutation classes | 2015-10-07 | Paper |
| A simple proof of a theorem of Schmerl and Trotter for permutations | 2015-05-20 | Paper |
| Well-quasi-order for permutation graphs omitting a path and a clique | 2015-05-18 | Paper |
| Inflations of geometric grid classes of permutations | 2015-04-02 | Paper |
| Large infinite antichains of permutations | 2015-01-09 | Paper |
| Inflations of Geometric Grid Classes: Three Case Studies | 2014-08-15 | Paper |
| Geometric grid classes of permutations | 2013-09-16 | Paper |
| Generating and enumerating 321-avoiding and skew-merged simple permutations | 2013-06-07 | Paper |
| Finding regular insertion encodings for permutation classes | 2012-03-22 | Paper |
| On points drawn from a circle | 2012-03-06 | Paper |
| Small permutation classes | 2011-12-06 | Paper |
| Counting \(\mathbf {(3+1)}\)-avoiding permutations | 2011-11-29 | Paper |
| Subclasses of the separable permutations | 2011-10-21 | Paper |
| On partial well-order for monotone grid classes of permutations | 2011-08-16 | Paper |
| SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES | 2011-08-01 | Paper |
| Maximal Independent Sets and Separating Covers | 2011-05-20 | Paper |
| On convex permutations | 2011-05-06 | Paper |
| Small configurations in simple permutations | 2010-10-18 | Paper |
| Counting 1324, 4231-avoiding permutations | 2010-03-26 | Paper |
| PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188 | 2010-02-19 | Paper |
| A sharp bound for the reconstruction of partitions | 2009-04-07 | Paper |
| Decomposing simple permutations, with enumerative consequences | 2009-01-20 | Paper |
| Simple permutations and algebraic generating functions | 2008-04-22 | Paper |
| Reconstructing compositions | 2008-03-13 | Paper |
| Enumeration Schemes for Restricted Permutations | 2008-03-10 | Paper |
| Simple permutations: Decidability and unavoidable substructures | 2008-03-05 | Paper |
| Finitely labeled generating trees and restricted permutations | 2007-10-23 | Paper |
| Maximal independent sets in graphs with at mostr cycles | 2007-02-02 | Paper |
| Maximal and maximum independent sets in graphs with at mostr cycles | 2007-02-02 | Paper |
| The Möbius function of a composition poset | 2006-09-28 | Paper |
| Grid classes and the Fibonacci dichotomy for restricted permutations | 2006-08-30 | Paper |
| Bounding quantities related to the packing density of \(1(\ell+1)\ell\cdots 2\) | 2005-01-26 | Paper |
| Bounding quantities related to the packing density of 1(L+1)L...2 | 2004-05-26 | Paper |
| Profile classes and partial well-order for permutations | 2004-02-03 | Paper |
| Permutations avoiding two patterns of length three | 2003-05-13 | Paper |
| Pattern frequency sequences and internal zeros | 2002-09-12 | Paper |
