4 citations · 9 across the 15 of their papers we have counts for
4 papers · 1 filter
Degree of Satisfiability in Heyting Algebras
Benjamin Merlin Bumpus, Zoltan A. Kocsis
Given a finite structure and property , it is a natural to study the degree of satisfiability of in ; i.e. to ask: what is the probability that uniformly randomly cho…
Treewidth via Spined Categories (extended abstract)
Zoltan A. Kocsis, Benjamin Merlin Bumpus
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes e…
Spined categories: generalizing tree-width beyond graphs
Benjamin Merlin Bumpus, Zoltan A. Kocsis
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic struct…
Edge exploration of temporal graphs
Benjamin Merlin Bumpus, Kitty Meeks
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the static case, it is NP-hard to determine whether a given temporal graph is tempora…