Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
11th International Symposium on Parameterized and Exact Computation,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.
citing papers explorer
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.