A Constraint Model for the Tree Decomposition of a Graph. - Benjamin Bumpus; Patrick Prosser; James Trimble 001 (CoRR, 2019)

Directed branch-width: A directed analogue of tree-width. - Benjamin Merlin Bumpus; Kitty Meeks; William Pettersson (CoRR, 2020)

Generalizing graph decompositions. - Benjamin Merlin Bumpus (2021)

Structured Decompositions: Structural and Algorithmic Compositionality. - Benjamin Merlin Bumpus; Zoltan A. Kocsis; Jade Edenstar Master (CoRR, 2022)

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves. - Ernst Althaus; Benjamin Merlin Bumpus; James P. Fairbanks; Daniel Rosiak (CoRR, 2023)

Edge Exploration of Temporal Graphs. - Benjamin Merlin Bumpus; Kitty Meeks (Algorithmica, 2023)

Spined categories: Generalizing tree-width beyond graphs. - Benjamin Merlin Bumpus; Zoltan A. Kocsis (Eur. J. Comb., 2023)

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. - Benjamin Merlin Bumpus; Bart M. P. Jansen; Jaime Venne (SWAT, 2024)

Towards a Unified Theory of Time-Varying Data. - Benjamin Merlin Bumpus; James P. Fairbanks; Martti Karvonen; Wilmer Leal; Frédéric Simard (CoRR, 2024)

Pushing Tree Decompositions Forward Along Graph Homomorphisms. - Benjamin Merlin Bumpus; James P. Fairbanks; Will J. Turner (CoRR, 2024)

Search-Space Reduction via Essential Vertices. - Benjamin Merlin Bumpus; Bart M. P. Jansen; Jari J. H. de Kroon (SIAM J. Discret. Math., 2024)

Degree of Satisfiability in Heyting Algebras. - Benjamin Merlin Bumpus; Zoltan A. Kocsis (J. Symb. Log., 2025)