activity
20172019
most citedMining Maximal Induced Bicliques using Odd Cycle Transversals

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2018★ 1 cited

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…