Benjamin Merlin Bumpus

According to our database, Benjamin Merlin Bumpus authored at least 12 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Degree of Satisfiability in Heyting Algebras.

Benjamin Merlin Bumpus, Zoltan A. Kocsis

J. Symb. Log., 2025

2024

Pushing Tree Decompositions Forward Along Graph Homomorphisms.

Benjamin Merlin Bumpus, James P. Fairbanks, Will J. Turner

CoRR, 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

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond.

Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Spined categories: Generalizing tree-width beyond graphs.

Benjamin Merlin Bumpus, Zoltan A. Kocsis

Eur. J. Comb., December, 2023

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves.

Ernst Althaus, Benjamin Merlin Bumpus, James P. Fairbanks, Daniel Rosiak

CoRR, 2023

2022

Structured Decompositions: Structural and Algorithmic Compositionality.

Benjamin Merlin Bumpus, Zoltan A. Kocsis, Jade Edenstar Master

CoRR, 2022

Search-Space Reduction via Essential Vertices.

Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Generalizing graph decompositions.

Benjamin Merlin Bumpus

PhD thesis, 2021

Edge Exploration of Temporal Graphs.

Benjamin Merlin Bumpus, Kitty Meeks

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Directed branch-width: A directed analogue of tree-width.

Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson

CoRR, 2020

2019

A Constraint Model for the Tree Decomposition of a Graph.

Benjamin Bumpus, Patrick Prosser, James Trimble

CoRR, 2019