A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
Nearly complete graphs decomposable into large induced matchings and their applications , booktitle =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
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.
citing papers explorer
-
Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
-
Deterministic Volume Estimation of Truncated Hypercubes
Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
-
Hardness and Approximation for Coloring Digraphs
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.