activity
20132026
most citedFast Biclustering by Dual Parameterization

6 citations · 9 across the 8 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.DS2025

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination

Matthias Bentert, Alex Crane, Pål Grønås Drange +2

We study graph-theoretic formulations of two fundamental problems in algorithmic differentiation. The first (Structural Optimal Jacobian Accumulation) is that of computing a Jacobi…