233 citations · 519 across the 15 of their papers we have counts for
1 paper · 1 filter
Per Austrin, Toniann Pitassi, Yu Wu
We study the approximability of a number of graph problems: treewidth and pathwidth of graphs, one-shot black (and black-white) pebbling costs of directed acyclic graphs, and a var…