Jagiellonian University Repository

Subexponential-time algorithms for finding large induced sparse subgraphs

Subexponential-time algorithms for finding large ...

Bibliographic description

Files in this item

This item appears in the following Collection(s)

Udzielam licencji. Uznanie autorstwa 3.0 Except where otherwise noted, this item's license is described as Udzielam licencji. Uznanie autorstwa 3.0