1007/S00453-019-00663-9

URL: https://doi · 2023 · Algorithmica · DOI 10.1007/s00453-019-00663-9

1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.

1 Pith paper citing it

2 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-06-30 · unverdicted · novelty 7.0

Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.

Showing 1 of 1 citing paper.

Tight bounds for clique-packing parameterized by clique-width cs.DS · 2026-06-30 · unverdicted · none · ref 2
Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.