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.
Proceedings of the 44th Symposium on Theory of Computing Conference,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
Gives reductions to connected Cayley graphs and embeddings into sums of symmetric Cayley codes while preserving rate, minimum distance and symmetry, plus analysis of direct and Cartesian products.
citing papers explorer
-
Structure of Cayley Codes
Gives reductions to connected Cayley graphs and embeddings into sums of symmetric Cayley codes while preserving rate, minimum distance and symmetry, plus analysis of direct and Cartesian products.