Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration
Yet Another Simple Proof of the PCRP Theorem
On Approximate Reconfigurability of Label Cover
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
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
On the Parameterized Intractability of Determinant Maximization
Gap Amplification for Reconfiguration Problems
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
Gap Preserving Reductions Between Reconfiguration Problems
On Reconfigurability of Target Sets
On the Parameterized Intractability of Determinant Maximization