A note on the lacking polynomial of the complete bipartite graph.

Characterizing traces of processes defined by precedence and response constraints: An order theory approach.

Difference ascent sequences.

Weak ascent sequences and related combinatorial structures.

Stakeholder Utility Measures for Declarative Processes and Their Use in Process Comparisons.

A maxdrop statistic for standard Young tableaux.

The Federal Disaster Assistance Policy - a declarative analysis.

The sandpile model on the complete split graph, Motzkin words, and tiered parking functions.

Combinatorial diversity metrics for declarative processes: an application to policy process analysis.

Combinatorial diversity metrics for the analysis of policy processes.

Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations.

The Abelian sandpile model on Ferrers graphs - A classification of recurrent configurations.

Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees.

Decomposing recurrent states of the abelian sandpile model.

Web Matrices: Structural Properties and Generating Combinatorial Identities.

Site-specific recombinatorics: in situ cellular barcoding with the Cre Lox system.

Generalized ballot sequences are ascent sequences.

Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma.

Statistics on parallelogram polyominoes and a q, t-analogue of the Narayana numbers.

Revstack Sort, Zigzag Patterns, Descent Polynomials of $t$-revstack Sortable Permutations, and Steingrímsson's Sorting Conjecture.

Web worlds, web-colouring matrices, and web-mixing matrices.

Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a <i>q</i>, <i>t</i>-Narayana polynomial.

Partition and composition matrices.

Composition Matrices, (2+2)-Free Posets and their Specializations.

A direct encoding of Stoimenows matchings as ascent sequences.

(2+2)-free posets, ascent sequences and pattern avoiding permutations.

Descent polynomials for permutations with bounded drop size.

Ascent Sequences and Upper Triangular Matrices Containing Non-Negative Integers.

The area above the Dyck path of a permutation.

Symmetric Schröder paths and restricted involutions.

Combinatorial Gray codes for classes of pattern avoiding permutations.

Wilf classification of three and four letter signed patterns.

Concerning the shape of a geometric lattice.

Permutation statistics on involutions.

Bounds on the number of generalized partitions and some applications.

On a Unimodality Conjecture in Matroid Theory.