Skip to content

Algorithms for #BIS-hard problems on expander graphs.

Matthew Jenssen, Peter Keevash, Will Perkins

VenueA*SODA
Year2019
ProceedingsSODA

Browse the full SODA paper archive.