t-uniform hypergraphicality is FPT parameterized by (k,t) using type-based spectrum, balancing hinge-flips to realize any feasible spectrum, and Lenstra IP on binom(t+k-1,k-1) variables.
Mathematics of Operations Research42(1), 95–118 (2017)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches.
RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.
citing papers explorer
-
Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality
t-uniform hypergraphicality is FPT parameterized by (k,t) using type-based spectrum, balancing hinge-flips to realize any feasible spectrum, and Lenstra IP on binom(t+k-1,k-1) variables.
-
RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.