Benjamin Merlin Bumpus

Orcid: 0000-0002-8686-2319

According to our database1, Benjamin Merlin Bumpus authored at least 13 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Towards a Unified Theory of Time-Varying Data.
Appl. Categorical Struct., June, 2026

A Parameterized Algorithm for Testing whether the Limit of a Diagram is Empty.
CoRR, May, 2026

2025
Degree of Satisfiability in Heyting Algebras.
J. Symb. Log., 2025

2024
Pushing Tree Decompositions Forward Along Graph Homomorphisms.
CoRR, 2024

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023
Spined categories: Generalizing tree-width beyond graphs.
Eur. J. Comb., December, 2023

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves.
CoRR, 2023

2022
Structured Decompositions: Structural and Algorithmic Compositionality.
CoRR, 2022

Search-Space Reduction via Essential Vertices.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Generalizing graph decompositions.
PhD thesis, 2021

Edge Exploration of Temporal Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Directed branch-width: A directed analogue of tree-width.
CoRR, 2020

2019
A Constraint Model for the Tree Decomposition of a Graph.
CoRR, 2019


  Loading...