Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
handle.net/1853/44807
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces TDM-treewidth for graphic matrices with two nonzeros per row and proves polynomial-time solvability for bounded-width integer programs with bounded domains, plus a grid theorem analogue.
citing papers explorer
-
Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
Introduces TDM-treewidth for graphic matrices with two nonzeros per row and proves polynomial-time solvability for bounded-width integer programs with bounded domains, plus a grid theorem analogue.