research
∙
10/23/2022
Finding matchings in dense hypergraphs
We consider the algorithmic decision problem that takes as input an n-ve...
share
research
∙
07/12/2018
Algorithms for #BIS-hard problems on expander graphs
We give an FPTAS and an efficient sampling algorithm for the high-fugaci...
research
∙
05/28/2018
On the number of symbols that forces a transversal
Akbari and Alipour conjectured that any Latin array of order n with at l...
research
∙
10/09/2017