activity
20142020
most citedBenchmarking treewidth as a practical component of tensor-network--based quantum simulation

14 citations · 19 across the 5 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.DS2020★ 1 cited

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver

Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich

Akiba and Iwata [TCS, 2016] demonstrated that a branch and reduce (B&R) solver for the vertex cover problem can compete favorably with integer linear programming solvers (e.g., CPL…