4 citations · 9 across the 15 of their papers we have counts for
3 papers · 1 filter
: Truly Linear FPT
Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose +7
Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter , one can uncover why and how many NP-…
Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves
Ernst Althaus, Benjamin Merlin Bumpus, James Fairbanks +1
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initia…
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…