Quadratic-Time Algorithm for the Maximum-Weight (k, ℓ)-Sparse Subgraph Problem. - Bence Deák; Péter Madarasi (CoRR, 2025)

Asymptotically faster algorithms for recognizing (k,ℓ)-sparse graphs. - Bence Deák; Péter Madarasi (CoRR, 2026)