On the Complexity of Approximating Reconfiguration Problems
Reachability of Independent Sets and Vertex Covers under Extended Reconfiguration Rules
Asymptotically Optimal Inapproximability of E𝑘-SAT Reconfiguration
Asymptotically Optimal Inapproximability of Maxmin 𝑘-Cut Reconfiguration
Yet Another Simple Proof of the PCRP Theorem
On Approximate Reconfigurability of Label Cover
Safe Collaborative Filtering
Matroid Semi-Bandits in Sublinear Time
Regular Expressions with Backreferences and Lookaheads Capture NLOG
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
Alphabet Reduction for Reconfiguration Problems
Computational complexity of normalizing constants for the product of determinantal point processes
Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
On the Parameterized Intractability of Determinant Maximization
Gap Amplification for Reconfiguration Problems
Fast and Examination-agnostic Reciprocal Recommendation in Matching Markets
Toward Verifiable and Reproducible Human Evaluation for Text-to-Image Generation
Exploration of Unranked Items in Safe Online Learning to Re-Rank
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
Curse of “Low” Dimensionality in Recommender Systems