research
∙
07/12/2021
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
For graphs G and H, we say that G is H-free if it does not contain H as ...
share
research
∙
05/11/2021
Sums of Separable and Quadratic Polynomials
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials t...
research
∙
04/24/2020
